Search-Space Partitioning for Parallelizing SMT Solvers

DOI10.1007/978-3-319-24318-4_27zbMath1471.68244OpenAlexW2281633864MaRDI QIDQ3453241

Antti E. J. Hyvärinen, Natasha Sharygina, Matteo Marescotti

Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_27

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

OpenSMT2: An SMT Solver for Multi-core and Cloud Computing

Uses Software

• MiniSat
• PSATO
• Yices
• SATO
• z3
• SIMPLIFY
• Chaff
• OpenSMT
• SYMBA
• CVC4
• MathSAT5
• Mcmt
• vZ
• SAFARI

Cites Work

• Unnamed Item
• An overview of parallel SAT solving
• A fast parallel SAT-solver -- efficient workload balancing
• PSATO: A distributed propositional prover and its application to quasigroup problems
• Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
• Partitioning Search Spaces of a Randomized Search
• Solving SAT and SAT Modulo Theories
• Simplify: a theorem prover for program checking
• Exploiting Symmetry in SMT Problems
• Theory and Applications of Satisfiability Testing
• The MathSAT5 SMT Solver
• Symbolic optimization with SMT solvers
• Term Rewriting and Applications
• MCMT: A Model Checker Modulo Theories
• On SAT Modulo Theories and Optimization Problems

This page was built for publication: Search-Space Partitioning for Parallelizing SMT Solvers