Program Composition and Modular Verification

Program composition and modularity have proven themselves as an important approach for simplifying the design and verification of large programs.

[1]  Colin Stirling,et al.  A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language , 1988, Theor. Comput. Sci..

[2]  Nissim Francez,et al.  A compositional approach to superimposition , 1988, POPL '88.

[3]  Willem P. de Roever,et al.  Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem , 1985, ICALP.

[4]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

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

[6]  Ira R. Forman,et al.  Superimposition for Interacting Processes , 1990, CONCUR.

[7]  A. J. M. van Gasteren,et al.  Derivation of a Termination Detection Algorithm for Distributed Computations , 1983, Inf. Process. Lett..

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

[9]  Krzysztof R. Apt,et al.  Formal Justification of a Proof System for Communicating Sequential Processes , 1983, JACM.

[10]  S. Ramesh.  On the Completeness of Modular Proof Systems , 1990, Inf. Process. Lett..

[11]  Ernst-Rüdiger Olderog,et al.  Proving termination of parallel programs , 1990 .

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[13]  Eli Gafni,et al.  Perspectives on Distributed Network Protocols: A Case for Building Blocks , 1986, MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's.