Sciweavers

319 search results - page 13 / 64
» Space-Efficient Bounded Model Checking
Sort
View
117
Voted
DDECS
2007
IEEE
103views Hardware» more  DDECS 2007»
15 years 11 months ago
On Variable Selection in SAT-LP-based Bounded Model Checking of Linear Hybrid Automata
Marc Herbstritt, Bernd Becker, Erika Ábrah&...
111
Voted
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
15 years 10 months ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer
DAC
2002
ACM
16 years 6 months ago
Can BDDs compete with SAT solvers on bounded model checking?
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
127
Voted
CAV
2005
Springer
114views Hardware» more  CAV 2005»
15 years 10 months ago
Bounded Model Checking of Concurrent Programs
Ishai Rabinovitz, Orna Grumberg