Article

CVC4

Authors:

Christopher L. Conway,

Liana Hadarean,

Dejan Jovanović,

Andrew Reynolds,

Cesare TinelliAuthors Info & Claims

CAV'11: Proceedings of the 23rd international conference on Computer aided verification

Pages 171 - 177

Published: 14 July 2011 Publication History

Abstract

CVC4 is the latest version of the Cooperating Validity Checker. A joint project of NYU and U Iowa, CVC4 aims to support the useful feature set of CVC3 and SMT-LIBv2 while optimizing the design of the core system architecture and decision procedures to take advantage of recent engineering and algorithmic advances. CVC4 represents a completely new code base; it is a from-scratch rewrite of CVC3, and many subsystems have been completely redesigned. Additional decision procedures for CVC4 are currently under development, but for what it currently achieves, it is a lighter-weight and higher-performing tool than CVC3. We describe the system architecture, subsystems of note, and discuss some applications and continuing work.

References

[1]

Barrett, C., Berezin, S.: CVC Lite: A New Implementation of the Cooperating Validity Checker Category. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 515-518. Springer, Heidelberg (2004).

[2]

Barrett, C., Deters, M., Oliveras, A., Stump, A.: SMT-COMP 2010: the 2010 edition of the satisfiability modulo theories competition, http://www.smtcomp.org/2010/

[3]

Barrett, C., Dill, D., Levitt, J.: Validity checking for combinations of theories with equality, pp. 187-201. Springer, Heidelberg (1996).

Digital Library

[4]

Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007).

Digital Library

[5]

Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., Rubio, A.: The barcelogic SMT solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 294-298. Springer, Heidelberg (2008).

Digital Library

[6]

Bruttomesso, R., Cimatti, A., Franzén, A., Griggio, A., Sebastiani, R.: The math-SAT 4 SMT solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 299-303. Springer, Heidelberg (2008).

Digital Library

[7]

Bruttomesso, R., Pek, E., Sharygina, N., Tsitovich, A.: The OpenSMT Solver. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 150-153. Springer, Heidelberg (2010).

Digital Library

[8]

de Moura, L., Bjørner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008).

Digital Library

[9]

Dutertre, B., de Moura, L.: The YICES SMT solver, http://yices.csl.sri.com/tool-paper.pdf

[10]

Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006).

Digital Library

[11]

Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 333-336. Springer, Heidelberg (2004).

[12]

Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): fast decision procedures, pp. 175-188. Springer, Heidelberg (2004).

[13]

Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: Annual Acm Ieee Design Automation Conference, pp. 530-535. ACM, New York (2001).

Digital Library

[14]

Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245-257 (1979).

Digital Library

[15]

Oe, D., Reynolds, A., Stump, A.: Fast and flexible proof checking for SMT. In: Proceedings of the 7th International Workshop on Satisfiability Modulo Theories, SMT 2009, pp. 6-13. ACM, New York (2009).

Digital Library

[16]

Stump, A., Barrett, C.W., Dill, D.L.: CVC: A Cooperating Validity Checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 500-504. Springer, Heidelberg (2002).

Digital Library

Cited By

Grossman SToman JBakst AArora SSagiv MNandi C(2024)Practical Verification of Smart Contracts using Memory SplittingProceedings of the ACM on Programming Languages10.1145/36897968:OOPSLA2(2402-2433)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689796
Wu NLi YYang HChen HDai SHao CYu CXie Y(2024)Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and ProspectACM Transactions on Design Automation of Electronic Systems10.1145/366130829:4(1-42)Online publication date: 24-Apr-2024
https://dl.acm.org/doi/10.1145/3661308
Rumpe BStachon MStüber SVoufo VCombemale BWimmer MChechik MEgyed A(2024)Semantic Difference Analysis with Invariant Tracing for Class Diagrams Extended by OCLProceedings of the ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems10.1145/3652620.3687818(1066-1075)Online publication date: 22-Sep-2024
https://dl.acm.org/doi/10.1145/3652620.3687818
Show More Cited By

