ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement

Podelski, Andreas; Rybalchenko, Andrey

doi:10.1007/978-3-540-69611-7_16

Cited by 119 publications

(113 citation statements)

References 17 publications

Supporting

Mentioning

113

Contrasting

Order By: Relevance

“…In this paper we revisit the use of the Ramsey-based termination arguments used in the iterative-based approach to termination proving used in tools such as ARMC [23], Terminator [8], and the termination proving module of CProver [6,14]: rather than iteratively finding Ramsey-based termination arguments, we instead aim to iteratively find traditional lexicographic termination arguments. The advantage of this approach is that the validity checking step in the iterative process is much easier.…”

Section: Introductionmentioning

confidence: 99%

Ramsey vs. Lexicographic Termination Proving

Cook

See

Zuleger

2013

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Termination proving has traditionally been based on the search for (possibly lexicographic) ranking functions. In recent years, however, the discovery of termination proof techniques based on Ramsey's theorem have led to new automation strategies, e.g. size-change, or iterative reductions from termination to safety. In this paper we revisit the decision to use Ramsey-based termination arguments in the iterative approach. We describe a new iterative termination proving procedure that instead searches for lexicographic termination arguments. Using experimental evidence we show that this new method leads to dramatic speedups.

show abstract

Section: Introductionmentioning

confidence: 99%

Ramsey vs. Lexicographic Termination Proving

Cook

See

Zuleger

2013

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…Table 1 shows the performance of SLAB on a range of benchmarks. For comparison, we also give the running times of the Abstraction Refinement Model Checker ARMC [7], the Berkeley Lazy Abstraction Software Verification Tool BLAST [4] and the New Symbolic Model Checker NuSMV [3], where applicable. The benchmarks include a finite-state concurrent systems (Deque and Philosophers), an infinite-state discrete system (Bakery), and a real-time system (Fisher).…”

Section: Armc Blastmentioning

confidence: 99%

SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems

Dräger

Kupriyanov

Finkbeiner

et al. 2010

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system is correct, it is desirable for a verifier to obtain not a simple "yes" answer, but some independently checkable certificate of correctness. We present SLAB -the first certifying model checker for infinite-state concurrent systems. The tool uses a procedure that interleaves automatic abstraction refinement using Craig interpolation with slicing, which removes irrelevant states and transitions from the abstraction. Given a transition system and a safety property to check, SLAB either finds a counterexample or produces a certificate of system correctness in the form of inductive verification diagram. Slicing AbstractionsSLAB (for sl icing abstractions) is an automatic certifying model checker that implements the abstraction refinement loop presented in [1]. It interleaves refinement steps with slicing, which tracks the dependencies between variables and transitions in a system and removes irrelevant parts.SLAB maintains an explicit graph representation of the abstract model: each node represents a set of concrete states, identified by a set of predicates; each edge represents a set of concrete transitions, identified by their transition relations.Starting with the initial abstraction, the abstract model is transformed by refinement and slicing steps until the system is proved correct or a concretizable error path is found.A refinement step increases the precision of the abstraction by introducing a new predicate, which is obtained by Craig interpolation from the unsatisfiable formula corresponding to some spurious error path. To minimize the increase in the size of the graph, the new predicate is only applied to one specific node on the error path. This node is split into two copies, the labels of which now additionally contain the new predicate and its negation, respectively.A slicing step reduces the size of the abstraction while maintaining all error paths. Elimination rules drop nodes and edges from the abstraction if they have

show abstract

“…The empirical evaluation on industrial benchmarks of this search strategy implemented in ARMC [18], a predicate abstraction based model checker, presents its efficacy. The search strategy saves in the abstraction computation phase across the refinement iterations.…”

Section: Introductionmentioning

confidence: 99%

Subsumer-First: Steering Symbolic Reachability Analysis

Rybalchenko

Singh

2009

Model Checking Software

Self Cite

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

ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement

Cited by 119 publications

References 17 publications

Ramsey vs. Lexicographic Termination Proving

Ramsey vs. Lexicographic Termination Proving

SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems

Subsumer-First: Steering Symbolic Reachability Analysis

Contact Info

Product

Resources

About