Sciweavers

62 search results - page 1 / 13
» The Succinct Solver Suite
Sort
View
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
13 years 10 months ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
FLOPS
2010
Springer
13 years 11 months ago
A Pearl on SAT Solving in Prolog
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
Jacob M. Howe, Andy King
DAC
2009
ACM
14 years 5 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
SAT
2005
Springer
123views Hardware» more  SAT 2005»
13 years 10 months ago
Bounded Model Checking with QBF
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
Nachum Dershowitz, Ziyad Hanna, Jacob Katz
ICCS
2004
Springer
13 years 10 months ago
A Tool Suite for Simulation Based Analysis of Memory Access Behavior
In this paper, two tools are presented: an execution driven cache simulator which relates event metrics to a dynamically built-up call-graph, and a graphical front end able to visu...
Josef Weidendorfer, Markus Kowarschik, Carsten Tri...