An abstract interpretation-based refinement algorithm for strong preservation
From MaRDI portal
Recommendations
- Generalized Strong Preservation by Abstract Interpretation
- Programming Languages and Systems
- Making abstract model checking strongly preserving
- A Forward-Backward Abstraction Refinement Algorithm
- Verification, Model Checking, and Abstract Interpretation
- Structure-preserving binary relations for program abstraction
- Effective interpolation and preservation in guarded logics
- Effective interpolation and preservation in guarded logics
- Comparing abstraction refinement algorithms
Cited in
(10)- Preservation of weak SAI's under increasing transformations with applications
- Combining search space partition and abstraction for LTL model checking
- Incompleteness of states w.r.t. traces in model checking
- Generalized Strong Preservation by Abstract Interpretation
- What you lose is what you leak: information leakage in declassification policies
- Programming Languages and Systems
- Deriving Bisimulations by Simplifying Partitions
- A Forward-Backward Abstraction Refinement Algorithm
- Verification, Model Checking, and Abstract Interpretation
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
This page was built for publication: An abstract interpretation-based refinement algorithm for strong preservation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703755)