71 search results - page 12 / 15 » Using Datalog with Binary Decision Diagrams for Program Anal... |
COCOA
2007
Springer
14 years 23 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
CP
2004
Springer
13 years 12 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
ECAI
2008
Springer
13 years 8 months ago
2008
Springer
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
SAS
2010
Springer
13 years 5 months ago
2010
Springer
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
FMCAD
2004
Springer
13 years 12 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...