CVC4

An efficient open-source automatic theorem prover for satisfiability modulo theories (SMT) problems.

About
News
Downloads
Documentation
Publications
Awards
People
History
Third-Party Applications
Acknowledgements

Try CVC4 online!


CI

10 July 2017

CVC4 1.5 Released

by Mathias Preiner

We are delighted to announce version 1.5 of CVC4, the open-source flagship SMT solver developed at Stanford University, New York University and the University of Iowa, available at http://cvc4.cs.stanford.edu.

Version 1.5 now supports unsat cores, proofs (for uninterpreted functions, arrays and bit-vectors and their combinations), and features numerous improvements to non-linear arithmetic, strings, sets and other theories, improved handling of quantifiers, native support for syntax-guided synthesis (SyGuS), generally improved usability and stability, and many bugfixes. This version is very close to the version of CVC4 submitted to the SMT-competition 2017.

We welcome feedback, feature requests, contributions, and collaborations. It is our hope that CVC4 will become a research platform for a broad and diverse set of users and developers. If you are interested in getting involved with the project, please contact a member of the development team.

The development of CVC4 is supported in part by the following organizations:

Downloads, documentation, tutorials, and more information are available at the CVC4 web site: http://cvc4.cs.stanford.edu

-The CVC4 team