Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation
No abstract available.
DOI 10.1007/11609773_22
Related papers
- Strong Preservation as Completeness in Abstract Interpretation ESOP 2004
- An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation TACAS 2005
- A compiled implementation of strong reduction ICFP 2002
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities TACAS 2020
- Verification of Erlang Programs using Abstract Interpretation and Model Mhecking ICFP 1999
- A Temporal Fixpoint Calculus POPL 1988
- Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints POPL 1977
- Fair reactive programming POPL 2014