An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation
Abstract elided by the publisher.
Related papers
- Strong Preservation as Completeness in Abstract Interpretation ESOP 2004
- Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation VMCAI 2006
- Assume-Guarantee Abstraction Refinement for Probabilistic Systems CAV 2012
- ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs ESOP 2020
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities TACAS 2020
- Refinement Types for ML PLDI 1991
- Compiling with Abstract Interpretation PLDI 2024
- Extending a lambda-Calculus with Explicit Substitution which Preserves Strong Normalisation Into a Confluent Calculus on Open Terms JFP 1997