Towards a compositional approach to the design and verification of distributed systems?

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

Volumn 1708, Issue , 1999, Pages 570-589

  Charpentier, Michel ^a   Chandy, K Mani ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Component based design; Distributed systems; Formal specification; Formal verification; Temporal logic; Unity

Indexed keywords

COMPUTATION THEORY; COMPUTER SOFTWARE REUSABILITY; DESIGN; FORMAL SPECIFICATION; FORMAL VERIFICATION; SPECIFICATIONS; TEMPORAL LOGIC;

BOTTOM UP; COMPONENT BASED APPROACH; COMPONENT BASED DESIGN; COMPONENT REUSE; DISTRIBUTED SYSTEMS; FORMAL DESIGN; TOPDOWN; UNITY;

FORMAL METHODS;

EID: 84958036164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48119-2_32     Document Type: Conference Paper

References (39)

1. M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73-132, Jan. 1993.
2. M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, May 1995.
3. R. Back. Refinement calculus, Part I: Sequential nondeterministic programs. In REX Workshop on Stepwise Refinement of Distributed Systems, volume 430 of Lecture Notes in Computer Science, 42-66. Springer-Verlag, 1989.
4. R. Back. Refinement calculus, Part II: Parallel and reactive programs. In REX Workshop on Stepwise Refinement of Distributed Systems, volume 430 of Lecture Notes in Computer Science, 67-93. Springer-Verlag, 1989.
5. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
6. K. M. Chandy and B. A. Sanders. Predicate transformers for reasoning about concurrent computation. Science of Computer Programming, 24:129-148, 1995.
7. K. M. Chandy and B. A. Sanders. Reasoning about program composition. Technical Report 96-035, University of Florida, Department of Computer and Information Science and Engineering, 1996.
8. D. Chappell. Understanding ActiveX and OLE. Microsoft Press, 1996.
9. M. Charpentier. Assistance à la Répartition de Systèmes Réactifs. PhD thesis, Institut National Polytechnique de Toulouse, France, Nov. 1997.
10. M. Charpentier and K. M. Chandy. Examples of program composition illustrating the use of universal properties. In J. Rolim, editor, International workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA'99), volume 1586 of Lecture Notes in Computer Science, 1215-1227. Springer-Verlag, Apr. 1999.
11. M. Charpentier and K. M. Chandy. Towards a compositional approach to the design and verification of distributed systems. Technical Report CS-TR-99-02, California Institute of Technology, Jan. 1999. 29 pages.
12. M. Charpentier, M. Filali, P. Mauran, G. Padiou, and P. Quèinnec. Abstracting communication to reason about distributed algorithms. In Ö. Babaoğlu and K. Marzullo, editors, Tenth International Workshop on Distributed Algorithms (WDAG'96), volume 1151 of Lecture Notes in Computer Science, 89-104. Springer-Verlag, October 1996.
13. M. Charpentier, M. Filali, P. Mauran, G. Padiou, and P. Quèinnec. Tailoring Unity to distributed program design. In J. Rolim, editor, International workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA'98), volume 1388 of Lecture Notes in Computer Science, 820-832. Springer-Verlag, April 1998.
14. P. Collette. Composition of assumption-commitment specifications in a Unity style. Science of Computer Programming, 23:107-125, 1994.
15. P. Collette. Design of Compositional Proof Systems Based on Assumption-Commitment Specifications. Application to Unity. Doctoral thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, June 1994.
16. P. Gardiner and C. Morgan. Data refinement of predicate transformers. Theoretical Computer Science, 87:143-162, 1991.
17. D. Garlan. Higher-order connectors. In Proceedings of Workshop on Compositional Software Architectures, Monterey, California, Jan. 1998.
18. R. Helm, I. M. Holland, and D. Gangopadhyay. Contracts: Specifying behavioral compositions in object-oriented systems. In European Conference on Object- Oriented Programming/ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, volume 25/10, 169-180, 1990.
19. C. Jones. Tentative steps toward a development method for interfering programs. ACM Transactions on Programming Languages and Systems, 5(4):596-619, 1983.
20. J. R. Kiniry. CDL: A component description language. In Proceedings of the COOTS '99 Advanced Topics Workshop on Validating the Composition/Execution of Component-Based Systems, 1999.
21. S. Lam and A. Shankar. Specifying modules to satisfy interfaces-a state transition approach. Distributed Computing, 6(1):39-63, July 1992.
22. S. Lam and A. Shankar. A theory of interfaces and modules 1: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55-71, Jan. 1994.
23. R. Manohar and P. Sivilotti. Composing processes using modified rely-guarantee specifications. Technical Report CS-TR-96-22, California Institute of Technology, 1996.
24. B. Meyer. Object-Oriented Software Construction. Prentice-Hall, Inc., 2nd edition, 1988.
25. B. Meyer. Applying design by contract. IEEE Computer, Oct. 1992.
26. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, 1997.
27. J. Misra. A logic for concurrent programming: Progress. Journal of Computer and Software Engineering, 3(2):273-300, 1995.
28. J. Misra. A logic for concurrent programming: Safety. Journal of Computer and Software Engineering, 3(2):239-272, 1995.
29. O. Nierstrasz, S. Gibbs, and D. Tsichritzis. Component-oriented software development. Communications of the ACM, 35(9):160-165, Sept. 1992.
30. O. Nierstrasz and T. Meijler. Requirements for a composition language. In ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, 147-161. Springer-Verlag, 1995.
31. O. Nierstrasz and D. Tsichritzis, editors. Object-Oriented Software Composition. Prentice-Hall, Inc., 1995.
32. Object Management Group (OMG). The Common Object Request Broker: Architecture and Specification (CORBA), revision 2.0. Object Management Group (OMG), 2.0 edition.
33. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
34. B. A. Sanders. Eliminating the substitution axiom from Unity logic. Formal Aspects of Computing, 3(2):189-205, April-June 1991.
35. B. A. Sanders. Data refinement of mixed specification: A generalization of Unity. Acta Informatica, 35(2):91-129, 1998.
36. N. Shankar. Lazy compositional verification. In Compositionality: The Significant Difference. International Symposium, COMPOS'97, volume 1536 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
37. P. A. G. Sivilotti. A Method for the Specification, Composition, and Testing of Distributed Object Systems. PhD thesis, California Institute of Technology, 256-80 Caltech, Pasadena, California 91125, Dec. 1997.
38. Sun Microsystems, Inc. JavaBeans API specification, version 1.01. Technical report, Sun Microsystems, Inc., July 1997.
39. C. Szyperski. Component Software: Beyond Object-Oriented Programming. Addison-Wesley Publishing Company, 1997.