All from one, one for all: on model checking using representatives

Peled, Doron

doi:10.1007/3-540-56922-7_34

Cited by 359 publications

(268 citation statements)

References 16 publications

Supporting

Mentioning

265

Contrasting

Order By: Relevance

“…The partial order reduction method was originally introduced in three independent works [17,14,11]. The approach has been further developed, but in connection with linear temporal properties, state-based LTL has always been assumed.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Partial Order Reduction for State/Event LTL

Beneš

Brim

Černá

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL [6,5] incorporates both states and events to express important properties of component-based software systems.The main contribution of the paper is a partial order reduction technique for verification of state/event LTL properties. The core of the partial order reduction is a novel notion of stuttering equivalence which we call state/event stuttering equivalence. The positive attribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weak state/event LTL, which is invariant under the new equivalence.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The idea of the ample set method [14,15] is to construct a reduced state space by choosing a smaller set of successors at each state. Instead of exploring all successors from a given state, denoted as enabled(s), we explore only successors from ample(s) ⊆ enabled(s).…”

Section: Partial Order Reductionmentioning

confidence: 99%

Partial Order Reduction for State/Event LTL

Beneš

Brim

Černá

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This approach allows for the detection of subtle implementation errors that are usually missed by abstraction-based software model checkers. In the case of concurrent systems, partial-order reduction [15,13,6] can be used to reduce the size of the state space by exploiting the commutativity of concurrently executed transitions that result in the same state when executed in different orders.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Path Reduction for Software Model Checking

Yang

Al-Rawi

Sakallah

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general technique which we consider here in the context of the bounded model checking of sequential programs with nondeterministic conditionals. The DPR approach is based on the symbolic analysis of concrete executions. For each explored execution path π that does not reach an abort statement, we repeatedly apply a weakest-precondition computation to accumulate the constraints associated with an infeasible sub-path derived from π by taking the alternative branch to an if-then-else statement. We then use an SMT solver to learn the minimally unsatisfiable core of these constraints. By further learning the statements in π that are critical to the sub-path's infeasibility as well as the control-flow decisions that must be taken to execute these statements, unexplored paths containing the same unsatisfiable core can be efficiently and dynamically pruned. Our preliminary experimental results show that DPR can prune a significant percentage of execution paths, a percentage that grows with the size of the instance of the problem being considered.

show abstract

“…Symbolic model checking [4] avoids explicit construction of the state space by performing symbolic fixpoint computation. Partial-order reduction [17] tries to explore only representative transitions and ignores other redundant transitions. But these techniques still suffer from having to explore a huge state space, which in turn is greatly dependent on the search strategy used for exploration.…”

Section: Introductionmentioning

confidence: 99%

Subsumer-First: Steering Symbolic Reachability Analysis

Rybalchenko

Singh

2009

Model Checking Software

View full text Add to dashboard Cite

Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space when searching for proofs or counterexamples. The choice of exploration strategy employed by the analysis has direct impact on its success, whereas the ability to find short counterexamples quickly and-as a complementary task-to efficiently perform the exhaustive state space traversal are of utmost importance for the majority of verification efforts. Existing exploration strategies can optimize only one of these objectives which leads to a sub-optimal reachability analysis, e.g., breadth-first search may sacrifice the exploration efficiency and chaotic iteration can miss minimal counterexamples. In this paper we present subsumer-first, a new approach for steering symbolic reachability analysis that targets both minimal counterexample discovery and efficiency of exhaustive exploration. Our approach leverages the result of fixpoint checks performed during symbolic reachability analysis to bias the exploration strategy towards its objectives, and does not require any additional computation. We demonstrate how the subsumer-first approach can be applied to improve efficiency of software verification tools based on predicate abstraction. Our experimental evaluation indicates the practical usefulness of the approach: we observe significant efficiency improvements (median value 40%) on difficult verification benchmarks from the transportation domain.

show abstract

All from one, one for all: on model checking using representatives

Cited by 359 publications

References 16 publications

Partial Order Reduction for State/Event LTL

Partial Order Reduction for State/Event LTL

Dynamic Path Reduction for Software Model Checking

Subsumer-First: Steering Symbolic Reachability Analysis

Contact Info

Product

Resources

About