On Model-Checking for Fragments of µ-Calculus
No abstract available.
DOI 10.1007/3-540-56922-7_32
Related papers
- Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus TACAS 1996
- Undecidability of d<: and its decidable fragments POPL 2020
- LJGS: Gradual Security Types for Object-Oriented Languages ECOOP 2016
- Generation of Reduced Models for Checking Fragments of CTL CAV 1993
- On the Universal and Existential Fragments of the µ-Calculus TACAS 2003
- Types and higher-order recursion schemes for verification of higher-order programs POPL 2009
- Mutually Iso-Recursive Subtyping OOPSLA 2023
- Modelling Homogeneous Generative Meta-Programming ECOOP 2017