Parallel SAT solving in bounded model checking
DOI10.1093/LOGCOM/EXP002zbMATH Open1213.68359OpenAlexW2041340053MaRDI QIDQ3069995FDOQ3069995
Authors: Erika Ábrahám, Tobias Schubert, Bernd Becker, Martin Fränzle, Christian Herde 
Publication date: 2 February 2011
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exp002
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (12)
- Challenges in Constraint-Based Analysis of Hybrid Systems
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- Parallelizing SMT solving: lazy decomposition and conciliation
- An expressive model for instance decomposition based parallel SAT solvers
- Correct Hardware Design and Verification Methods
- Fractal Parallelism: Solving SAT in Bounded Space and Time
- Towards better heuristics for solving bounded model checking problems
- Under-approximation heuristics for grid-based bounded model checking
- Efficient distributed SAT and SAT-based distributed bounded model checking
- An incremental algorithm to check satisfiability for bounded model checking
- Title not available (Why is that?)
Uses Software
This page was built for publication: Parallel SAT solving in bounded model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069995)
