2010 | OriginalPaper | Buchkapitel
A Case for Using Data-Flow Analysis to Optimize Incremental Scope-Bounded Checking
verfasst von : Danhua Shao, Divya Gopinath, Sarfraz Khurshid, Dewayne E. Perry
Erschienen in: Abstract State Machines, Alloy, B and Z
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.