Verification of Boolean programs with unbounded thread creation
www.sciencedirect.com › article › pii
Dec 5, 2007 · We address this limitation with a novel algorithm for over-approximating reachability in Boolean programs with unbounded thread creation.
We tackle the problem by proposing an algorithm for over-approximating the reachability of Boolean programs [1] with unbounded thread creation. Boolean programs ...
Verification of Boolean Programs with Unbounded Thread Creation. Byron Cook, Daniel Kroening and Natasha Sharygina. Journal: Theoretical Computer Science (TCS).
We propose an approach for analyzing non-termination and reachability properties of recursive programs using a combination of over-and under-approximating ...
We address this limitation with a novel algorithm for over-approximating reachability in Boolean programs with unbounded thread creation. Although the Boolean ...
Bibliographic details on Verification of Boolean programs with unbounded thread creation.
Journal article. Verification of Boolean Programs with Unbounded Thread Creation. Actions ... MLA Style. Cook, B., et al. “Verification of Boolean Programs with ...
Verification of Boolean Programs with Unbounded Thread Creation. Links: Homepage. Authors: Byron Cook. Daniel Kroening EMail. Natasha Sharygina. Remarks: Topics ...
[PDF] Over-Approximating Boolean Programs with Unbounded Thread ...
www0.cs.ucl.ac.uk › b.cook › pdfs
Abstract— This paper describes a symbolic algorithm for over- approximating reachability in Boolean programs with unbounded thread creation.
Most symbolic software model checkers use abstraction techniques to reduce the verification of infinite-state programs to that of decidable classes. Boolean ...