SAT-Based Model Checking
From MaRDI portal
Recommendations
- Model checking with Boolean Satisfiability
- Bounded model checking using satisfiability solving
- Certifying proofs for SAT-based model checking
- SAT-Based Model Checking without Unrolling
- Efficient SAT-based bounded model checking for software verification
- Theory and Applications of Models of Computation
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
Cites work
- scientific article; zbMATH DE number 1629965 (Why is no real title available?)
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 1701764 (Why is no real title available?)
- scientific article; zbMATH DE number 1799521 (Why is no real title available?)
- scientific article; zbMATH DE number 1232241 (Why is no real title available?)
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- scientific article; zbMATH DE number 1953038 (Why is no real title available?)
- scientific article; zbMATH DE number 1956569 (Why is no real title available?)
- scientific article; zbMATH DE number 1903351 (Why is no real title available?)
- scientific article; zbMATH DE number 1903357 (Why is no real title available?)
- scientific article; zbMATH DE number 7088727 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- Abstract conflict driven learning
- Abstractions from proofs
- An interpolating sequent calculus for quantifier-free Presburger arithmetic
- Applying Logic Synthesis for Speeding Up SAT
- BMC via on-the-fly determinization
- Beyond quantifier-free interpolation in extensions of Presburger arithmetic
- Bounded Model Checking for Weak Alternating Büchi Automata
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Computing over-approximations with bounded model checking
- Context-aware counter abstraction
- Counterexample-guided abstraction refinement for symbolic model checking
- Deciding Bit-Vector Arithmetic with Abstraction
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Delay-bounded scheduling
- Exploiting step semantics for efficient bounded model checking of asynchronous systems
- Formal Methods in Computer-Aided Design
- Formal Methods in Computer-Aided Design
- Functional specification of hardware via temporal logic
- Generalized property directed reachability
- Graph-Based Algorithms for Boolean Function Manipulation
- Interpolating quantifier-free Presburger arithmetic
- Interpolation and SAT-based model checking.
- Interpolation and model checking
- Invariant Synthesis for Combined Theories
- Lazy satisfiability modulo theories
- Linear Encodings of Bounded LTL Model Checking
- Linear completeness thresholds for bounded model checking
- Loop Summarization Using Abstract Transformers
- Making the most of BMC counterexamples
- Model checking concurrent programs
- Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
- Natural domain SMT: a preliminary assessment
- Numeric bounds analysis with conflict-driven learning
- On interference abstractions
- Planning as satisfiability: heuristics
- Predicate abstraction for program verification
- Predicate abstraction of ANSI-C programs using SAT
- Reachability analysis of pushdown automata: Application to model-checking
- Reasoning about infinite computations
- Reducing concurrent analysis under a context bound to sequential analysis
- Regular canonical systems
- SAT-Based Model Checking without Unrolling
- SAT-Based Scalable Formal Verification Solutions
- Satisfiability modulo theories
- Simplify: a theorem prover for program checking
- Simulating circuit-level simplifications on CNF
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Strengthening induction-based race checking with lightweight static analysis
- Symbolic Counter Abstraction for Concurrent Software
- Symbolic execution and program testing
- Temporal logic and fair discrete systems
- Termination criteria for bounded model checking: extensions and comparison
- Theory and Applications of Satisfiability Testing
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Understanding IC3
- Verification of SpecC using predicate abstraction
Cited in
(34)- SAT-based bounded model checking for propositional projection temporal logic
- Of temporary coalitions in terms of concurrent game models, announcements, and temporal projection
- SAT-BASED MODEL CHECKING FOR REGION AUTOMATA
- Computer Aided Verification
- Theory and Applications of Models of Computation
- Tools and Algorithms for the Construction and Analysis of Systems
- Interpolation and model checking
- Optimized SAT encoding of conformance checking artefacts
- scientific article; zbMATH DE number 1670796 (Why is no real title available?)
- Certifying incremental SAT solving
- Formal Methods for Hardware Verification
- Bounded model checking and induction: From refutation to verification (extended abstract, Category A)
- Parallel SAT solving in bounded model checking
- scientific article; zbMATH DE number 1852147 (Why is no real title available?)
- Model checking with Boolean Satisfiability
- Abstraction and abstraction refinement
- Model Checking Software
- Using execution logs for improving pseudo-Boolean propagation
- Satisfiability modulo theories
- Speeding up pseudo-Boolean propagation
- COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
- Accelerating bounded model checking of safety properties
- Combining Model Checking and Deduction
- A BMC-formulation for the scheduling problem in highly constrained hardware systems
- ZB 2005: Formal Specification and Development in Z and B
- Supporting SAT based BMC on finite path models
- Formal Methods in Computer-Aided Design
- Computing over-approximations with bounded model checking
- Improving and understanding the power of satisfaction-driven clause learning
- An incremental algorithm to check satisfiability for bounded model checking
- Formalization of Abstract State Transition Systems for SAT
- SAT-Based Model Checking without Unrolling
- scientific article; zbMATH DE number 2087634 (Why is no real title available?)
- Model checking of concurrent software systems via heuristic-guided SAT solving
Describes a project that uses
Uses Software
This page was built for publication: SAT-Based Model Checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176368)
