The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
cvc5: A Versatile and Industrial-Strength SMT Solver
Open accessAbstract
cvc5 is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 ’s architectural design and highlights the major features and components introduced since CVC4 1.8. We evaluate cvc5 ’s performance on all benchmarks in SMT-LIB and provide a comparison against CVC4 and Z3.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595 · cited 2×
“Notable SMT solvers include Bitwuzla [92], Boolector [98], CVC4 [21], MathSAT [46], OpenSMT2 [72], SMTInterpol [44], SMT-RAT [50], STP [61], veriT [35], Yices2 [55], and Z3 [90].”
BackgroundMethodEén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45949-9 · Cited by 1,629
Interactive Theorem Proving and Program Development
Bertot, Y., & Castéran, P. (2004) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/978-3-662-07964-5 · Cited by 1,353
Cython: The Best of Both Worlds
Behnel, S., Bradshaw, R., Citro, C., Dalcin, L., Seljebotn, D. S., & Smith, K. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2010.118 · Cited by 1,230
A framework for defining logics
Harper, R., Honsell, F., & Plotkin, G. (1993) · Journal of the ACM · doi:10.1145/138027.138060 · Cited by 990
Dafny: An Automatic Program Verifier for Functional Correctness
Leino, K. R. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17511-4_20 · Cited by 940 · cited 1×
“…widely recognized as crucial back-end reasoning engines for a variety of applications, including software and hardware verification [19, 52, 60, 68, 82, 86], model checking [41, 42, 98], type checking, static analysis, security [10,62], automated test-case generation [40,135], synthesis [2,65],…”
BackgroundBoogie: A Modular Reusable Verifier for Object-Oriented Programs
Barnett, M., Chang, B.-Y. E., DeLine, R., Jacobs, B., & Leino, K. R. M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_17 · Cited by 799
Pex–White Box Test Generation for .NET
Tillmann, N., & de Halleux, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79124-9_10 · Cited by 791
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Journal of the ACM · doi:10.1145/1217856.1217859 · Cited by 783
Self-citationA Fast Linear-Arithmetic Solver for DPLL(T)
Dutertre, B., & de Moura, L. (2006) · Lecture notes in computer science · doi:10.1007/11817963_11 · Cited by 679
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
Barrett, C., Conway, C. L., Deters, M., Hadarean, L., Jovanović, D., King, T., Reynolds, A., & Tinelli, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_14 · Cited by 655
Self-citationA Decision Procedure for Bit-Vectors and Arrays
Ganesh, V., & Dill, D. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_52 · Cited by 585
SAGE: whitebox fuzzing for security testing
Godefroid, P., Levin, M. Y., & Molnar, D. (2012) · Communications of the ACM · doi:10.1145/2093548.2093564 · Cited by 567
The nuXmv Symbolic Model Checker
Cavada, R., Cimatti, A., Dorigatti, M., Griggio, A., Mariotti, A., Micheli, A., Mover, S., Roveri, M., & Tonetta, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08867-9_22 · Cited by 545
Why3 — Where Programs Meet Provers
Filliâtre, J.-C., & Paskevich, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37036-6_8 · Cited by 538
Cimatti, A., Griggio, A., Schaafsma, B. J., & Sebastiani, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36742-7_7 · Cited by 488
Dutertre, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08867-9_49 · Cited by 398
Cuoq, P., Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., & Yakobowski, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33826-7_16 · Cited by 376
Efficient E-Matching for SMT Solvers
de Moura, L., & Bjørner, N. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73595-3_13 · Cited by 279
CVC Lite: A New Implementation of the Cooperating Validity Checker
Barrett, C., & Berezin, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27813-9_49 · Cited by 275
Self-citationThe Lean 4 Theorem Prover and Programming Language
Moura, L. D., & Ullrich, S. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-79876-5_37 · Cited by 258
Scaling Enumerative Program Synthesis via Divide and Conquer
Alur, R., Radhakrishna, A., & Udupa, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54577-5_18 · Cited by 211
The TPTP Problem Library and Associated Infrastructure: From CNF to TH0, TPTP v6.4.0
Sutcliffe, G. (2017) · Journal of Automated Reasoning · doi:10.1007/s10817-017-9407-7 · Cited by 205
Synthesis of loop-free programs
Gulwani, S., Jha, S., Tiwari, A., & Venkatesan, R. (2011) · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1993498.1993506 · Cited by 200
Barrett, C., & Tinelli, C. (2007) · Springer eBooks · doi:10.1007/978-3-540-73368-3_34 · Cited by 196
Self-citationSMTInterpol: An Interpolating SMT Solver
Christ, J., Hoenicke, J., & Nutz, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31759-0_19 · Cited by 162
Generalized, efficient array decision procedures
de Moura, L., & Bjørner, N. (2009) · Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2009.5351142 · Cited by 141
solc-verify: A Modular Verifier for Solidity Smart Contracts
Hajdu, Á., & Jovanović, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-41600-3_11 · Cited by 138
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
Reynolds, A., Deters, M., Kunčak, V., Tinelli, C., & Barrett, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21668-3_12 · Cited by 119
Self-citationFormal Reasoning About the Security of Amazon Web Services
Cook, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96145-3_3 · Cited by 114
Champion, A., Mebsout, A., Sticksel, C., & Tinelli, C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-41540-6_29 · Cited by 113
Self-citationSplitting on Demand in SAT Modulo Theories
Barrett, C., Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Lecture notes in computer science · doi:10.1007/11916277_35 · Cited by 109
Self-citationExtending Sledgehammer with SMT Solvers
Blanchette, J. C., Böhme, S., & Paulson, L. C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22438-6_11 · Cited by 107
Semantic-based Automated Reasoning for AWS Access Policies using SMT
Backes, J., Bolignano, P., Cook, B., Dodge, C., Gacek, A., Luckow, K., Rungta, N., Tkachuk, O., & Varming, C. (2018) · 2018 Formal Methods in Computer Aided Design (FMCAD) · doi:10.23919/fmcad.2018.8602994 · Cited by 106
Reynolds, A., & Kunčak, V. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-46081-8_5 · Cited by 96
Self-citationChapter 33. Satisfiability Modulo Theories
Barrett, C., Sebastiani, R., Seshia, S. A., & Tinelli, C. (2021) · Frontiers in artificial intelligence and applications · doi:10.3233/faia201017 · Cited by 95
Self-citationSMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
Corzilius, F., Kremer, G., Junges, S., Schupp, S., & Ábrahám, E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24318-4_26 · Cited by 78
Self-citationMixed abstractions for floating-point arithmetic
Brillout, A., Kroening, D., & Wahl, T. (2009) · Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2009.5351141 · Cited by 73
cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis
Reynolds, A., Barbosa, H., Nötzli, A., Barrett, C., & Tinelli, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25543-5_5 · Cited by 72
Self-citationSMT proof checking using a logical framework
Stump, A., Oe, D., Reynolds, A., Hadarean, L., & Tinelli, C. (2012) · Formal Methods in System Design · doi:10.1007/s10703-012-0163-3 · Cited by 69
Self-citationAn Abstract Decision Procedure for a Theory of Inductive Data Types
Barrett, C., Shikanian, I., & Tinelli, C. (2007) · Journal on Satisfiability Boolean Modeling and Computation · doi:10.3233/sat190028 · Cited by 64
Self-citationAccessible Software Verification with Dafny
Leino, K. R. M. (2017) · IEEE Software · doi:10.1109/ms.2017.4121212 · Cited by 59
Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
Cimatti, A., Griggio, A., & Sebastiani, R. (2011) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3196 · Cited by 58
Revisiting Enumerative Instantiation
Reynolds, A., Barbosa, H., & Fontaine, P. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-89963-3_7 · Cited by 50
Self-citationScaling Up DPLL(T) String Solvers Using Context-Dependent Simplification
Reynolds, A., Woo, M., Barrett, C., Brumley, D., Liang, T., & Tinelli, C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63390-9_24 · Cited by 47
Self-citationBuilding Better Bit-Blasting for Floating-Point Problems
Brain, M., Schanda, F., & Sun, Y. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17462-0_5 · Cited by 38
Self-citationSyntax-Guided Rewrite Rule Enumeration for SMT Solvers
Nötzli, A., Reynolds, A., Barbosa, H., Niemetz, A., Preiner, M., Barrett, C., & Tinelli, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-24258-9_20 · Cited by 36
Self-citationBlock public access: trust safety verification of access control policies
Bouchet, M., Cook, B., Cutler, B., Druzkina, A., Gacek, A., Hadarean, L., Jhala, R., Marshall, B., Peebles, D., Rungta, N., et al. (2020) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3368089.3409728 · Cited by 35
Solving quantified linear arithmetic by counterexample-guided instantiation
Reynolds, A., King, T., & Kunčak, V. (2017) · Formal Methods in System Design · doi:10.1007/s10703-017-0290-y · Cited by 34
Self-citationÁbrahám, E., Davenport, J. H., England, M., et al. (2020) · Journal of Logical and Algebraic Methods in Programming · doi:10.1016/j.jlamp.2020.100633 · Cited by 34
Zhong, E., Cheang, K., Qadeer, S., Grieskamp, W., Blackshear, S., Park, J., Zohar, Y., Barrett, C., & Dill, D. L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-53288-8_7 · Cited by 33
Self-citationStochastic program optimization
Schkufza, E., Sharma, R., & Aiken, A. (2016) · Communications of the ACM · doi:10.1145/2863701 · Cited by 30
Lazy proofs for DPLL(T)-based SMT solvers
Katz, G., Barrett, C., Tinelli, C., Reynolds, A., & Hadarean, L. (2016) · Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2016.7886666 · Cited by 27
Self-citationTowards Bit-Width-Independent Proofs in SMT Solvers
Niemetz, A., Preiner, M., Reynolds, A., Zohar, Y., Barrett, C., & Tinelli, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-29436-6_22 · Cited by 20
Self-citationExtending enumerative function synthesis via SMT-driven classification
Barbosa, H., Reynolds, A., Larraz, D., & Tinelli, C. (2019) · Formal Methods in Computer-Aided Design · doi:10.23919/fmcad.2019.8894267 · Cited by 18
Self-citationLeveraging linear and mixed integer programming for SMT
King, T., Barrett, C., & Tinelli, C. (2014) · Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2014.6987606 · Cited by 17
Self-citationHigh-Level Abstractions for Simplifying Extended String Constraints in SMT
Reynolds, A., Nötzli, A., Barrett, C., & Tinelli, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25543-5_2 · Cited by 17
Self-citationStratified Abstraction of Access Control Policies
Backes, J., Berrueco, U., Bray, T., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-53288-8_9 · Cited by 16
Datatypes with Shared Selectors
Reynolds, A., Viswanathan, A., Barbosa, H., Tinelli, C., & Barrett, C. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-94205-6_39 · Cited by 15
Self-citationScalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis
Reynolds, A., Barbosa, H., Larraz, D., & Tinelli, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51074-9_9 · Cited by 15
Self-citationSyntax-Guided Quantifier Instantiation
Niemetz, A., Preiner, M., Reynolds, A., Barrett, C., & Tinelli, C. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-72013-1_8 · Cited by 15
Self-citationFine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors
Hadarean, L., Barrett, C., Reynolds, A., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48899-7_24 · Cited by 14
Self-citationBit-Precise Reasoning via Int-Blasting
Zohar, Y., Irfan, A., Mann, M., Niemetz, A., Nötzli, A., Preiner, M., Reynolds, A., Barrett, C., & Tinelli, C. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-94583-1_24 · Cited by 14
Self-citationInvertibility Conditions for Floating-Point Formulas
Brain, M., Niemetz, A., Preiner, M., Reynolds, A., Barrett, C., & Tinelli, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25543-5_8 · Cited by 6
Self-citationOn solving quantified bit-vector constraints using invertibility conditions
Niemetz, A., Preiner, M., Reynolds, A., Barrett, C., & Tinelli, C. (2021) · Formal Methods in System Design · doi:10.1007/s10703-020-00359-9 · Cited by 4
Self-citationA Decision Procedure for String to Code Point Conversion
Reynolds, A., Nötzli, A., Barrett, C., et al. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51074-9_13 · Cited by 3
Self-citation
Cited by
LLM Meets Bounded Model Checking: Neuro-symbolic Loop Invariant Inference
Wu, G., Cao, W., Yao, Y., Wei, H., Chen, T., & Ma, X. (2024) · Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/3691620.3695014 · Cited by 24
Automated Validating and Fixing of Text-to-SQL Translation with Execution Consistency
Yang, Y., Wang, Z., Xia, Y., Wei, Z., Ding, H., Piskac, R., Chen, H., & Li, J. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3725271 · Cited by 8
Eilers, M., Schwerhoff, M., Summers, A. J., & Müller, P. (2025) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-98668-0_5 · Cited by 2
Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization (Extended Version)
Cutler, J. W., Disselkoen, C., Eline, A., He, S., Headley, K., Hicks, M., Hietala, K., Ioannidis, E., Kastner, J., Mamat, A., et al. (2024) · arXiv · doi:10.48550/arxiv.2403.04651 · Cited by 2
Metadata
- Authors
- Barbosa, H., Barrett, C., Brain, M., Kremer, G., Lachnitt, H., Mann, M., Mohamed, A., Mohamed, M., Niemetz, A., Nötzli, A., Ozdemir, A., Preiner, M., Reynolds, A., Sheng, Y., Tinelli, C., & Zohar, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2022
- Pages
- 415-442
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4225922019
- Cited by
- 468
- References
- 69
- FWCI
- 135.81
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.