A compositional proof system for shared variable concurrency

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

Volumn 1313, Issue , 1997, Pages 515-532

  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

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASSERTION LANGUAGE; PROOF SYSTEM; SHARED VARIABLES; WELL-FOUNDED ORDERINGS;

FORMAL METHODS;

EID: 67649836660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63533-5_27     Document Type: Conference Paper

References (25)

1. K.R. Apt, N. Francez and W. P. de Roever. A proof system for Communicating Sequential Processes. In ACM Transactions on Programming Languages and Systems, 2:359-385, 1980.
2. 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.
3. F.S. de Boer, J.N. Kok, C. Palaxaidessi, 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.
4. 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.
5. S.D. Brookes, C.A.R. ttoare and A.W. Roscoe. A Theory of Communicating Sequential Processes. JACM 31(7), pp. 560 - 599, 1984.
6. S.A. Cook. Soundness and completeness of an axiom system for program verification. In SIAM J. on Computing 7, pp. 70-90, 1978.
7. E.W. Dijkstra. Solution of a problem in concurrent programming control. In Comm. ACM 8, 1965.
8. EW. Dijkstra. Co-operating sequential processes. In Academic Press, New York, 1968.
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. M. Joseph, P. Pandya. Specification and Verification of Total Correctness of Distributed Programs. Research report RR 96, University of Warwick, 1987
13. Y. Kesten, Z. Manna and A. Pnueli, Temporal verification ofsimulation and refinement 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.
14. 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.
15. J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engeneering, 7(7):417-426, 1981.
16. E.-R. Olderog and C.A.R. Hoare. Specification oriented Programming in TCSP. Proc. of the 10th ICALP, LNCS 154, 1983.
17. K. StOlen. 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. J. Widom, D. Grins and F.B. Schneider. Completeness and Incompleteness of Trace-based Network Proof Systems. Proc. of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 27 - 38, 1987.
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 parallelprogramming. 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. Compositionality, Concurrency, and Partial Correctness. Lecture Notes in Computer Science, Vol.321, Springer-Verlag, 1989