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 96 articles , 1 standard article )

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

1 2 3 4 5 next

  1. Benzmüller, Christoph; Scott, Dana S.: Automating free logic in HOL, with an experimental application in category theory (2020)
  2. Bromberger, Martin; Sturm, Thomas; Weidenbach, Christoph: A complete and terminating approach to linear integer solving (2020)
  3. Durán, Francisco; Eker, Steven; Escobar, Santiago; Martí-Oliet, Narciso; Meseguer, José; Rubio, Rubén; Talcott, Carolyn: Programming and symbolic computation in Maude (2020)
  4. Echenim, M.; Peltier, N.: Combining induction and saturation-based theorem proving (2020)
  5. Qin, Xudong; Bliudze, Simon; Madelaine, Eric; Hou, Zechen; Deng, Yuxin; Zhang, Min: SMT-based generation of symbolic automata (2020)
  6. Barbosa, Haniel; Reynolds, Andrew; El Ouraoui, Daniel; Tinelli, Cesare; Barrett, Clark: Extending SMT solvers to higher-order logic (2019)
  7. Besson, Frédéric; Blazy, Sandrine; Wilke, Pierre: A verified CompCert front-end for a memory model supporting pointer arithmetic and uninitialised data (2019)
  8. Bromberger, Martin; Fleury, Mathias; Schwarz, Simon; Weidenbach, Christoph: SPASS-SATT. A CDCL(LA) solver (2019)
  9. Brown, Chad E.; Gauthier, Thibault; Kaliszyk, Cezary; Sutcliffe, Geoff; Urban, Josef: GRUNGE: a grand unified ATP challenge (2019)
  10. Niemetz, Aina; Preiner, Mathias; Reynolds, Andrew; Zohar, Yoni; Barrett, Clark; Tinelli, Cesare: Towards bit-width-independent proofs in SMT solvers (2019)
  11. Reynolds, Andrew; Kuncak, Viktor; Tinelli, Cesare; Barrett, Clark; Deters, Morgan: Refutation-based synthesis in SMT (2019)
  12. Bansal, Kshitij; Barrett, Clark; Reynolds, Andrew; Tinelli, Cesare: Reasoning with finite sets and cardinality constraints in SMT (2018)
  13. Bansal, Kshitij; Koskinen, Eric; Tripp, Omer: Automatic generation of precise and useful commutativity conditions (2018)
  14. Bao, Yuyan; Leavens, Gary T.; Ernst, Gidon: Unifying separation logic and region logic to allow interoperability (2018)
  15. Barrett, Clark; Tinelli, Cesare: Satisfiability modulo theories (2018)
  16. Blanchette, Jasmin Christian; Peltier, Nicolas; Robillard, Simon: Superposition with datatypes and codatatypes (2018)
  17. Bromberger, Martin: A reduction from unbounded linear mixed arithmetic problems into bounded problems (2018)
  18. Charrier, Tristan; Pinchinat, Sophie; Schwarzentruber, François: Model checking against arbitrary public announcement logic: a first-order-logic prover approach for the existential fragment (2018)
  19. Cheng, Xi; Zhou, Min; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang: Parallelizing SMT solving: lazy decomposition and conciliation (2018)
  20. Ciobâcă, Ştefan; Lucanu, Dorel: A coinductive approach to proving reachability properties in logically constrained term rewriting systems (2018)

1 2 3 4 5 next