Compositional Specification and Verification of Distributed Systems

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 16, Issue 2, 1994, Pages 259-303

  Jonsson, Bengt ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

assertional reasoning; compositionality; message passing; modular specification; specification; stepwise refinement

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DATA COMMUNICATION SYSTEMS; DATA PROCESSING; DISTRIBUTED DATABASE SYSTEMS; SOFTWARE ENGINEERING; STATE ASSIGNMENT; THEOREM PROVING;

ASSERTIONAL REASONING; COMPOSITIONAL SPECIFICATION AND VERIFICATION; MESSAGE PASSING; STEPWISE REFINEMENT;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0028400387     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/174662.174665     Document Type: Article

References (43)

1. ABADI, M., AND LAMPORT, L. 1991. The existence of refinement mappings. Theor. Comput. Sci. 82, 2, 253-284.
2. ALPERN, B., AND SCHNEIDER, F. B. 1989. Verifying temporal properties without temporal logic. ACM Trans. Program. Lang. Systems, 11, 1, 147-167.
3. ALPERN, B., AND SCHNEIDER, F. B. 1987. Proving boolean combinations of deterministic properties. In Proceedings of the 2nd IEEE International Symposium on Logic in Computer Science. IEEE, New York.
4. BACK, R. J. R. 1990. Refinement calculus, part II: Parallel and reactive programs. In Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness. Lecture Notes in Computer Science, vol. 430. Springer-Verlag, New York.
5. BACK, R. J. R., AND KURKI-SUONIO, R. 1988. Distributed cooperation with action systems. ACM Trans. Program. Lang. Syst. 10, 4, (Oct.), 513-554.
6. BACK, R. J. R., AND SERE, K. 1991. Stepwise refinement of action systems. Struct. Program. 12, 17-30.
7. CHANDY, K. M., AND MISRA, J. 1988. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Mass.
8. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J.
9. DROST, N. J., AND VAN LEEUWEN, J. 1988. Assertional verification of a majority consensus algorithm for concurrency control in multiple copy databases. In Concurrency 88. Lecture Notes in Computer Science, vol. 335. Springer-Verlag, New York, 320-334.
10. FLOYD, R. 1967. Assigning meanings to programs. In Proceedings of the ACM Symposium on Applied Mathematics, vol. 19. ACM, New York, 19-32.
11. FRANCEZ, N. 1986. Fairness. Springer-Verlag, New York.
12. GRIES, D. 1981. The Science of Programming. Springer-Verlag, New York.
13. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, N.J.
14. HOARE, C. A. R. 1969 An axiomatic basis for computer programming. Commun ACM 12, 10, 576-583.
15. JENSEN, K. 1991. Coloured petri nets: A high level language for system design and analysis. In Advances in Petri Nets 1990. Lecture Notes in Computer Science, vol. 483. Springer-Verlag, New York, 342-416.
16. JONSSON, B. 1991. Simulations between specifications of distributed systems. In Proceedings of CONCUR '91, Theories of Concurrency: Unification and Extension. Lecture Notes in Computer Science, vol. 527. Springer-Verlag, New York, 346-360.
17. JONSSON, B. 1987. Compositional verification of distributed systems. Ph.D. thesis, Dept. of Computer Systems, Uppsala Univ, Uppsala, Sweden.
18. JONSSON, B. 1985. A model and proof system for asynchronous networks. In Proceedings of the 4th ACM Symposium on Principles of Distributed Computing. ACM, New York, 49-58.
19. LAM, S. S., AND SHANKAR, A. U. 1990. Refinement and projection of relational specifications. In Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness. Lecture Notes in Computer Science, vol. 430. Springer-Verlag, New York, 454-486.
20. LAM, S. S., AND SHANKAR, A. U. 1984. Protocol verification via projections IEEE Trans. Softw. Eng. SE-10, 4 (July), 325-342.
21. LAMPORT, L. 1991 The temporal logic of actions. Tech. Rep., DEC/SRC.
22. LAMPORT, L. 1989. A simple approach to specifying concurrent systems. Commun. ACM 32, 1 (Jan.), 32-45.
23. LAMPORT, L. 1983. Specifying concurrent program modules. ACM Trans. Program. Lang. Syst. 5, 2, 190-222.
24. LEHMAN, D., PNUELI, A., AND STAVI, J. 1981. Impartiality, justice and fairness: The ethics of concurrent termination. In ICALP '81. Lecture Notes in Computer Science, vol. 115. Springer-Verlag, New York.
25. LYNCH, N. A., AND TUTTLE, M. R. 1987. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing. ACM, New York, 137-151.
26. MANNA, Z., AND PNUELI, A. 1992. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, New York.
27. MANNA, Z., AND PNUELI, A. 1989. The anchored version of the temporal framework. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science, vol. 354, Springer-Verlag, New York, 201-284.
28. MANNA, Z., AND PNUELI, A. 1987. Specification and verification of concurrent programs by $$-Automata. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages. ACM, New York.
29. MANNA, Z., AND PNUELI, A. 1984. Adequate proof principles for invariance and liveness properties of concurrent programs. Sci. Comput. Program. 4, 4 257-289.
30. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, N.J.
31. MISRA, J. 1984. Reasoning about networks of communicating processes. In Proceedings of the INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specifïcation of Concurrent Systems.
32. MISRA, J., AND CHANDY, K. M. 1981. Proofs of networks of processes. IEEE Trans. Softw. Eng. SE-7, 4, (July), 417-426.
33. NGUYEN, V., DEMERS, A., GRIES, D., AND OWICKI, S. 1986. A model and temporal proof system for networks of processes. Distrib. Comput. 1, 1, 7-25.
34. ORAVA, F. 1989. Verifying safety and deadlock properties of networks of asynchronously communicating processes. In Protocol Specifications, Testing, and Verification IX. IFIP WG 6.1, North-Holland, Netherlands, 357-372.
35. OSSEFORT, M. 1982. A unified approach to formal verification of network safety properties. Ph.D. thesis, Dept. of Computer Science, Univ. of Texas at Austin.
36. OWICKI, S., AND LAMPORT, L. 1982. Proving liveness properties of concurrent programs. ACM Trans. Program. Lang. Syst. 4, 3, 455-495.
37. PNUELI, A. 1986. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In Current Trends in Concurrency. Lecture Notes in Computer Science, vol. 224. Springer-Verlag, New York, 510-584.
38. STARK, E. W. 1988. Proving entailment between conceptual state specifications. Theor. Comput. Sci. 56, 135-154.
39. STARK, E. W. 1984. Foundations of a theory of specification for distributed systems. Ph.D. thesis, Massachussetts Inst, of Technology, Cambridge, Mass.
40. THOMAS, R. H. 1979. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4, 2, 180-209.
41. VARDI, M. Y., AND WOLPER, P. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of the 1st IEEE International Symposium on Logic in Computer Science. IEEE, New York, 332-344.
42. ZWIERS, J. 1989. Compositionality, Concurrency and Partial Correctness. Lecture Notes in Computer Science, vol. 321. Springer-Verlag, New York.
43. ZWIERSM, J., DE ROEVER, W. P., AND VAN EMDE BOAS, P. 1985. Compositionality and concurrent networks: Soundness and completeness of a proof system. In Proceedings of ICALP '85. Lecture Notes in Computer Science, vol. 194. Springer-Verlag, New York.