Refining and compressing abstract model checking
From MaRDI portal
Recommendations
Cites work
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Grammar semantics, analysis and parsing by abstract interpretation
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- Model-checking. A tutorial introduction
- Optimal domains for disjunctive abstract interpretation
- Refining and compressing abstract domains
- Systematic design of program transformation frameworks by abstract interpretation
- Temporal abstract interpretation
Cited in
(14)- Abstraction refinement for emptiness checking of alternating data automata
- Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
- Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic
- Refinement of LTL formulas for abstract model checking
- Domain compression for complete abstractions
- Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
- Model checking with formula-dependent abstract models
- Automatic abstraction using generalized model checking
- Compressing transitions for model checking
- scientific article; zbMATH DE number 898449 (Why is no real title available?)
- A type-directed abstraction refinement approach to higher-order model checking
- Concrete model checking with abstract matching and refinement
- Concrete abstractions. Formalizing and analyzing discrete theories and algorithms with the RISCAL model checker
- An efficient approach for abstraction-refinement in model checking
This page was built for publication: Refining and compressing abstract model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923520)