The Community for Technology Leaders
14th International Conference on Distributed Computing Systems (1994)
Pozman, Poland
June 21, 1994 to June 24, 1994
ISBN: 0-8186-5840-1
pp: 396-403
C. Jard , IRISA, Rennes, France
G.-V. Jourdan , IRISA, Rennes, France
ABSTRACT
The problem of checking the correctness of distributed computations arises when debugging distributed algorithms, and more generally when testing protocols or distributed applications. For that purpose, one describes the expected behavior (or suspected errors) by a global property: for example, a predicate on process variables, or the set of admissible orderings on observable events. The problem is to check whether this property is satisfied or not during the execution. A relevant model for this study is the partial order of message causality and the associated state graph, called "lattice of consistent cuts". In this paper, we propose a general approach to trace checking, based on partial order theory.<>
INDEX TERMS
distributed algorithms, program debugging, protocols
CITATION

C. Jard, G. Jourdan, T. Jeron and J. Rampon, "A general approach to trace-checking in distributed computing systems," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 396-403.
doi:10.1109/ICDCS.1994.302443
90 ms
(Ver 3.3 (11022016))