Explicit-State software model checking based on CEGAR and interpolation

Authors:
Dirk Beyer;Stefan Löwe
Affiliations:
University of Passau, Germany;University of Passau, Germany
Venue:
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Year:
2013

Citing 19
Cited 4

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
The SLAM project: debugging system software via static analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finding Feasible Counter-examples when Model Checking Abstracted Java Programs

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Boolean and Cartesian Abstraction for Model Checking C Programs

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The software model checker Blast: Applications to software engineering

International Journal on Software Tools for Technology Transfer (STTT)
Program Analysis with Dynamic Precision Adjustment

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Configurable software verification: concretizing the convergence of model checking and program analysis

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Automatically refining abstract interpretations

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Predicate abstraction with adjustable-block encoding

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
CPACHECKER: a tool for configurable software verification

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
SATABS: SAT-Based predicate abstraction for ANSI-C

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Competition on software verification

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Block abstraction memoization for CPAchecker

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Craig interpretation

SAS'12 Proceedings of the 19th international conference on Static Analysis

Second competition on software verification

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Strategies for product-line verification: case studies and experiments

Proceedings of the 2013 International Conference on Software Engineering
Precision reuse for efficient regression verification

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Solving existentially quantified horn clauses

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstraction, counterexample-guided refinement, and interpolation are techniques that are essential to the success of predicate-based program analysis. These techniques have not yet been applied together to explicit-value program analysis. We present an approach that integrates abstraction and interpolationbased refinement into an explicit-value analysis, i.e., a program analysis that tracks explicit values for a specified set of variables (the precision). The algorithm uses an abstract reachability graph as central data structure and a path-sensitive dynamic approach for precision adjustment. We evaluate our algorithm on the benchmark set of the Competition on Software Verification 2012 (SV-COMP'12) to show that our new approach is highly competitive. We also show that combining our new approach with an auxiliary predicate analysis scores significantly higher than the SV-COMP'12 winner.