The modal logic of abstraction refinement
From MaRDI portal
Cites work
- Abstraction and abstraction refinement
- Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
- Automatic abstraction using generalized model checking
- Automatic abstraction without counterexamples
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- Counterexample-guided abstraction refinement
- Counterexample-guided abstraction refinement for symbolic model checking
- Don't know in the -calculus
- Generalized model checking: Reasoning about partial state spaces
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 5046366 (Why is no real title available?)
- Modal logic
- Modal model theory
- Modal transition systems: A foundation for three-valued program analysis
- Moving up and down in the generic multiverse
- Refinement modal logic
- SAT based abstraction-refinement using ILP and machine learning techniques
- Structural connections between a forcing class and its modal logic
- The complexity of one-agent refinement modal logic
- THE MODAL LOGIC OF -CENTERED FORCING AND RELATED FORCING CLASSES
- The modal logic of abelian groups
- The modal logic of forcing
- The modal logic of inner models
- THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES
- Tree-like constructions in topology and modal logic
This page was built for publication: The modal logic of abstraction refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317501)