The OpenSMT solver

  • Authors:
  • Roberto Bruttomesso;Edgar Pek;Natasha Sharygina;Aliaksei Tsitovich

  • Affiliations:
  • Formal Verification Group, Università della Svizzera Italiana, Lugano, Switzerland;Department of Computer Science, University of Illinois at Urbana-Champaign;Formal Verification Group, Università della Svizzera Italiana, Lugano, Switzerland;Formal Verification Group, Università della Svizzera Italiana, Lugano, Switzerland

  • Venue:
  • TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes OpenSMT, an incremental, efficient, and open-source SMT-solver. OpenSMT has been specifically designed to be easily extended with new theory-solvers, in order to be accessible for non-experts for the development of customized algorithms. We sketch the solver's architecture and interface. We discuss its distinguishing features w.r.t. other state-of-the-art solvers.