SAFARI: SMT-based Abstraction For Arrays with Interpolants

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.

• BibTex

@inproceedings { ABGRS_CAV12,
	title = {SAFARI: SMT-based Abstraction For Arrays with Interpolants},
	booktitle = {24th International Conference on Computer Aided Verification (CAV)},
	year = {2012},
	publisher = {Springer},
	organization = {Springer},
	address = {Berkeley, California, USA},
	author = {Francesco Alberti and  Roberto Bruttomesso and  Silvio Ghilardi and  Silvio Ranise and  Natasha Sharygina}
}