A UNITY mapping operator for distributed programs

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

Volumn 1313, Issue , 1997, Pages 665-684

  Charpentier, Michel ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING; SEMANTICS;

COMMUNICATION MODELING; DISTRIBUTED APPLICATIONS; DISTRIBUTED ARCHITECTURE; DISTRIBUTED PROGRAM; MAPPING OPERATORS;

FORMAL METHODS;

EID: 84947442091     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63533-5_35     Document Type: Conference Paper

References (18)

1. M. Abadi and L. Lamport. The existence of refinement mappings. In 3rd Annual IEEE Symposium on Logic in Computer Science, pages 165-175, Washington D.C., July 1988. Computer Society Press.
2. N. Brown and A. Mokkedem. On mechanizing proofs within a complete proof system for Unity. In Algebraic Methodology and Software Technology, Concordia University of Montr4al, 1995.
3. K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison- Wesley, 1988.
4. M. Charpentier, M. Filali, P. Mauran, G. Padiou, and P. Qufiinnec. Observer pour R4partir. In Journdes du GDR programmation, Grenoble, novembre 1995.
5. M. Charpentier, M. Filali, P. Mauran, G. Padiou, and P. Qu4innec. Abstracting communication to reason about distributed algorithms. In Özalp Babaoğlu and Keith Marzullo, editors, lOth Int'l Workshop on Distributed Algorithms (WDAG'95), volume 1151 of Lecture Notes in Computer Science, pages 89-104, October 1996.
6. M. Charpentier, M. Filali, P. Mauran, G. Padiou, and P. Quéinnec. Répartition par observation dans Unity. Technical Report 96-01-R, IRIT, 27 pages, janvier 1996.
7. M. Charpentier, A. E1 Hadri, and G. Padiou. A Unity-based Algorithm Design Assistant. In Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 131-145, Aarhus, Denmark, May 1995. BRICS Notes Series NS- 95-2.
8. M. Charpentier, A. E1 Hadri, and G. Padiou. Preuve Automatique dans un Environnement de D4veloppement Unity. T.S.I. Technique et Science Informatiques, 15(1), janvier 1996.
9. P. Coltette. Design of Compositional Proof Systems Based on Assumption- Commitment Specifications. Application to UNITY. These de docteur en sciences appliquées, Facultédes Sciences Appliquées, Université Catholique de Louvain, June 1994.
10. M. Filali, Ph. Mauran, and G. Padiou. Raffiner pour répartir. In Quatriémes rencontres du paralldIisme, Villeneuve D'Ascq, 1992.
11. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
12. J. Misra. A Logic for Concurrent Programming. Technical report, The University of Texas at Austin, Austin, Texas 78712, April 1994.
13. J. Misra. A Logic for Concurrent Programming. Technical report, The University of Texas at Austin, Austin, Texas 78712, September 1994. Chapter 6: Closures Properties.
14. M, Raynal. Algorithmique du paralIdlisme: le probl~me de I'excIusion mutueIle. Dunod~ 1984.
15. B. A. Sanders. Eliminating the Substitution Axiom from UNITY Logic. Formal Aspects of Computing, 3(2):189-205, April-June 1991.
16. A. U. Shankar. An Introduction to Assertional Reasoning for Concurrent Systems. ACM Computing Surveys, 25(3):225-262, September 1993.
17. R. T. Udink. Program Refinement in Unity-like Environments. PhD thesis, Utrecht University, September 1995.
18. R.T. Udink and J.N. Kok. On the relation between Unity properties and sequences of states. In J.W de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science, pages 594-608, 1993.