39 search results - page 2 / 8 » On the Relation between SAT and BDDs for Equivalence Checkin... |
ICCAD
1996
IEEE
13 years 9 months ago
1996
IEEE
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
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...
ESOP
2005
Springer
13 years 10 months ago
2005
Springer
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
ACL
2012
11 years 7 months ago
2012
We address a core aspect of the multilingual content synchronization task: the identification of novel, more informative or semantically equivalent pieces of information in two d...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...