Axioms for concurrent objects

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130236, Issue , 1987, Pages 13-26

  Herlihy, Maurice P ^a   Wing, Jeannette M ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

AXIOMATIC SPECIFICATIONS; CONCURRENT OBJECTS; CONCURRENT PROGRAM; CORRECTNESS CONDITIONS; LINEARIZABILITY; SEQUENTIAL PROGRAMS; SPECIFICATION AND VERIFICATION;

ABSTRACT DATA TYPES;

EID: 85034779732     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41625.41627     Document Type: Conference Paper

References (29)

1. J.A. Goguen, J.W. Thatcher, E.G. Wagner, and J.B. Wright. Abstract Data Types as Initial Algebras and Correctness of Data Representations. In Proceedings from the Conference of Computer Graphics, Pattern Recognition and Data Structures, pages 89-93. ACM, May, 1975.
2. K.R. Apt, N. Francez, and W.P. DeRoever. A Proof System for Communicating Sequential Processes. ACM Transactions on Programming Languages and Systems 2(3):359-385, 1980.
3. G. Birkhoff and J.D. Lipson. Heterogeneous Algebras. Journal of Combinatorial Theory 8:115-133, 1970.
4. R.M. Burstall and J.A. Goguen. Putting Theories Together to Make Specifications. In Fifth International Joint Conference on Artilicial Intelligence, pages 1045-1058. August, 1977. Invited paper.
5. H.-D. Ehrich. Extensions and Implementations of Abstract Data Type Specifications. Lecture Notes in Computer Science. Volume 64. Mathematical Foundations of Computer Science 1978 Proceedings. Springer-Verlag, Poland, 1978, pages 155-164. 7th Symposium.
6. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Springer-Verlag, Berlin, 1985.
7. A. Gottlieb, B.D. Lubachevsky, and L. Rudolph. Basic Techniques For the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors. ACM Transactions on Programming Languages and Systems 5(2):164-189, April, 1983.
8. J.V. Guttag. The Specification and Application to Programming of Abstract Data Types. PhD thesis, University of Toronto, Toronto, Canada, September, 1975.
9. J.V. Guttag, E. Horowitz, and D.R. Musser. Abstract Data Types and Software Validation. CACM 21(12):1048-1064, December, 1978.
10. J.V. Guttag, J.J. Horning, and J.M. Wing. Larch in Five Easy Pieces. Technical Report 5, DEC Systems Research Center, July, 1985.
11. J.V. Guttag, J.J. Horning, and J.M. Wing. The Larch Family of Specification Languages. IEEE Software 2(5):24-36, September, 1985.
12. B.T. Hailpern and S. Owicki. Verifying Network Protocols Using Temporal Logic. In Proceedings Trends and Applications 1980: Computer Network Protocols, pages 18-28. IEEE Computer Society, 1980.
13. C.A.R. Hoare. An Axiomatic Basis for Computer Programming. Communications of the ACM 12(10):576-583, October, 1969.
14. C.A.R. Hoare. Proof of Correctness of Data Representations. Acta Informatica 1(1):271-281, 1972.
15. C.A.R. Hoare. Communicating Sequential Processes. Communications of the ACM 21 (8):666-677, August, 1978.
16. S. Kamin. Final Data Types and Their Specification. ACM Transactions on Programming Languages and Systems 5(1):97-121, January, 1983.
17. L. Lamport. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE Transactions on Computers C-28(9):690, September, 1979.
18. L. Lamport. Specifying Concurrent Program Modules. ACM Transactions on Programming Languages and Systems 5(2):190-222, April, 1983.
19. L. Lamport. On Interprocess Communication. Technical Report 8, DEC Systems Research Center, 1985. To appear in Distributed Computing.
20. B.H. Liskov and J.V. Guttag. Abstraction and Specification in Program Development. The MIT Press, 1988.
21. Z. Manna and A. Pnueli. Verification of Concurrent Programs, Part I: The Temporal Framework. Technical Report STAN-CS-81-836, Dept. of Computer Science, Stanford University, June, 1981.
22. J. Misra. Axioms for Memory Acoess in Asynchronous Hardware Systems. ACM Transactions on Programming Languages and Systems 8(1):142-153, January, 1986.
23. S. Owicki and D. Gries. An Axiomatic Proof Technique for Parallel Programs. Actalnformatica 6(4):319-340, 1976.
24. S. Owicki and D. Gries. Verifying Properties of Parallel Programs: An Axiomatic Approach. Communications of the ACM 19(5):279-286, May, 1976.
25. S. Owicki and L. Lamport. Proving Liveness Properties of Concurrent Programs. ACM Transactions on Programming Languages and Systems 4(3):455-495, July, 1982.
26. C.H. Papadimitriou. The Serializability of Concurrent Database Updates. Journal of the ACM 26(4):631-653, October, 1979.
27. A. Pnueli. The Temporal Logic of Programs. In 18th Annual Symposium on Foundations of Computer Science, pages 46-57. Providence, R1, Oct. 31 Nov. 2, 1977.
28. M. Wand. Final Algebra Semantics and Data Type Extensions. Journal of Computer and System Sciences 19(1):27-44, August, 1979.
29. S.N. Zilles. Abstract Specifications for Data Types. IBM Research Laboratory, San Jose, CA, 1975.