Parallel SAT solving in bounded model checking
From MaRDI portal
Publication:3069995
Recommendations
Cited in
(12)- Challenges in Constraint-Based Analysis of Hybrid Systems
- Fractal Parallelism: Solving SAT in Bounded Space and Time
- An incremental algorithm to check satisfiability for bounded model checking
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
- Efficient distributed SAT and SAT-based distributed bounded model checking
- An expressive model for instance decomposition based parallel SAT solvers
- Towards better heuristics for solving bounded model checking problems
- Parallelizing SMT solving: lazy decomposition and conciliation
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- Correct Hardware Design and Verification Methods
- Under-approximation heuristics for grid-based bounded model checking
- scientific article; zbMATH DE number 5510692 (Why is no real title available?)
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)