Combining partial order reductions with on-the-fly model-checking
@article{Peled1994CombiningPO,
title={Combining partial order reductions with on-the-fly model-checking},
author={Doron A. Peled},
journal={Formal Methods in System Design},
year={1994},
volume={8},
pages={39-64}
}Partial order model-checking is an approach to reduce time and memory in model-checking concurrent programs. On-the-fly model-checking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state during its generation. We prove conditions under which these two methods can be combined in order to gain reduction from both. An extension of the model-checker SPIN, which implements this combination, is studied, showing…
550 Citations
An Improvement of Partial-Order Verification
- Computer ScienceSoftw. Test. Verification Reliab.
- 1998
This paper builds on SPIN’s partial-order reduction method to yield an approach that enables further space reductions for verifying concurrent programs.
Partial-order methods for model checking: from linear time to branching time
- Computer ScienceProceedings 11th Annual IEEE Symposium on Logic in Computer Science
- 1996
A general technique for lifting partial-order methods from linear-time to branching-time logics is introduced and is shown to be applicable both to reductions that are applied to the structure representing the program before running the model checking procedure, as well as to reduction that can be obtained when model checking is done in an automata-theoretic framework.
Partial Order Reduction in Directed Model Checking
- Computer ScienceSPIN
- 2002
This work analyzes how to combine directed model checking with partial order reduction methods and gives experimental results on how the combination of both techniques performs.
Partial Order Reduction: Model-Checking Using Representatives
- Computer Science, MathematicsMFCS
- 1996
This paper surveys some algorithms for partial order model-checking and focuses on the verification using representatives approach, which is extended to branching specifications.
What's Wrong with On-the-Fly Partial Order Reduction
- Computer ScienceCAV
- 2019
A standard algorithm combining the two optimizations, published over twenty years ago, has been widely studied and deployed in popular model checking tools, yet the algorithm is incorrect and a fix for a restricted class of property automata is proposed.
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
- Computer Science, MathematicsFoSSaCS
- 2020
A flaw in the reasoning is identified and it is shown with a counter-example that stutter-trace equivalence is not necessarily preserved, and a solution is proposed together with an updated correctness proof.
Partial-order verification in SPIN can be more efficient
- Computer Science
- 2002
This paper builds on SPIN’s partial-order reduction method to yield an approach which enables further reductions in space and time for verifying concurrent programs.
Partial Order Reductions
- Mathematics, Computer Science
- 2000
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences…
Relaxed Visibility Enhances Partial Order Reduction
- Computer ScienceFormal Methods Syst. Des.
- 1997
This paper relaxes the constraint about commuting the order of atomic actions that may change the value of propositions appearing in the checked specification, allowing a weaker requirement to be imposed, and thus achieving a better reduction.
Combining Partial-Order Reduction and Symbolic Model Checking to Verify LTL Properties
- Computer ScienceNASA Formal Methods
- 2011
This paper presents an algorithm that combines symbolic model checking and POR to verify linear temporal logic properties without the next operator (LTLX), which performs better on models featuring asynchronous processes.
References
SHOWING 1-10 OF 40 REFERENCES
A partial approach to model checking
- Computer Science[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
- 1991
A model-checking method for linear-time temporal logic that avoids the state explosion due to the modeling of concurrency by interleaving by relying on the concept of the Mazurkiewicz trace as a semantic basis and using automata-theoretic techniques.
Using Partial Orders to Improve Automatic Verification Methods
- Computer Science, MathematicsCAV
- 1990
A verification method for concurrent finite-state systems that attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency by interleavings and introduces the notion of “trace automation” which generates only one linearization per partial order.
All from One, One for All: on Model Checking Using Representatives
- Computer Science, MathematicsCAV
- 1993
An algorithm for constructing a state graph that contains at least one representative sequence for each equivalence class, and a formula rewriting technique is presented to allow coarser equivalence relation among sequences, such that less representatives are needed.
An improvement in formal verification
- Computer ScienceFORTE
- 1994
This paper proposes a new reduction method that solves some of the problems of redundancy caused by the many possible interleavings of inde- pendent actions in a concurrent system.
A stubborn attack on state explosion
- MathematicsFormal Methods Syst. Des.
- 1990
The LTL-preserving stubborn set method is presented for reducing the amount of work needed in the automatic verification of concurrent systems with respect to linear-time temporal logic specifications.
On-the-Fly Verification with Stubborn Sets
- Computer ScienceCAV
- 1993
A new on-the-fly verification method that uses a generalization of Buchi automata called “tester processes” for representing and detecting illegal behaviour and applies the stubborn set theory in a new way is presented.
How to cook a temporal proof system for your pet language
- Computer SciencePOPL '83
- 1983
An abstract temporal proof system is presented whose program-dependent part has a high-level interface with the programming language actually studied, and is shown to be relatively complete with respect to pure first-order temporal logic.
Checking that finite state concurrent programs satisfy their linear specification
- Computer SciencePOPL
- 1985
An algorithm for checking satisfiability of a linear time temporal logic formula over a finite state concurrent program and a formal proof in case the formula is valid over the program is presented.
Stubborn sets for reduced state space generation
- Computer ScienceApplications and Theory of Petri Nets
- 1989
The “stubborn set” theory and method for generating reduced state spaces and a more advanced version suited to the analysis of properties of reactive systems is developed.