46 search results - page 8 / 10 » Boolean Satisfiability and Equivalence Checking Using Genera... |
107
Voted
PLDI
2003
ACM
15 years 4 months ago
2003
ACM
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
102
Voted
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
96
Voted
ACSD
2007
IEEE
15 years 1 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
109
Voted
ICFEM
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
102
Voted
PLDI
2004
ACM
15 years 5 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...