Advertisement

veriT: An Open, Trustable and Efficient SMT-Solver

  • Thomas Bouton
  • Diego Caminha B. de Oliveira
  • David Déharbe
  • Pascal Fontaine
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5663)

Abstract

This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-free formulas with uninterpreted functions and difference logic on real numbers and integers.

Keywords

Decision Procedure Conjunctive Normal Form Linear Arithmetic Input Formula Congruence Closure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Log. 10(1) (2009)Google Scholar
  2. 2.
    Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Information and Computation 183(2), 140–164 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)CrossRefzbMATHGoogle Scholar
  5. 5.
    de Moura, L., Bjørner, N.: Model-based theory combination. Electronic Notes in Theoretical Computer Science 198(2), 37–49 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    de Moura, L.M., Björner, N.: Proofs and refutations, and Z3. In: LPAR Workshops. CEUR Workshop Proceedings, vol. 418 (2008)Google Scholar
  7. 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)Google Scholar
  8. 8.
    Déharbe, D., Ranise, S.: Bdd-driven first-order satisfiability procedures (extended version). Research report 4630, LORIA (2002)Google Scholar
  9. 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)CrossRefGoogle Scholar
  10. 10.
    Fontaine, P.: Combinations of theories and the Bernays-Schönfinkel-Ramsey class. In: 4th Int’l Verification Workshop (VERIFY) (2007)Google Scholar
  11. 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)CrossRefGoogle Scholar
  12. 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)CrossRefzbMATHGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 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)Google Scholar
  15. 15.
    Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.2 (August 2006)Google Scholar
  16. 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)CrossRefGoogle Scholar
  17. 17.
    Stump, A.: Proof Checking Technology for Satisfiability Modulo Theories. In: Logical Frameworks and Meta-Languages: Theory and Practice (2008)Google Scholar
  18. 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Thomas Bouton
    • 2
  • Diego Caminha B. de Oliveira
    • 2
  • David Déharbe
    • 1
  • Pascal Fontaine
    • 2
  1. 1.Universidade Federal do Rio Grande do NorteNatalBrazil
  2. 2.LORIA–INRIA, NancyFrance

Personalised recommendations