Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Nondeterministic data flow programs: how to avoid the merge anomaly
Science of Computer Programming
Tcl and the Tk toolkit
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Abstract interpretation: a semantics-based tool for program analysis
Handbook of logic in computer science (vol. 4)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A method and tool for analyzing fault-tolerance in systems
A method and tool for analyzing fault-tolerance in systems
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs
Formal Methods in System Design
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Distributed Algorithms
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards Fault-Tolerant and Secure Agentry
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
Automated Stream-Based Analysis of Fault-Tolerance
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Functional Specification of Time Sensitive Communicating Systems
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Analysis of Discrete Event Coordination
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A FORMAL MODEL OF NON-DETERMINATE DATAFLOW COMPUTATION
A FORMAL MODEL OF NON-DETERMINATE DATAFLOW COMPUTATION
| Hi-index | 0.00 |
A method for automated analysis of fault-tolerance of distributed systems is presented. It is based on a stream (or data-flow) model of distributed computation. Temporal (ordering) relationships between messages received by a component on different channels are not captured by this model. This makes the analysis more efficient and forces the use of conservative approximations in analysis of systems whose behavior depends on such inter-channel orderings. To further support efficient analysis, our framework includes abstractions for the contents, number, and ordering of messages sent on each channel. Analysis of a reliable broadcast protocol illustrates the method.