Over-Approximating Boolean Programs with Unbounded Thread Creation

Authors:
Byron Cook;Daniel Kroening;Natasha Sharygina
Affiliations:
Microsoft Research;Computer Systems Institute, ETH, Switzerland;University of Lugano, Switzerland
Venue:
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Year:
2006

Citing 0
Cited 4

Verification of Boolean programs with unbounded thread creation

Theoretical Computer Science
Automated verification of security policies in mobile code

IFM'07 Proceedings of the 6th international conference on Integrated formal methods
SAT-based summarization for Boolean programs

Proceedings of the 14th international SPIN conference on Model checking software
A complete bounded model checking algorithm for pushdown systems

HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting the state of the threads to the globally visible parts, which are finite. Our algorithm models recursion by over-approximating the call stack that contains the return locations of recursive function calls, as reachability is undecidable in this case. The algorithm may obtain spurious counterexamples, which are removed iteratively by means of an abstraction refinement loop. Experiments show that the symbolic algorithm for unbounded thread creation scales to large abstract models.