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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [1 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01920615
Contributor : Etienne Lozes <>
Submitted on : Tuesday, November 13, 2018 - 1:38:13 PM
Last modification on : Friday, November 23, 2018 - 1:13:13 AM
Document(s) archivé(s) le : Thursday, February 14, 2019 - 2:33:06 PM

File

main-long.pdf
Files produced by the author(s)

Identifiers

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. ⟨10.1145/3009837⟩. ⟨hal-01920615⟩

Share

Metrics

Record views

17

Files downloads

12