cvc5: A Versatile and Industrial-Strength SMT Solver-Reference-Cited by-同舟云学术

cvc5: A Versatile and Industrial-Strength SMT Solver

Published:2022 Issue: Volume: Page:415-442
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Barbosa Haniel^ORCID,Barrett Clark^ORCID,Brain Martin^ORCID,Kremer Gereon^ORCID,Lachnitt Hanna^ORCID,Mann Makai^ORCID,Mohamed Abdalrhman^ORCID,Mohamed Mudathir^ORCID,Niemetz Aina^ORCID,Nötzli Andres^ORCID,Ozdemir Alex^ORCID,Preiner Mathias^ORCID,Reynolds Andrew^ORCID,Sheng Ying^ORCID,Tinelli Cesare^ORCID,Zohar Yoni^ORCID

Abstract

Abstractcvc5 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.

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-99524-9_24

Reference138 articles.

1. Ábrahám, E., Davenport, J.H., England, M., Kremer, G.: Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings. J. Log. Algebraic Methods Program. 119, 100633 (2021). https://doi.org/10.1016/j.jlamp.2020.100633

2. Alur, R., Bodík, R., Juniwal, G., Martin, M.M.K., Raghothaman, M., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A.: Syntax-guided synthesis. In: Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, October 20-23, 2013. pp. 1–8. IEEE (2013), https://ieeexplore.ieee.org/document/6679385/

3. Alur, R., Bodík, R., Juniwal, G., Martin, M.M.K., Raghothaman, M., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A.: Syntax-guided synthesis. In: Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, October 20-23, 2013. pp. 1–8. IEEE (2013), http://ieeexplore.ieee.org/document/6679385/

4. Alur, R., Radhakrishna, A., Udupa, A.: Scaling enumerative program synthesis via divide and conquer. In: Legay, A., Margaria, T. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10205, pp. 319–336 (2017). https://doi.org/10.1007/978-3-662-54577-5_18

5. Armand, M., Faure, G., Grégoire, B., Keller, C., Théry, L., Werner, B.: A modular integration of SAT/SMT solvers to Coq through proof witnesses. In: Jouannaud, J.P., Shao, Z. (eds.) Certified Programs and Proofs. Lecture Notes in Computer Science, vol. 7086, pp. 135–150. Springer (2011). https://doi.org/10.1007/978-3-642-25379-9_12

Cited by 114 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enabling Runtime Verification of Causal Discovery Algorithms with Automated Conditional Independence Reasoning;Proceedings of the 46th IEEE/ACM International Conference on Software Engineering;2024-02-06

2. A Matroid-Based Automatic Prover and Coq Proof Generator for Projective Incidence Geometry;Journal of Automated Reasoning;2024-01-18

3. Inference of Robust Reachability Constraints;Proceedings of the ACM on Programming Languages;2024-01-05

4. Parikh’s Theorem Made Symbolic;Proceedings of the ACM on Programming Languages;2024-01-05

5. Solving Infinite-State Games via Acceleration;Proceedings of the ACM on Programming Languages;2024-01-05