Search Sciweavers | Sciweavers

110 search results - page 4 / 22

» Tuning SAT Checkers for Bounded Model Checking

click to vote

DAC
2003
ACM

130views Computer Architecture» more DAC 2003»

Learning from BDDs in SAT-based bounded model checking

14 years 10 months ago

Download vlsi.colorado.edu

Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...

Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...

claim paper

Read More »

click to vote

MEMOCODE
2003
IEEE

99views Formal Methods» more MEMOCODE 2003»

Methods for exploiting SAT solvers in unbounded model checking

14 years 2 months ago

Download www.cadence.com

— Modern SAT solvers have proved highly successful in ﬁnding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...

Kenneth L. McMillan

claim paper

Read More »

click to vote

TACAS
2010
Springer

342views Algorithms» more TACAS 2010»

SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

14 years 4 months ago

Download www.auresoft.com

We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...

Janusz Malinowski, Peter Niebert

claim paper

Read More »

click to vote

DAC
2002
ACM

95views Computer Architecture» more DAC 2002»

Can BDDs compete with SAT solvers on bounded model checking?

14 years 10 months ago