54 search results - page 1 / 11 » Bebop: A Symbolic Model Checker for Boolean Programs |
SPIN
2000
Springer
13 years 8 months ago
2000
Springer
SPIN
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
SPIN
2001
Springer
13 years 9 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
CAV
2009
Springer
14 years 5 months ago
2009
Springer
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
RISE
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...