61 search results - page 1 / 13 » Boolean and Cartesian Abstraction for Model Checking C Progr... |
TACAS
2001
Springer
13 years 9 months ago
2001
Springer
FMCAD
2009
Springer
13 years 12 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
TACAS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Model checking suffers not only from the state-space explosion problem, but also from the environment modeling problem: how can one create an accurate enough model of the...
CAV
2009
Springer
14 years 6 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
WLP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...