Compositional Proofs by Partial Specification of Processes

The purpose of this paper is to present and illustrate a new compositional proof method for non-deterministic and concurrent systems; i.e. a method which allows factoring the correctness proof of a system into similar but smaller proofs of correctness of subsystems.

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

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

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

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

[5]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

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

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

[8]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

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