Model checking as program verification by abstract interpretation
From MaRDI portal
Cites work
- A correctness and incorrectness program logic
- Abstraction and abstraction refinement
- Abstraction for falsification
- Abstraction refinement for bounded model checking
- Boolean and Cartesian abstraction for model checking C programs
- Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
- Counterexample-guided abstraction refinement
- Counterexample-guided abstraction refinement for symbolic model checking
- Data flow analysis as model checking
- Fixpoint-Guided Abstraction Refinements
- Flow logic: A multi-paradigmatic approach to static analysis
- Generalized Strong Preservation by Abstract Interpretation
- Generating data flow analysis algorithms from modal specifications
- scientific article; zbMATH DE number 408802 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 2143089 (Why is no real title available?)
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- Incompleteness of states w.r.t. traces in model checking
- Incompleteness, counterexamples, and refinements in abstract model-checking
- Making abstract interpretations complete
- Making abstract model checking strongly preserving
- Model checking
- Model checking \textit{is} static analysis of modal logic
- On the completeness of model checking
- Predicate abstraction for program verification
- Principles of abstract interpretation
- Property preserving abstractions for the verification of concurrent systems
- Semantics for abstract interpretation-based static analyzes of temporal properties
- Simulation-based minimization
- Software model checking
- Temporal abstract interpretation
- Temporal logic can be more expressive
- Tools and Algorithms for the Construction and Analysis of Systems
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
This page was built for publication: Model checking as program verification by abstract interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310278)