26 search results - page 5 / 6 » Checking satisfiability of a conjunction of BDDs |
FOIKS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
DAC
2002
ACM
14 years 6 months ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
COORDINATION
2009
Springer
14 years 6 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
ENTCS
2006
13 years 5 months ago
2006
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
CAV
2004
Springer
13 years 9 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...