Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Theoretical Computer Science
Global events and global breakpoints in distributed systems
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Partial orders for parallel debugging
PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
ACM Computing Surveys (CSUR)
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Detecting relational global predicates in distributed systems
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
Detecting atomic sequences of predicates in distributed computations
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Consistent global states of distributed systems: fundamental concepts and mechanisms
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Detection of Weak Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
Reachability Analysis on Distributed Executions
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Detection of Unstable Predicates in Distributed Programs
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Detecting relational global predicates in distributed systems
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
ENF event predicate detection in distributed systems
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Communication-Induced Determination of Consistent Snapshots
IEEE Transactions on Parallel and Distributed Systems
Techniques to Tackle State Explosion in Global Predicate Detection
IEEE Transactions on Software Engineering
Distributed Predicate Detection in Series-Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Methods for Observing Global Properties in Distributed Systems
IEEE Parallel & Distributed Technology: Systems & Technology
An Efficient Distributed Online Algorithm to Detect Strong Conjunctive Predicates
IEEE Transactions on Software Engineering
Detecting Temporal Logic Predicates on the Happened-Before Model
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Predicate Control for Active Debugging of Distributed Programs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A Fine-Grained Modality Classification for Global Predicates
IEEE Transactions on Parallel and Distributed Systems
Distributed algorithm to detect strong conjunctive predicates
Information Processing Letters
Predicate control: synchronization in distributed computations with look-ahead
Journal of Parallel and Distributed Computing
Detecting global predicates in distributed systems with clocks
Distributed Computing
Communication-based prevention of useless checkpoints in distributed computations
Distributed Computing
Detection of global predicates: techniques and their limitations
Distributed Computing
Causality-Based Predicate Detection across Space and Time
IEEE Transactions on Computers
Testing Distributed Systems Through Symbolic Model Checking
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
On Detecting Regular Predicates in Distributed Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A pattern-based approach for modeling and analyzing error recovery
Architecting dependable systems IV
Web services discovery and constraints composition
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Detection of disjunctive normal form predicate in distributed systems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Middleware clocks for sensing the physical world
Proceedings of the 5th International Workshop on Middleware Tools, Services and Run-Time Support for Sensor Networks
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Strongly consistent global states detection using relative clock errors
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
A lattice-theoretic approach to runtime property detection for pervasive context
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
Repeated detection of conjunctive predicates in distributed executions
Information Processing Letters
Immediate detection of predicates in pervasive environments
Journal of Parallel and Distributed Computing
FM'06 Proceedings of the 14th international conference on Formal Methods
Monitoring for hierarchical web services compositions
TES'05 Proceedings of the 6th international conference on Technologies for E-Services
Detecting stable locality-aware predicates
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
This paper discusses detection of global predicates in a distributed program. A run of a distributed program results in a set of sequential traces, one for each process. These traces may be combined to form many global sequences consistent with the single run of the program. A strong global predicate is true in a run if it is true for all global sequences consistent with the run. We present algorithms which detect if the given strong global predicate became true in a run of a distributed program. Our algorithms can be executed on line as well as off line. Moreover, our algorithms do not assume that underlying channels satisfy FIFO ordering.