Detection of strong predicates in distributed programs
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 692-699
- https://doi.org/10.1109/spdp.1991.218195
Abstract
This paper discusses detection of unstable predicates in a distributed program. Some applications of this are in program debugging and testing. The authors provide a predicate logic in the form of a grammar giving the rewrite rules for constructing predicates about a distributed program. This predicate logic is general enough to describe many conditions programmers are interested in. These predicates may depend on the global state of the system and may be unstable in nature. However, the detection algorithms given guarantee to detect such predicates should one ever become true. The main results of this work are a logic for expressing unstable distributed predicates and detection methods for certain unstable distributed predicates.<>Keywords
This publication has 7 references indexed in Scilit:
- Breakpoints and halting in distributed programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Causal distributed breakpointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Consistent detection of global predicatesPublished by Association for Computing Machinery (ACM) ,1991
- Debugging concurrent programsACM Computing Surveys, 1989
- Partial orders for parallel debuggingPublished by Association for Computing Machinery (ACM) ,1988
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978