SAT-Based Scalable Formal Verification Solutions
From MaRDI portal
Recommendations
Cited in
(14)- A verified SAT solver framework with learn, forget, restart, and incrementality
- Optimized SAT encoding of conformance checking artefacts
- DPLL+ROBDD derivation applied to inversion of some cryptographic functions
- Post-silicon and runtime verification for modern processors
- SAT-Based Model Checking
- Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions
- Polynomial graph transformability
- Technology for translating combinatorial problems into Boolean equations
- Scalable Techniques for Formal Verification
- Constraint-Based Verification
- Formal Methods in Computer-Aided Design
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Towards better heuristics for solving bounded model checking problems
- Formal Verification of Structurally Complex Multipliers
This page was built for publication: SAT-Based Scalable Formal Verification Solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386252)