Compositional Theories Based on an Operational Semantics of Contexts

For the verification of large systems in general and parallel systems in particular, it is essential that the proof method used is compositional in order to avoid a combinatorial explosion of the verification. That is, the method must allow us to decompose the problem of correctness for a complex system into similar correctness problems for the components of the system.

[1]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[2]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[3]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[4]  Joachim Parrow,et al.  Submodule Construction as Equation Solving in CCS , 1989, Theor. Comput. Sci..

[5]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[6]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[7]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[8]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[9]  Jan Friso Groote,et al.  Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) , 1989, ICALP.

[10]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[11]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[12]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[13]  K. Larsen.  Context-dependent bisimulation between processes , 1986 .

[14]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.

[15]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[16]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[17]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[18]  Kim G. Larsen,et al.  Proof System for Hennessy-Milner Logic with Recursion , 1988, CAAP.

[19]  J Job Zwiers.  Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes and Their Relationship , 1989 .

[20]  Robin Milner,et al.  Interpreting one Concurrent Calculus in Another , 1990, Theor. Comput. Sci..

[21]  Kim G. Larsen.  A Context Dependent Equivalence Between Processes , 1987, Theor. Comput. Sci..

[22]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[23]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[24]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[25]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[26]  Job Zwiers,et al.  Compositionality, Concurrency and Partial Correctness , 1989, Lecture Notes in Computer Science.

[27]  Robin Milner,et al.  Verifying a Protocol Using Relativized Bisimulation , 1987, ICALP.

[28]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..