Satisfiability solving for software verification

Authors:
David Déharbe;Silvio Ranise
Affiliations:
DIMAp/UFRN, Natal, Brazil;Università di Verona, Dip. di Informatica, Verona, Italy
Venue:
International Journal on Software Tools for Technology Transfer (STTT)
Year:
2009

Citing 0
Cited 3

Engineering DPLL(T) + Saturation

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Satisfiability solving and model generation for quantified first-order logic formulas

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Declarative techniques for software verification require the availability of scalable, predictable, and flexible satisfiability solvers. We describe our approach to build such solvers by combining equational theorem proving, Boolean solving, arithmetic reasoning, and some transformations of the proof obligations. The proposed techniques have been implemented in a system called haRVey and the viability of the approach is shown on proof obligations generated in the certification of aerospace code.