A Complete Compositional Model Proof System for a Subset of CCS

Logical proof systems for concurrent programs are notoriously complex, often involving arbitrary restrictions. One of the main reasons for this is that unlike other major programming concepts parallelism does not appear to have a logical correlate. Using a simple semantic strategy we tentatively propose one and offer an example compositional modal proof theory for a subset of Milner's CCS. The proof rules are reminiscent of Gentzen introduction rules except that there are also introduction rules for the combinators of CCS.

[1]  Matthew Hennessy,et al.  The Power of the Future Perfect in Program Logics , 1984, Inf. Control..

[2]  Joseph Sifakis,et al.  A Unified Approach for Studying the Properties of Transition Systems , 1982, Theor. Comput. Sci..

[3]  Robert M. Keller,et al.  A Fundamental Tehoerem of Asynchronous Parallel Computation , 1974, Sagamore Computer Conference.

[4]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[5]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[6]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

[7]  Glynn Winskel,et al.  On the Composition and Decomposition of Assertions , 1984, Seminar on Concurrency.

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

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

[10]  Joseph Sifakis,et al.  Property Preserving Homomorphisms of Transition Systems , 1983, Logic of Programs.

[11]  Colin Stirling.  A Proof-Theoretic Characterization of Observational Equivalence , 1985, Theor. Comput. Sci..

[12]  Stephen D. Brookes,et al.  Behavioural Equivalence Relations Induced by Programming Logics , 1983, ICALP.

[13]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

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

[15]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[16]  Rocco De Nicola,et al.  Testing Equivalence for Processes , 1983, ICALP.

[17]  Joseph Sifakis,et al.  A Modal Characterization of Observational Congruence on Finite Terms of CCS , 1984, ICALP.

[18]  Colin Sterling,et al.  A Complete Modal Proof System for a Subset of SCCS , 1985, TAPSOFT, Vol.1.

[19]  Glynn Winskel,et al.  A Complete System for SCCS with Modal Assertions , 1985, FSTTCS.

[20]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[21]  Samson Abramsky,et al.  Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming , 1983, FCT.

[22]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[23]  Willem P. de Roever,et al.  A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..

[24]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

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