A proof rule for fair termination of guarded commands
Information and Control - The MIT Press scientific computation series
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Current trends in concurrency. Overviews and tutorials
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Temporal logic and causality in concurrent systems
International Conference on Concurrency on Concurrency 88
Understanding and verifying distributed algorithms using stratified decomposition
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Proving partial order liveness properties
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Defining conditional independence using collapses
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proceedings of the 3rd International Workshop on Distributed Algorithms
Completing the Temporal Picture
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Towards A Theory Of Simulation For Verification Of Concurrent Systems
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Partial ordering derivations for CCS
FCT '85 Fundamentals of Computation Theory
Verification of Concurrent Programs: Temporal Proof Principles
Logic of Programs, Workshop
An efficient verification method for parallel and distributed programs
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Fairness for non-interleaving concurrency
Fairness for non-interleaving concurrency
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Using partial-order methods in the formal validation of industrial concurrent programs
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs
IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
Using partial order techniques to improve performance of data flow analysis based verification
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Relaxed Visibility Enhances Partial Order Reduction
Formal Methods in System Design
Compositional Transformational Design for Concurrent Programs
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Mechanizing Proofs of Computation Equivalence
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
On Stubborn Sets in the Verification of Linear Time Temporal Properties
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Programming methodology
A Mechanized Proof Environment for the Convenient Computations Proof Method
Formal Methods in System Design
Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking
IEEE Transactions on Parallel and Distributed Systems
Journal of Computer Science and Technology
IEEE Transactions on Software Engineering
Proof-guided underapproximation-widening for multi-process systems
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Stubborn Sets in the Verification of Linear Time Temporal Properties
Formal Methods in System Design
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
ACM Computing Surveys (CSUR)
Depth bounded explicit-state model checking
Proceedings of the 18th international SPIN conference on Model checking software
Improving spin's partial-order reduction for breadth-first search
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Relaxing property preservation in the refinement of concurrent systems
2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
Adding Partial Orders to Linear Temporal Logic
Fundamenta Informaticae
| Hi-index | 0.00 |
We present a formal proof method for distributed programs. The semantics used to justify the proof method explicitly identifies equivalence classes of execution sequences which are equivalent up to permuting commutative operations. Each equivalence class is called an interleaving set or a run. The proof rules allow concluding the correctness of certain classes of properties for all execution sequences, even though such properties are demonstrated directly only for a subset of the sequences. The subset used must include a representative sequence from each interleaving set, and the proof rules, when applicable, guarantee that this is the case. By choosing a subset with appropriate sequences, simpler intermediate assertions can be used than in previous formal approaches. The method employs proof lattices, and is expressed using the temporal logic ISTL.