Testing Semantics: Connecting Processes and Process Logics
暂无分享,去创建一个
[1] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .
[2] David Lee,et al. Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.
[3] Joël Ouaknine,et al. Duality for Labelled Markov Processes , 2004, FoSSaCS.
[4] Samson Abramsky,et al. Domain Theory in Logical Form , 1991, LICS.
[5] Bart Jacobs. Trace Semantics for Coalgebras , 2004, CMCS.
[6] Zohar Manna,et al. Verification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthday , 2004 .
[7] Dusko Pavlovic,et al. Guarded Transitions in Evolving Specifications , 2002, AMAST.
[8] Bernhard Steffen,et al. Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..
[9] A. Church. Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies , edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153. , 1958, Journal of Symbolic Logic.
[10] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[11] Daniele Varacca,et al. The powerdomain of indexed valuations , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[12] Ichiro Hasuo,et al. Context-Free Languages via Coalgebraic Trace Semantics , 2005, CALCO.
[13] Jan J. M. M. Rutten,et al. Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..
[14] Gordon D. Plotkin,et al. Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[15] Jan J. M. M. Rutten,et al. Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..
[16] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[17] Dusko Pavlovic,et al. Composition and refinement of behavioral specifications , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).
[18] G. Choquet. Theory of capacities , 1954 .
[19] Samson Abramsky,et al. A Domain Equation for Bisimulation , 1991, Inf. Comput..
[20] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[21] Alexander Kurz,et al. Ultrafilter Extensions for Coalgebras , 2005, CALCO.
[22] Marcello M. Bonsangue,et al. Duality for Logics of Transition Systems , 2005, FoSSaCS.
[23] Dusko Pavlovic,et al. Colimits for Concurrent Collectors , 2003, Verification: Theory and Practice.
[24] Bart Jacobs,et al. A Bialgebraic Review of Regular Expressions, Deterministic Automata and Languages , 2005 .
[25] Dusko Pavlovic,et al. On Completeness and Cocompleteness in an Around Small Categories , 1995, Ann. Pure Appl. Log..
[26] Martin Hyland. A small complete category , 1988, Ann. Pure Appl. Log..
[27] Martin Peschke,et al. Design and Validation of Computer Protocols , 2003 .