OpenSMT2: an SMT solver for multi-core and cloud computing
DOI10.1007/978-3-319-40970-2_35zbMATH Open1475.68438OpenAlexW2488157396MaRDI QIDQ2818042FDOQ2818042
Authors: Antti E. J. Hyvärinen, Matteo Marescotti, Leonardo Alt, Natasha Sharygina 
Publication date: 5 September 2016
Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40970-2_35
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
Cited In (13)
- Title not available (Why is that?)
- Exploiting partial variable assignment in interpolation-based model checking
- Farkas-based tree interpolation
- Lattice-based refinement in bounded model checking
- Search-space partitioning for parallelizing SMT solvers
- Title not available (Why is that?)
- SMT-based verification of program changes through summary repair
- An interdisciplinary experimental evaluation on the disjunctive temporal problem
- Extending the fundamental theorem of linear programming for strict inequalities
- \textsc{Carcara}: an efficient proof checker and elaborator for SMT proofs in the Alethe format
- The \textsc{Golem} Horn solver
- Transition power abstractions for deep counterexample detection
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
Uses Software
This page was built for publication: OpenSMT2: an SMT solver for multi-core and cloud computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2818042)
