24 search results - page 1 / 5 » Finding bugs efficiently with a SAT solver |
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
AIPS
2008
13 years 6 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
FMCAD
2004
Springer
13 years 8 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
DAC
2001
ACM
14 years 5 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
DAC
2003
ACM
14 years 5 months ago
2003
ACM
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...