A case for using data-flow analysis to optimize incremental scope-bounded checking

Authors:
Danhua Shao;Divya Gopinath;Sarfraz Khurshid;Dewayne E. Perry
Affiliations:
The University of Texas at Austin;The University of Texas at Austin;The University of Texas at Austin;The University of Texas at Austin
Venue:
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Year:
2010

Citing 3
Cited 0

Finding bugs with a constraint solver

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Modular verification of code with SAT

Proceedings of the 2006 international symposium on Software testing and analysis
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method

FM '09 Proceedings of the 2nd World Congress on Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

In software verification, scope-bounded checking of programs has become an effective technique for finding subtle bugs. Given bounds (that are iteratively relaxed) on input size and length of execution paths, a program and its correctness specifications are translated into a formula, which is solved using off-the-shelf solvers – a solution to the formula is a counterexample to the correctness specification.