Algorithms for software model checking: Predicate abstraction vs. Impact

CEGAR, SMT solving, and Craig interpolation are successful approaches for software model checking. We compare two of the most important algorithms that are based on these techniques: lazy predicate abstraction (as in Blast) and lazy abstraction with interpolants (as in Impact). We unify the algorith...

Full description

Saved in:
Bibliographic Details
Published in2012 Formal Methods in Computer-Aided Design (FMCAD) pp. 106 - 113
Main Authors Beyer, D., Wendler, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2012
Subjects
Abstracts
Algorithm design and analysis
Concrete
Encoding
Formal Verification
Interpolation
Large-Block Encoding
Lazy Abstraction
Model checking
Predicate Abstraction
Refinement Techniques
Software
Software algorithms
Software Model Checking
Online AccessGet full text

Cover

More Information
Summary:CEGAR, SMT solving, and Craig interpolation are successful approaches for software model checking. We compare two of the most important algorithms that are based on these techniques: lazy predicate abstraction (as in Blast) and lazy abstraction with interpolants (as in Impact). We unify the algorithms formally (by expressing both in the CPA framework) as well as in practice (by implementing them in the same tool). This allows us to flexibly experiment with new configurations and gain new insights, both about their most important differences and commonalities, as well as about their performance characteristics. We show that the essential contribution of the Impact algorithm is the reduction of the number of refinements, and compare this to another approach for reducing refinement effort: adjustable-block encoding (ABE).
ISBN:1467348325
9781467348324