76 search results - page 2 / 16 » Efficient reachability checking using sequential SAT |
MEMOCODE
2006
IEEE
13 years 11 months ago
2006
IEEE
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...
VLSID
2004
IEEE
14 years 6 months ago
2004
IEEE
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
ASPDAC
2006
ACM
13 years 11 months ago
2006
ACM
Commonly used pattern sources in simulation-based verification include random, guided random, or design verification patterns. Although these patterns may help bring the design ...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
AIPS
2000
13 years 7 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...