Abstraction-based Satisfiability Solving of Presburger Arithmetic
- Topics:
- Electrical and Electronic
- Source:
- Carnegie Mellon University
FREE Registration is required
Overview: This white paper presents a new abstraction-based framework for deciding satisfiability of quantifier free Presburger arithmetic formulas. The efficiency of this approach derives from the ability of SAT solvers to extract small unsatisfiable cores, leading to small abstracted formulas. The paper also presents experimental results which suggest that the algorithm is considerably more efficient than directly invoking the theorem prover on the original formula.
(Is this item miscategorized? Does it need more tags? Let us know.)
Format: PDF | Size: 194KB | Date: Jan 2004 | Pages: 16



