Abstracting communication to reason about distributed algorithms

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

Volumn 1151, Issue , 1996, Pages 89-104

  Charpentier, Michel ^a   Filali, Mamoun ^a   Mauran, Philippe ^a   Padiou, Gérard ^a   Quéinnec, Philippe ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

ABSTRACT LEVELS; ALGORITHM PROPERTIES; COMMUNICATION PATTERN; DISTRIBUTED SYSTEMS; LOW LEVEL REPRESENTATION;

MESSAGE PASSING;

EID: 84947436476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61769-8_7     Document Type: Conference Paper

References (17)

1. Gregory R. Andrews and Fred B. Schneider. Concepts and notations for concurrent programming. Computing Surveys, 15(1):3-43, March 1983.
2. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
3. M. Charpentier, M. Filali, P. Manran, G. Padiou, and P. Quéinnec. Répartition par observation darts Unity. Technical Report 96-01-R, IRIT, 27 pages, January 1996.
4. Michel Charpentier. Une sémantique pour Unity avec section observe. Technical report, IRIT, April 1996.
5. Michel Charpentier, Abdellah El Hadri, and Gérard 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.
6. Vilay K. Garg. Principles of Distributed Systems. Kluwer Academic Publisher, 1996.
7. Rob Gerth and Amir Pnueli. Rooting UNITY. In Proc. fifth Int. Workshop on Software Specification and Design, pages 11-19, May 1989.
8. David Moshe Goldschlag. Mechanically Verifiyng Concurrent Programs. PhD thesis, University of Texas at Austin, May 1992.
9. M.J.C. Gordon and T.F. Melham. Introduction to HOL: A Theorem Proving Environnement for Higher Order Logic. Cambridge University Press, 1993.
10. C. A. R. Hoare. Coomunicating Sequential Processes. Prentice-Hall International, 1984.
11. Leslie Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the A CM, 21(7):558-565, July 1978.
12. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.
13. Friedemann Mattern. Algorithms for distributed termination detection. Distributed Computing, 2:161-175, 1987.
14. Jayadev Misra. A logic for concurrent programming. Technical report, The University of Texas at Austin, April 1994.
15. G. Ricart and A.K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1):9-17, January 1981.
16. Beverly A. Sanders. Eliminating the substitution axiom from Unity logic. Formal Aspects of Computing, 3(2):189-205, 1991.
17. R.T. Udink and J.N. Kok. On the relation between Unity properties and sequence 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.