SMT-LIB

SMT-LIB was created with the expectation that the availability of common standards and a library of benchmarks would greatly facilitate the evaluation and the comparison of SMT systems, and advance the state of the art in the field in the same way as, for instance, the TPTP library has done for theorem proving, or the SATLIB library has done initially for SAT.


References in zbMATH (referenced in 180 articles )

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

1 2 3 ... 7 8 9 next

  1. Barbosa, Haniel; Blanchette, Jasmin Christian; Fleury, Mathias; Fontaine, Pascal: Scalable fine-grained proofs for formula processing (2020)
  2. Bright, Curtis; Kotsireas, Ilias; Ganesh, Vijay: Applying computer algebra systems with SAT solvers to the Williamson conjecture (2020)
  3. Davenport, James H.; England, Matthew; Griggio, Alberto; Sturm, Thomas; Tinelli, Cesare: Symbolic computation and satisfiability checking (2020)
  4. England, Matthew; Bradford, Russell; Davenport, James H.: Cylindrical algebraic decomposition with equational constraints (2020)
  5. Kremer, Gereon; Ábrahám, Erika: Fully incremental cylindrical algebraic decomposition (2020)
  6. Qin, Xudong; Bliudze, Simon; Madelaine, Eric; Hou, Zechen; Deng, Yuxin; Zhang, Min: SMT-based generation of symbolic automata (2020)
  7. Sebastiani, Roberto; Trentin, Patrick: \textscOptiMathSAT: a tool for optimization modulo theories (2020)
  8. Amadini, Roberto; Andrlon, Mak; Gange, Graeme; Schachte, Peter; Søndergaard, Harald; Stuckey, Peter J.: Constraint programming for dynamic symbolic execution of JavaScript (2019)
  9. Barbosa, Haniel; Reynolds, Andrew; El Ouraoui, Daniel; Tinelli, Cesare; Barrett, Clark: Extending SMT solvers to higher-order logic (2019)
  10. Borralleras, Cristina; Larraz, Daniel; Rodríguez-Carbonell, Enric; Oliveras, Albert; Rubio, Albert: Incomplete SMT techniques for solving non-linear formulas over the integers (2019)
  11. Bueno, Denis; Sakallah, Karem A.: EUFORIA: complete software model checking with uninterpreted functions (2019)
  12. König, Barbara; Nederkorn, Maxime; Nolte, Dennis: CoReS: a tool for computing core graphs via SAT/SMT solvers (2019)
  13. Niemetz, Aina; Preiner, Mathias; Reynolds, Andrew; Zohar, Yoni; Barrett, Clark; Tinelli, Cesare: Towards bit-width-independent proofs in SMT solvers (2019)
  14. Reger, Giles; Voronkov, Andrei: Induction in saturation-based proof search (2019)
  15. Schulz, Stephan; Cruanes, Simon; Vukmirović, Petar: Faster, higher, stronger: E 2.3 (2019)
  16. Trentin, Patrick; Sebastiani, Roberto: Optimization modulo the theory of floating-point numbers (2019)
  17. Bansal, Kshitij; Barrett, Clark; Reynolds, Andrew; Tinelli, Cesare: Reasoning with finite sets and cardinality constraints in SMT (2018)
  18. Barrett, Clark; Tinelli, Cesare: Satisfiability modulo theories (2018)
  19. Blanchette, Jasmin Christian; Peltier, Nicolas; Robillard, Simon: Superposition with datatypes and codatatypes (2018)
  20. Brandl, Florian; Brandt, Felix; Eberl, Manuel; Geist, Christian: Proving the incompatibility of efficiency and strategyproofness via SMT solving (2018)

1 2 3 ... 7 8 9 next