Sciweavers

FMCAD
2006
Springer
14 years 4 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 7 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...