SAFARI: SMT-based abstraction for arrays with interpolants

Authors:
Francesco Alberti;Roberto Bruttomesso;Silvio Ghilardi;Silvio Ranise;Natasha Sharygina
Affiliations:
Formal Verification and Security Lab, University of Lugano, Switzerland;Università degli Studi di Milano, Milan, Italy;Università degli Studi di Milano, Milan, Italy;FBK-Irst, Trento, Italy;Formal Verification and Security Lab, University of Lugano, Switzerland
Venue:
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Year:
2012

Citing 16
Cited 3

Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predicate abstraction for software verification

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Construction of Abstract State Graphs with PVS

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

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Modular verification of software components in C

Proceedings of the 25th International Conference on Software Engineering
The software model checker Blast: Applications to software engineering

International Journal on Software Tools for Technology Transfer (STTT)
Predicate abstraction with indexed predicates

ACM Transactions on Computational Logic (TOCL)
Discovering properties about arrays in simple programs

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Program verification using templates over predicate abstraction

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Abstraction Refinement for Quantified Array Assertions

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
A parametric segmentation functor for fully automatic and scalable array content analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy abstraction with interpolants

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Fluid updates: beyond strong vs. weak updates

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
MCMT: a model checker modulo theories

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Lazy abstraction with interpolants for arrays

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantifier-free interpolation in combinations of equality interpolating theories

ACM Transactions on Computational Logic (TOCL)
Learning universally quantified invariants of linear data structures

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Counterexample-guided abstraction refinement for linear programs with arrays

Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present SAFARI, a model checker designed to prove (possibly universally quantified) safety properties of imperative programs with arrays of unknown length. SAFARI is based on an extension of lazy abstraction capable of handling existentially quantified formulæ for symbolically representing states. A heuristics, called term abstraction, favors the convergence of the tool by "tuning" interpolants and guessing additional quantified variables of invariants to prune the search space efficiently.