Generalized, efficient array decision procedures

9th International Conference Formal Methods in Computer Aided Design, FMCAD 2009

Volumn , Issue , 2009, Pages 45-52

  De Moura, Leonardo ^a   Bjørner, Nikolaj ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORS; DECISION PROCEDURE; HARDWARE VERIFICATION; SYMBOLIC ANALYSIS; UNINTERPRETED FUNCTIONS;

COMPUTER AIDED DESIGN; DECISION THEORY; GENE EXPRESSION; VERIFICATION;

FORMAL METHODS;

EID: 76549100684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2009.5351142     Document Type: Conference Paper

References (21)

1. McCarthy, J.: Towards a mathematical science of computation. In: IFIP Congress. (1962) 21-28
2. Suzuki, N., Jefferson, D.: Verification Decidability of Presburger Array Programs. J. ACM 27 (1980) 191-205
3. Jaffar, J.: Presburger Arithmetic With Array Segments. Inf. Process. Lett. 12 (1981) 79-82
4. Burch, J.R., Dill, D.L.: Automatic verification of pipelined microprocessor control. In: CAV. (1994)
5. Manolios, P., Srinivasan, S.K., Vroon, D.: Automatic memory reductions for RTL model verification. In: ICCAD. (2006)
6. Stump, A., Barrett, C.W., Dill, D.L., Levitt, J.R.: A decision procedure for an extensional theory of arrays. In: LICS. (2001)
7. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Log. 10 (2009)
8. Lynch, C., Morawska, B.: Automatic decidability. In: LICS. (2002)
9. Brummayer, R., Biere, A.: Lemmas on Demand for the Extensional Theory of Arrays. In: SMT. (2008)
10. Kapur, D., Zarba, C.G.: A Reduction Approach to Decision Procedures. Technical Report TR-CS-1005-44, University of New Mexico (2005)
11. Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: CAV. Volume 4144 of LNCS. (2006)
12. de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: TACAS. (2008)
13. Amit Goel and Sava Krstic and Alexander Fuchs: Deciding Array Formula with Frugal Axiom Instantiation. In: SMT. (2008)
14. Ganesh, V., Dill, D.L.: A decision procedure for bit-vectors and arrays. In: CAV. (2007) 519-531
15. Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodriguez-Carbonell, E., Rubio, A.: A Write-Based Solver for SAT Modulo the Theory of Arrays. In: FMCAD. (2008) 1-8
16. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: VMCAI. (2006) 427-442
17. Ghilardi, S., Nicolini, E., Ranise, S., Zucchelli, D.: Decision procedures for extensions of the theory of arrays. Ann. Math. Artif. Intell. 50 (2007) 231-254
18. Habermehl, P., Iosif, R., Vojnar, T.: What else is decidable about integer arrays? In: FoSSaCS. (2008)
19. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53 (2006)
20. de Moura, L., Bjørner, N.: Model-based Theory Combination. In: SMT. (2007)
21. Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. J. ACM 52 (2005) 365-473