Lemmas on demand for the extensional theory of arrays

ACM International Conference Proceeding Series

Volumn , Issue , 2008, Pages 6-11

  Brummayer, Robert ^a   Biere, Armin ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Arrays; Decision procedure; SAT; Satisfiability; SMT

Indexed keywords

ARRAYS; DECISION PROCEDURE; SAT; SATISFIABILITY; SMT;

VERIFICATION;

TECHNICAL PRESENTATIONS;

EID: 67650736000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1512464.1512467     Document Type: Conference Paper

References (21)

1. C. Barrett, D. L. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation to SAT. In Proc. CAV, 2002.
2. C. Barrett and C. Tinelli. CVC3. In Proc. CAV, 2007.
3. A. Biere. PicoSAT essentials. JSAT, 4, 2008.
4. A. Bradley and Z. Manna. The Calculus of Computation - Decision Procedures with Applications to Verification. Springer, 2007.
5. A. Bradley, Z. Manna, and H. Sipma. What's decidable about arrays? In Proc. VMCAI, 2006.
6. R. Brummayer and A. Biere. Lemmas on Demand for the Extensional Theory of Arrays. submitted.
7. R. Brummayer and A. Biere. Local two-level and-inverter graph minimization without blowup. In Proc. MEMICS, 2006.
8. R. Brummayer and A. Biere. C32SAT: Checking C expressions. In Proc. CAV, 2007.
9. R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, Z. Hanna, A. Nadel, A. Palti, and R. Sebastiani. A lazy and layered SMT(BV) solver for hard industrial verification problems. In Proc. CAV, 2007.
10. R. Bryant, D. Kroening, J. Ouaknine, S. Seshia, O. Strichman, and B. Brady. Deciding bit-vector arithmetic with abstraction. In Proc. TACAS, 2007.
11. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In Proc. TACACS, 2008.
12. L. de Moura and H. Rueß. Lemmas on demand for satisfiability solvers. In Proc. SAT, 2002.
13. N. Eén and N. Sörensson. Temporal induction by incremental SAT solving. In Proc. BMC, 2003.
14. C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem proving using lazy proof explication. In Proc. CAV, 2003.
15. V. Ganesh and D. L. Dill. A decision procedure for bit-vectors and arrays. In Proc. CAV, 2007.
16. P. Manolios, S. Srinivasan, and D. Vroon. BAT: The bit-level analysis tool. In Proc. CAV, 2007.
17. J. McCarthy. Towards a mathematical science of computation. In Proc. IFIP Congress, 1962.
18. R. Nieuwenhuis and A. Oliveras. Decision procedures for SAT, SAT modulo theories and beyond. the BarcelogicTools. In Proc. LPAR, 2005.
19. R. Sebastiani. Lazy satisfiability modulo theories. JSAT, 3, 2007.
20. A. Stump, C. Barrett, D. L. Dill, and J. R. Levitt. A decision procedure for an extensional theory of arrays. In Proc. LICS, 2001.
21. G. Tseitin. On the Complexity of Derivation in Propositional Calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part II, 1968.