54 search results - page 2 / 11 » Bebop: A Symbolic Model Checker for Boolean Programs |
TPHOL
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
CHARME
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
CAV
2009
Springer
14 years 5 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...
KBSE
2007
IEEE
13 years 11 months ago
2007
IEEE
We describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and array elements range over a numeric domain and expressions involve ...
FMCAD
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...