On the relationship between higher-order recursion schemes and higher-order fixpoint logic

Naoki Kobayashi (1) , Etienne Lozes (2, 3) , Florian Bruse (4)

1 UTokyo - The University of Tokyo
2 LSV - Laboratoire Spécification et Vérification [Cachan]
3 Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
4 University of Kassel

We study the relationship between two kinds of higher-order extensions of model checking: HORS model checking, where models are extended to higher-order recursion schemes, and HFL model checking , where the logic is extended to higher-order modal fixpoint logic. These extensions have been independently studied until recently, and the former has been applied to higher-order program verification, while the latter has been applied to assume-guarantee reasoning and process equivalence checking. We show that there exist (ar-guably) natural reductions between the two problems. To prove the correctness of the translation from HORS to HFL model checking, we establish a type-based characterization of HFL model checking, which should be of independent interest. The results reveal a close relationship between the two problems, enabling cross-fertilization of the two research threads.

Mots clés: higher-order recursion schemes; higher-order modal fixpoint logic; model checking

Domaines: Informatique [cs]

Naoki Kobayashi, Etienne Lozes, Florian Bruse. On the relationship between higher-order recursion schemes and higher-order fixpoint logic. the 44th ACM SIGPLAN Symposium, Jan 2017, Paris, France. ⟨10.1145/3009837⟩. ⟨hal-01920615⟩