Building SMT-based software model checkers: an experience report

Authors:
Alessandro Armando
Affiliations:
Artificial Intelligence Laboratory, DIST, University of Genova, Italy
Venue:
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Year:
2009

Citing 16
Cited 1

An efficient method of computing static single assignment form

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
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
Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Behavioral consistency of C and verilog programs using bounded model checking

Proceedings of the 40th annual Design Automation Conference
Model Checking C Programs Using F-SOFT

ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
The eureka tool for software model checking

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Bounded model checking of software using SMT solvers instead of SAT solvers

International Journal on Software Tools for Technology Transfer (STTT)
Abstraction refinement of linear programs with arrays

TACAS'07 Proceedings of the 13th 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
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
Bounded model checking of software using SMT solvers instead of SAT solvers

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper I report on my experience on developing two SMT-based software model checking techniques and show--through comparison with rival state-of-the-art software model checkers--that SMT solvers are key to the effectiveness and scalability of software model checking.