CVC4

CVC4 is an efficient open-source automatic theorem prover for satisfiability modulo theories (SMT) problems. It can be used to prove the validity (or, dually, the satisfiability) of first-order formulas in a large number of built-in logical theories and their combination. CVC4 is the fourth in the Cooperating Validity Checker family of tools (CVC, CVC Lite, CVC3) but does not directly incorporate code from any previous version. A joint project of NYU and U Iowa, CVC4 aims to support the features 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 is intended to be an open and extensible SMT engine, and it can be used as a stand-alone tool or as a library, with essentially no limit on its use for research or commercial purposes (see license).


References in zbMATH (referenced in 111 articles , 1 standard article )

Showing results 1 to 20 of 111.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Bozga, Marius; Iosif, Radu; Sifakis, Joseph: Checking deadlock-freedom of parametric component-based systems (2021)
  2. Filliâtre, Jean-Christophe: Simpler proofs with decentralized invariants (2021)
  3. Niemetz, Aina; Preiner, Mathias; Reynolds, Andrew; Barrett, Clark; Tinelli, Cesare: On solving quantified bit-vector constraints using invertibility conditions (2021)
  4. Bansal, Kshitij; Koskinen, Eric; Tripp, Omer: Synthesizing precise and useful commutativity conditions (2020)
  5. Benzmüller, Christoph; Scott, Dana S.: Automating free logic in HOL, with an experimental application in category theory (2020)
  6. Bromberger, Martin; Sturm, Thomas; Weidenbach, Christoph: A complete and terminating approach to linear integer solving (2020)
  7. Durán, Francisco; Eker, Steven; Escobar, Santiago; Martí-Oliet, Narciso; Meseguer, José; Rubio, Rubén; Talcott, Carolyn: Programming and symbolic computation in Maude (2020)
  8. Echenim, M.; Peltier, N.: Combining induction and saturation-based theorem proving (2020)
  9. Qin, Xudong; Bliudze, Simon; Madelaine, Eric; Hou, Zechen; Deng, Yuxin; Zhang, Min: SMT-based generation of symbolic automata (2020)
  10. Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Diep, Bui Phi; Holík, Lukáš; Janků, Petr: Chain-free string constraints (2019)
  11. Barbosa, Haniel; Reynolds, Andrew; El Ouraoui, Daniel; Tinelli, Cesare; Barrett, Clark: Extending SMT solvers to higher-order logic (2019)
  12. Besson, Frédéric; Blazy, Sandrine; Wilke, Pierre: A verified CompCert front-end for a memory model supporting pointer arithmetic and uninitialised data (2019)
  13. Borralleras, Cristina; Larraz, Daniel; Rodríguez-Carbonell, Enric; Oliveras, Albert; Rubio, Albert: Incomplete SMT techniques for solving non-linear formulas over the integers (2019)
  14. Bromberger, Martin; Fleury, Mathias; Schwarz, Simon; Weidenbach, Christoph: SPASS-SATT. A CDCL(LA) solver (2019)
  15. Brown, Chad E.; Gauthier, Thibault; Kaliszyk, Cezary; Sutcliffe, Geoff; Urban, Josef: GRUNGE: a grand unified ATP challenge (2019)
  16. Niemetz, Aina; Preiner, Mathias; Reynolds, Andrew; Zohar, Yoni; Barrett, Clark; Tinelli, Cesare: Towards bit-width-independent proofs in SMT solvers (2019)
  17. Rawson, Michael; Reger, Giles: A neurally-guided, parallel theorem prover (2019)
  18. Reynolds, Andrew; Kuncak, Viktor; Tinelli, Cesare; Barrett, Clark; Deters, Morgan: Refutation-based synthesis in SMT (2019)
  19. Sutcliffe, Geoff: The CADE-27 automated theorem proving system competition -- CASC-27 (2019)
  20. Bansal, Kshitij; Barrett, Clark; Reynolds, Andrew; Tinelli, Cesare: Reasoning with finite sets and cardinality constraints in SMT (2018)

1 2 3 4 5 6 next