Abstract
The paper presents basic algorithms for trace checking of distributed programs. In distributed systems, detecting global properties requires a careful analysis of the causal structure of the execution. Based on the on-the-fly observation of the partial order of message causality, we show how to build the lattice of all the reachable states of the distributed system under test. The regular structure of this graph makes it possible to build it with a quasi-linear complexity, which improves substantially the state-of-theart.
Chapter PDF
References
G. Birkhoff. Rings of sets. Duke Math J-3, 311–316, 1937.
R. Bonnet and M. Pouzet. Linear extension of ordered sets. In I.Rival, editor, Ordered Sets, pages 125–170, D.Reidel Publishing Company, 1982.
J.P. Bordat. Calcul des idéaux d'un ordonné fini. Recherche opérationnelle/Operations Research, 25(3):265–275, 1991.
K. M. Chandy and L. Lamport. Distributed snapshots: determining global states of distributed systems. ACM TOCS, 3(1):63–75, 1985.
B. Charron-Bost. Combinatorics and geometry of consistent cuts: application to concurency theory. In Bermond and Rayna, editors, Proceedings of the international workshop on distributed algorithms, pages 45–56, Springer-Verlag, LNCS 392, France, Nice 1989.
B. Charron-Bost, C. Delporte, and H. Fauconnier. Local and Temporal Predicates in Distributed Systems. Research report 92-36, LITP-Paris 7, 1992.
R. Cooper and K. Marzullo. Consistent detection of global predicates. In Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, pages 163–173, Santa Cruz, California, May 1991.
C. Diehl and C. Jard. Interval approximations of message causality in distributed executions. In Finkel and Jantzen, editors, STACS, pages 363–374, Springer-Verlag, LNCS 577, Cachan, february 1992.
J. Fidge. Timestamps in message passing systems that preserve the partial ordering. In Proc. 11 th Australian Computer Science Conference, pages 55–66, february 1988.
Vijay K. Garg and Brian Waldecker. Detection of Unstable Predicates in Distributed Programs. Technical Report TR-92-07-82, University of Texas at Austin, march 1992.
P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety. In Computer Aided Verification, LNCS 575, pages 332–342, Aalborg, Denmark., 1991.
M. Habib, M. Morvan, and J.X. Rampon. Remarks on some concurrency measures. In Graph-Theoretic Concepts in Computer Science, pages 221–238, LNCS 484, june 1990.
C. Jard and J.-M. Jézéquel. ECHIDNA, an Estelle-compiler to prototype protocols on distributed computers. Concurrency Practice and Experience, 4(5):377–397, August 1992.
Bordat J.P. Sur l'algorithmique combinatoire d'ordres finis. Thèse de doctorat d'état, USTL Montpellier, 1992.
L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
T. Leblanc and J. Mellor-Crummey. Debugging parallel programs with instant replay. IEEE Transactions on Computers, C-36(4):471–482, April 1987.
E. Leu, A. Schiper, and A. Zramdini. Efficient execution replay techniques for distributed memory architectures. In Arndt Bode, editor, Proc. of the Second European Distributed Memory Computing Conference, Munich, pages 315–324, apr 1991.
Hurfin M., N. Plouzeau, and M. Raynal. Détection de séquences atomiques de prédicats locaux dans les exécutions réparties. Research report, IRISA, 1993.
F. Mattern. Virtual time and global states of distributed systems. In Cosnard, Quinton, Raynal, and Robert, editors, Proc. Int. Workshop on Parallel and Distributed Algorithms Bonas, France, Oct. 1988, North Holland, 1989.
R. Schwarz and F. Mattern. Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail. Technical Report 215/91, University of Kaiserslautern, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diehl, C., Jard, C., Rampon, JX. (1993). Reachability analysis on distributed executions. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_94
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive