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

Abstract : 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.
Type de document :
Communication dans un congrès
the 44th ACM SIGPLAN Symposium, Jan 2017, Paris, France. ACM Press, the 44th ACM SIGPLAN Symposium, 〈10.1145/3009837〉
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01920615
Contributeur : Etienne Lozes <>
Soumis le : mardi 13 novembre 2018 - 13:38:13
Dernière modification le : vendredi 23 novembre 2018 - 01:13:13

Fichier

main-long.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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. ACM Press, the 44th ACM SIGPLAN Symposium, 〈10.1145/3009837〉. 〈hal-01920615〉

Partager

Métriques

Consultations de la notice

6

Téléchargements de fichiers

3