Composition: A way to make proofs harder

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

Volumn 1536, Issue , 1998, Pages 402-423

  Lamport, Leslie ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPOSITIONAL REASONING; PARALLEL COMPOSITION;

ARTIFICIAL INTELLIGENCE;

EID: 84949226644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49213-5_15     Document Type: Conference Paper

References (11)

1. Martm Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, May 1991.
2. Martin Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, May 1995.
3. Yehuda Afek, Geoffrey Brown, and Michael Merritt. Lazy caching. ACM Transactions on Programming Languages and Systems, 15(1):182-205, January 1993.
4. Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21(4):181-185, October 1985.
5. E. A. Ashcroft. Proving assertions about parallel programs. Journal of Computer and System Sciences, 10:110-135, February 1975.
6. Edsger W. Dijkstra. A personal summary of the Gries-Owicki theory. In Eds-ger W. Dijkstra, editor, Selected Writings on Computing: A Personal Perspective, chapter EWD554, pages 188-199. Springer-Verlag, New York, Heidelberg, Berlin, 1982.
7. R. P. Kurshan and Leslie Lamport. Verification of a multiplier: 64 bits and beyond. In Costas Courcoubetis, editor, Computer-Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 166-179, Berlin, June 1993. Springer-Verlag. Proceedings of the Fifth International Conference, CAV'93.
8. Leslie Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering, SE-3(2):125-143, March 1977.
9. Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872-923, May 1994.
10. Leslie Lamport. How to write a proof. American Mathematical Monthly, 102(7):600-608, August-September 1995.
11. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319-340, 1976.