Recommendations

A Tour of CVC4: How it works, and how to use it
FMCAD '14: Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design

CVC4 is a solver for Satisfiability Modulo Theories (SMT). This tutorial aims to give participants an overview of SMT, describe the main features of CVC4, and walk through in-depth examples using CVC4 to demonstrate how to solve real problems with an ...
On stateless multihead automata: Hierarchies and the emptiness problem

We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Pebble alternating tree-walking automata and their recognizing power

Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree languages recognized by these devices are exactly the regular tree languages. We strengthen this by proving the same result for ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CAV'11: Proceedings of the 23rd international conference on Computer aided verification

July 2011

762 pages

ISBN:9783642221095

Editors:
Ganesh Gopalakrishnan
University of Utah, School of Computing, Salt Lake City, UT
,
Shaz Qadeer
Microsoft Research, One Microsoft Way, Redmond, WA

Sponsors

Fujitsu
Google Inc.
Microsoft Research: Microsoft Research
Intel: Intel
IBM: IBM

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 14 July 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

178
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Grossman SToman JBakst AArora SSagiv MNandi C(2024)Practical Verification of Smart Contracts using Memory SplittingProceedings of the ACM on Programming Languages10.1145/36897968:OOPSLA2(2402-2433)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689796
Wu NLi YYang HChen HDai SHao CYu CXie Y(2024)Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and ProspectACM Transactions on Design Automation of Electronic Systems10.1145/366130829:4(1-42)Online publication date: 24-Apr-2024
https://dl.acm.org/doi/10.1145/3661308
Rumpe BStachon MStüber SVoufo VCombemale BWimmer MChechik MEgyed A(2024)Semantic Difference Analysis with Invariant Tracing for Class Diagrams Extended by OCLProceedings of the ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems10.1145/3652620.3687818(1066-1075)Online publication date: 22-Sep-2024
https://dl.acm.org/doi/10.1145/3652620.3687818
Larisch JThijm TAhmad SWu PArnfeld TFayed MSekar VYu MSeneviratne AVeitch D(2024)Topaz: Declarative and Verifiable Authoritative DNS at CDN-ScaleProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672240(891-903)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672240
Qiu YKon PXing JHuang YLiu HWang XHuang PChowdhury MChen A(2023)Simplifying Cloud Management with Cloudless ComputingProceedings of the 22nd ACM Workshop on Hot Topics in Networks10.1145/3626111.3628206(95-101)Online publication date: 28-Nov-2023
https://dl.acm.org/doi/10.1145/3626111.3628206
Murali APeña LJhala RMadhusudan P(2023)Complete First-Order Reasoning for Properties of Functional ProgramsProceedings of the ACM on Programming Languages10.1145/36228357:OOPSLA2(1063-1092)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622835
Pal ASaiki BTjoa RRichey CZhu AFlatt OWillsey MTatlock ZNandi C(2023)Equality Saturation Theory Exploration à la CarteProceedings of the ACM on Programming Languages10.1145/36228347:OOPSLA2(1034-1062)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622834
Hatcliff JStewart DBelt J. RSchwerdfeger A(2023)An AADL Contract Language Supporting Integrated Model- and Code-Level VerificationACM SIGAda Ada Letters10.1145/3591335.359133942:2(45-54)Online publication date: 5-Apr-2023
https://dl.acm.org/doi/10.1145/3591335.3591339
Liu JChen YAtkinson EFeng YBodik R(2023)Conflict-Driven Synthesis for Layout EnginesProceedings of the ACM on Programming Languages10.1145/35912467:PLDI(638-659)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591246
Zhang YWang YFlatt OCao DZucker PRosenthal ETatlock ZWillsey M(2023)Better Together: Unifying Datalog and Equality SaturationProceedings of the ACM on Programming Languages10.1145/35912397:PLDI(468-492)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591239
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents