Tuning SAT checkers for bounded model checking
From MaRDI portal
Recommendations
Cited in
(44)- Accelerating bounded model checking of safety properties
- Formal verification based on Boolean expression diagrams
- Optimized SAT encoding of conformance checking artefacts
- Limitations of restricted branching in clause learning
- Backdoors to tractable answer set programming
- A subset-matching size-bounded cache for testing satisfiability in modal logics
- Verification of SpecC using predicate abstraction
- Improving saturation-based bounded model checking
- A BMC-formulation for the scheduling problem in highly constrained hardware systems
- Supporting SAT based BMC on finite path models
- An incremental algorithm to check satisfiability for bounded model checking
- Interpolant learning and reuse in SAT-based model checking
- Generating Diverse Solutions in SAT
- Parallel SAT solving in bounded model checking
- SAT-Based Model Checking without Unrolling
- Improving SAT modulo ODE for hybrid systems analysis by combining different enclosure methods
- Learning general constraints in CSP
- Implication-Based Approximating Bounded Model Checking
- SAT-solving in CSP trace refinement
- scientific article; zbMATH DE number 1956571 (Why is no real title available?)
- Feasibility analysis for robustness quantification by symbolic model checking
- Benchmarking a model checker for algorithmic improvements and tuning for performance
- Benefits of bounded model checking at an industrial setting
- scientific article; zbMATH DE number 2084774 (Why is no real title available?)
- Pruning techniques for the SAT-based bounded model checking problem
- Applying SAT methods in unbounded symbolic model checking
- Partial order reduction for deep bug finding in synchronous hardware
- Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse
- Computer Aided Verification
- Bounded Model Checking with Description Logic Reasoning
- SAT-BASED MODEL CHECKING FOR REGION AUTOMATA
- Automated Technology for Verification and Analysis
- Formal Methods in Computer-Aided Design
- Verification, Model Checking, and Abstract Interpretation
- An optimized symbolic bounded model checking engine
- Efficient distributed SAT and SAT-based distributed bounded model checking
- Theory and Applications of Models of Computation
- Model Checking Software
- Bounded model checking using satisfiability solving
- Towards better heuristics for solving bounded model checking problems
- On enumerating short projected models
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
This page was built for publication: Tuning SAT checkers for bounded model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754108)
