115 search results - page 12 / 23 » : Compiling problem specifications into SAT |
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
CAV
2004
Springer
13 years 11 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...
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
DAC
1998
ACM
14 years 9 months ago
1998
ACM
We present a Petri net theoretic approach to the software synthesis problem that can synthesize ordinary C programs from processbased concurrent specifications without the need for...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Testing is one of the most indispensable tasks in software engineering. The role of testing in software development has grown significantly because testing is able to rev...