Predicate Abstraction of ANSI-C Programs Using SAT

Authors:
Edmund Clarke;Daniel Kroening;Natasha Sharygina;Karen Yorav
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA. emc@cs.cmu.edu;Computer Systems Institute, Swiss Institute of Technology, Zurich, Switzerland. daniel.kroening@inf.ethz.ch;Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA. nys@sei.cmu.edu;IBM Haifa, Israel. yorav@il.ibm.com
Venue:
Formal Methods in System Design
Year:
2004

Citing 22
Cited 58

Model checking and abstraction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
Automatic formal verification of DSP software

Proceedings of the 37th Annual Design Automation Conference
Assignment and Procedure Call Proof Rules

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Automatically validating temporal safety properties of interfaces

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
SAT-Based Image Computation with Application in Reachability Analysis

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Behavioral consistency of C and verilog programs using bounded model checking

Proceedings of the 40th annual Design Automation Conference
Modular verification of software components in C

Proceedings of the 25th International Conference on Software Engineering
Successive Approximation of Abstract Transition Relations

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A satisfiability procedure for quantified boolean formulae

Discrete Applied Mathematics - The renesse issue on satisfiability

Word level predicate abstraction and refinement for verifying RTL verilog

Proceedings of the 42nd annual Design Automation Conference
Checking consistency of C and Verilog using predicate abstraction and induction

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Verification of SpecC using predicate abstraction

Formal Methods in System Design
Saturn: A scalable framework for error detection using Boolean satisfiability

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Verification of Boolean programs with unbounded thread creation

Theoretical Computer Science
Verifying C++ with STL containers via predicate abstraction

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Formal verification at higher levels of abstraction

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Calysto: scalable and precise extended static checking

Proceedings of the 30th international conference on Software engineering
Decision Procedures for the Grand Challenge

Verified Software: Theories, Tools, Experiments
A Framework for Model Checking Institutions

Model Checking and Artificial Intelligence
CPBPV: A Constraint-Programming Framework for Bounded Program Verification

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Loop Summarization Using Abstract Transformers

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Game-Based Probabilistic Predicate Abstraction in PRISM

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstraction Refinement for Probabilistic Software

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
A Scalable Memory Model for Low-Level Code

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Bit-precise reasoning with affine functions

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
The synergy of precise and fast abstractions for program verification

Proceedings of the 2009 ACM symposium on Applied Computing
Interprocedural and Flow-Sensitive Type Analysis for Memory and Type Safety of C Code

Journal of Automated Reasoning
Abstract interpretation of programs for model-based debugging

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Abstract Model Checking without Computing the Abstraction

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Verification of CERT Secure Coding Rules: Case Studies

OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
Model Checking Linear Programs with Arrays

Electronic Notes in Theoretical Computer Science (ENTCS)
CPBPV: a constraint-programming framework for bounded program verification

Constraints
A reachability predicate for analyzing low-level software

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
VCEGAR: Verilog counterexample guided abstraction refinement

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Verifying heap-manipulating programs in an SMT framework

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
A framework for verification of software with time and probabilities

FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Context-bounded translations for concurrent software: an empirical evaluation

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Efficient predicate abstraction of program summaries

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Formalizing requirements with object models and temporal constraints

Software and Systems Modeling (SoSyM)
Symmetry-aware predicate abstraction for shared-variable concurrent programs

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
On the adoption of model checking in safety-related software industry

SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Making software verification tools really work

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Context-bounded model checking of LTL properties for ANSI-C software

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Accurate theorem proving for program verification

ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Predicate abstraction of RTL verilog descriptions using constraint logic programming

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Static analysis of device drivers: we can do better!

Proceedings of the Second Asia-Pacific Workshop on Systems
Using statically computed invariants inside the predicate abstraction and refinement loop

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Counterexamples with loops for predicate abstraction

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
SMT techniques for fast predicate abstraction

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Localization and register sharing for predicate abstraction

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Applying constraint logic programming to predicate abstraction of RTL verilog descriptions

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Predicate abstraction via symbolic decision procedures

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
The ComFoRT reasoning framework

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Effective word-level interpolation for software verification

Proceedings of the International Conference on Formal Methods in Computer-Aided Design
On the satisfiability of modular arithmetic formulae

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Ranking function synthesis for bit-vector relations

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Exploration of the capabilities of constraint programming for software verification

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Approximating predicate images for bit-vector logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A practical and complete approach to predicate refinement

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SatAbs: a bit-precise verifier for C programs

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A method for symbolic computation of abstract operations

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Bilateral algorithms for symbolic abstraction

SAS'12 Proceedings of the 19th international conference on Static Analysis
Counterexample-Guided precondition inference

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Loop summarization using state and transition invariants

Formal Methods in System Design
Bias-variance tradeoffs in program analysis

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques.