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

DOI10.1145/3009837.3009854zbMath1380.68277OpenAlexW2563241991WikidataQ130855308 ScholiaQ130855308MaRDI QIDQ5370859

Florian Bruse, Etienne Lozes, Naoki Kobayashi

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3009837.3009854

zbMATH Keywords

model checkinghigher-order recursion schemeshigher-order modal fixpoint logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Unnamed Item ⋮ Unnamed Item ⋮ Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking ⋮ Local higher-order fixpoint iteration

This page was built for publication: On the relationship between higher-order recursion schemes and higher-order fixpoint logic