Sciweavers

5 search results - page 1 / 1
» Dynamic abstraction using SAT-based BMC
Sort
View
DAC
2005
ACM
14 years 21 days ago
Dynamic abstraction using SAT-based BMC
Liang Zhang, Mukul R. Prasad, Michael S. Hsiao, Th...
FMOODS
2008
14 years 6 days ago
Symbolic Step Encodings for Object Based Communicating State Machines
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...
Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
14 years 4 months ago
A Tool for Checking ANSI-C Programs
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...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
14 years 5 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
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...
Rotem Oshman, Orna Grumberg
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 5 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
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...
Bas Schaafsma, Marijn Heule, Hans van Maaren