On the Fly Testing of Regular Patterns in Distributed Computations
- 1 August 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 73-76
- https://doi.org/10.1109/icpp.1994.138
Abstract
A class of properties of distributed computations is described and an algorithm which detects them is presented. This class of properties called regular patterns allows the user to specify an expected (or unwanted) behavior of a computation as sequences of relevant events (or as sequences of local predicates that must be successively verified). The sequences are defined by a finite state automaton (hence the name regular patterns) A computation verifies the property if and only if one of its causal paths matches a sequence.Keywords
This publication has 11 references indexed in Scilit:
- Breakpoints and halting in distributed programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A general approach to trace-checking in distributed computing systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Detecting causal relationships in distributed computations: In search of the holy grailDistributed Computing, 1994
- Debugging tool for distributed Estelle programsComputer Communications, 1993
- Reachability analysis on distributed executionsPublished by Springer Nature ,1993
- Detection of unstable predicates in distributed programsPublished by Springer Nature ,1992
- Consistent detection of global predicatesPublished by Association for Computing Machinery (ACM) ,1991
- The causal ordering abstraction and a simple way to implement itInformation Processing Letters, 1991
- High-level debugging of distributed systems: The behavioral abstraction approachJournal of Systems and Software, 1983
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978