46 search results - page 5 / 10 » Boolean Satisfiability and Equivalence Checking Using Genera... |
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
ISSTA
1998
ACM
13 years 12 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
SEFM
2008
IEEE
14 years 2 months ago
2008
IEEE
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
CHARME
2001
Springer
13 years 11 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...