Hoare-style compositional proof systems for reactive shared variable concurrency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1346, Issue , 1997, Pages 267-283

  de Boer, F S ^a   Hannemann, U ^b   de Roever, W P ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

ASSERTION LANGUAGE; COMMUNICATION INTERFACE; COMPOSITIONAL LOGIC; MUTUAL EXCLUSION ALGORITHMS; REACTIVE PROGRAMS; SHARED VARIABLES; STRONGEST POSTCONDITIONS; WELL-FOUNDED ORDERINGS;

COMPUTER CIRCUITS;

EID: 84949237231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0058036     Document Type: Conference Paper

References (26)

1. P. Aczel. On an inference rule for parallel composition, unpublished note, 1993.
2. F.S. de Boer, U. Hannemann and W.-P. de Roever. A compositional proof system for shared variable concurrency, to appear at FME '97, LNCS, 1997.
3. H. Barringer, R. Kuiper, and A. Pnueli. Now you may compose temporal logic specifications. In 16th ACM symposium on Theory of Computation, pages 51-63, 1984.
4. F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures: Towards a paradigm for asynchronous communication. In Proceedings of Concur '91, Lecture Notes in Computer Science, Vol. 527, pages 111-126, 1991.
5. S. Brookes. A fully abstract semantics of a shared variable parallel language. In Proceedings 8th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, pages 98-109, 1993.
6. S.D. Brookes, C.A.R. Hoare and A.W. Roscoe. A Theory of Communicating Sequential Processes. JACM 31(7), pp. 560-599, 1984.
7. S.A. Cook. Soundness and completeness of an axiom system for program verification. In SIAM J. on Computing 7, pp. 70-90, 1978.
8. R.W. Floyd. Assigning meaning to Programs. Mathematical Aspects of Computer Science XIX, American Mathematical Society, 1967.
9. E.C.R, Hehner, C.A.R. Hoare. A more complete model of Communicating Processes. TCS 26, pp. 134-120, 1983.
10. J. Hooman. Specification and compositional verification of real-time systems. Lecture Notes in Computer Science, Vol. 558, 1992.
11. C.B. Jones. Development methods for computer programs including a notion of interference. PhD thesis, Oxford University Computing Laboratory, 1981.
12. L. Lamport. Verification and specification of concurrent programs. In A Decade of Concurrency (eds. J.W. de Bakker, W.-P. de Roever and G. Rozenberg), Lecture Notes in Computer Science, Vol. 803, 1993.
13. J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engeneering, 7(7):417-426, 1981.
14. P. Pandya: Compositional Verification of Distributed Programs. Ph. D. Thesis, University of Bombay, 1988.
15. P. Pandya and M. Joseph: P-A logic - a compositional proof system for distributed programs. Distributed Computing, Vol. 5, pp. 37-54, 1991.
16. W.-P. de Roever, F.S. de Boer, U. Hannemann, J. Hooman, Y. Lakhnech, P. Pandya, M. Poel, H. Schepers, Q. Xu and J. Zwiers. State-Based Proof Theory of Concurrency: from Noncompositional to Compositional Methods, to appear 1998.
17. K. Stølen. Development of Parallel Programs on Shared Data-structures. PhD thesis, Computer Science Department, Manchester University, 1990.
18. N. Sounderarajan. Axiomatic semantics of communicating sequential processes. TOPLAS, 6:647-662, 1984.
19. N. Sounderarajan. A proof technique for parallel programs. Theoretical Computer Science, Vol. 31, pp. 13-29, 1984.
20. J.V. Tucker and J.I. Zucker. Program correctness over abstract data types, with error-state semantics. In CWI Monograph Series, vol. 6, Centre for Mathematics and Computer Science/North-Holland, 1988.
21. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. In Acta Informatika, 6:319-340, 1976.
22. Q. Xu. A theory of state -based parallel programming. PhD thesis, Oxford University Computing Laboratory, 1992.
23. Q. Xu, W.-P. de Roever and J. He. Rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects of Computing 1997 (To appear).
24. C.C. Zhou and C.A.R. Hoare. Partial Correctness of CSP. Proc. IEEE Int. Conf. on Distributed Computer Systems, pp. 1-12, 1981.
25. J. Zwiers, W.-P. de Roever and P. van Emde Boas: Compositionality and concurrent networks: soundness and completeness of a proofsystem. Technical Report 57, University of Nijmegen, The Netherlands, 1984.
26. J. Zwiers. Compositionality, Concurrency, and Partial Correctness. Lecture Notes in Computer Science, Vol. 321, Springer-Verlag, 1989.