5 search results - page 1 / 1 » Dynamic abstraction using SAT-based BMC |
DAC
2005
ACM
13 years 6 months ago
2005
ACM
FMOODS
2008
13 years 6 months ago
2008
In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the...
TACAS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...