Examples of program composition illustrating the use of universal properties

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

Volumn 1586, Issue , 1999, Pages 1215-1227

  Charpentier, Michel ^a   Mani Chandy, K ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPONENTS INTERACTION; SHARED VARIABLES; UNIVERSAL PROPERTIES;

ARTIFICIAL INTELLIGENCE;

EID: 84957678977     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0098004     Document Type: Conference Paper

References (13)

1. Martffi Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, May 1995.
2. R.J.R. Back. Refinement of parallel and reactive programs. Technical report, Marktoberdorf Summer School on Programming Logics, 1992.
3. K. Mani Chandy and Michel Charpentier. An experiment in program composition and proof. Submitted to Formal Methods in System Design, September 1998.
4. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
5. K. Mani Chandy and Beverly A. Sanders. Predicate transformers for reasoning about concurrent computation. Science of Computer Programming, 24:129-148, 1995.
6. K. Mani Chandy and Beverly A. Sanders. Reasoning about program composition. Technical Report 96-035, University of Florida, Department of Computer and Information Science and Engineering, 1996.
7. Michel Charpentier. A UNITY mapping operator for distributed programs. In J. Fitzgerald, C.B. Jones, and E Lucas, editors, Fourth International Symposium of Formal Methods Europe (FME’97), volume 1313 of Lecture Notes in Computer Science, pages 665-684. Springer-Verlag, September 1997.
8. Pierre Collette. Design of Compositional Proof Systems Based on Assumption-Commitment Speeificutions. Application to UNITY. Doctoral thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, June 1994.
9. Mamoun Filali, Philippe Mauran, and Géard Padiou. Raffiner pour répartir. In Actes des quatriemes Rencontres franeophones du Parallélisme (RenPar’4), Villeneuve D’ Ascq, France, 1992.
10. S. S. Lam and A. U. Shankar. A theory of interfaces and modules 1: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55-71, January 1994.
11. C. Morgan, E Gardiner, K. Robinson, and T. Vickers. On the Refinement Calculus. FACIT. Springer-Verlag, 1994.
12. Beverly A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2): 189-205, April-June 1991.
13. Rob T. Udink. Program Refinement in UNITY-like Environments. PhD thesis, Utrecht University, September 1995.