VeriT: An open, trustable and efficient SMT-solver

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5663 LNAI, Issue , 2009, Pages 151-156

  Bouton, Thomas ^b   Caminha B De Oliveira, Diego ^b   Déharbe, David ^a   Fontaine, Pascal ^b  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

OPEN-SOURCE; REAL NUMBER; SATISFIABILITY MODULO THEORIES; UNINTERPRETED FUNCTIONS;

NUMBER THEORY;

AUTOMATION;

EID: 69949136605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02959-2_12     Document Type: Conference Paper

References (18)

1. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Log. 10(1) (2009)
2. Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Information and Computation 183(2), 140-164 (2003)
3. Barrett, C., de Moura, L., Stump, A.: SMT-COMP: Satisfiability Modulo Theories Competition. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 20-23. Springer, Heidelberg (2005)
4. Cavalcanti, A.L.C., Sampaio, A.C.A., Woodcock, J.C.P.: A Refinement Strategy for Circus. Formal Aspects of Computing 15(2-3), 146-181 (2003)
5. de Moura, L., Bjørner, N.: Model-based theory combination. Electronic Notes in Theoretical Computer Science 198(2), 37-49 (2008)
6. de Moura, L.M., Björner, N.: Proofs and refutations, and Z3. In: LPAR Workshops. CEUR Workshop Proceedings, vol. 418 (2008)
7. Déharbe, D., de Oliveira, D., Fontaine, P.: Combining decision procedures by (model-)equality propagation. In: Brazil. Symp. Formal Methods, pp. 51-66 (2008)
8. Déharbe, D., Ranise, S.: Bdd-driven first-order satisfiability procedures (extended version). Research report 4630, LORIA (2002)
9. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
10. Fontaine, P.: Combinations of theories and the Bernays-Schönfinkel- Ramsey class. In: 4th Int'l Verification Workshop (VERIFY) (2007)
11. Fontaine, P., Marion, J.-Y., Merz, S., Nieto, L.P., Tiu, A.: Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 167-181. Springer, Heidelberg (2006)
12. Grundy, J., Melham, T., Krstić, S., McLaughlin, S.: Tool building requirements for an API to first-order solvers. Electronic Notes in Theoretical Computer Science 144, 15-26 (2005)
13. Nieuwenhuis, R., Oliveras, A.: DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 321-334. Springer, Heidelberg (2005)
14. Oliveira, M., Gurgel, C., de Castro, A.: Crefine: Support for the Circus refinement calculus. In: IEEE Intl. Conf. Software Engineering and Formal Methods, pp. 281-290. IEEE Comp. Soc. Press, Los Alamitos (2008)
15. Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.2 (August 2006)
16. Schulz, S.: System Description: E 0.81. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 223-228. Springer, Heidelberg (2004)
17. Stump, A.: Proof Checking Technology for Satisfiability Modulo Theories. In: Logical Frameworks and Meta-Languages: Theory and Practice (2008)
18. Weidenbach, C., Schmidt, R., Hillenbrand, T., Rusev, R., Topic, D.: System description: Spass version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS, vol. 4603, pp. 514-520. Springer, Heidelberg (2007)