C. H. Broadbent and N. Kobayashi. Saturation-based model checking of higher-order recursion schemes. In Proceedings of CSL 2013, volume 23 of LIPIcs, pages 129–148. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013.

Google Scholar

[4]

E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 1999.

Digital Library

Google Scholar

[5]

M. Hague, A. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In Proceedings of LICS 2008, pages 452–461. IEEE Computer Society, 2008.

Digital Library

Google Scholar

[6]

N. D. Jones. The expressive power of higher-order types or, life without CONS. Journal of Functional Programming, 11(1):5–94, 2001.

Digital Library

Google Scholar

[7]

T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS 2002, volume 2303 of Lecture Notes in Computer Science, pages 205–222. Springer, 2002.

Digital Library

Google Scholar

[8]

N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proceedings of POPL 2009, pages 416–428. ACM, 2009.

Digital Library

Google Scholar

[9]

N. Kobayashi. Model-checking higher-order functions. In Proceedings of PPDP 2009, pages 25–36. ACM, 2009.

Digital Library

Google Scholar

[10]

N. Kobayashi. A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes. In Proceedings of FoSSaCS 2011, volume 6604 of Lecture Notes in Computer Science, pages 260–274. Springer, 2011.

Digital Library

Google Scholar

[11]

N. Kobayashi. Model checking higher-order programs. Journal of the ACM, 60(3), 2013.

Digital Library

Google Scholar

[12]

N. Kobayashi and C.-H. L. Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In Proceedings of LICS 2009, pages 179–188. IEEE Computer Society, 2009.

Digital Library

Google Scholar

[13]

N. Kobayashi and C.-H. L. Ong. Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Logical Methods in Computer Science, 7(4), 2011.

Google Scholar

[14]

N. Kobayashi and C.-H. L. Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. A revised and extended version of {12}. http://www-kb.is.s.u-tokyo. ac.jp/~koba/papers/lics09-full.pdf, 2012.

Google Scholar

[15]

N. Kobayashi, R. Sato, and H. Unno. Predicate abstraction and CEGAR for higher-order model checking. In Proceedings of PLDI 2011, pages 222–233. ACM, 2011.

Digital Library

Google Scholar

[16]

N. Kobayashi, É. Lozes, and F. Bruse. On the relationship between higher-order recursion schemes and higher-order fixpoint logic, 2016.

Google Scholar

[17]

A longer version, available from the first author’s web page.

Google Scholar

[18]

T. Kuwahara, T. Terauchi, H. Unno, and N. Kobayashi. Automatic termination verification for higher-order functional programs. In Proceedings of ESOP 2014, volume 8410 of Lecture Notes in Computer Science, pages 392–411. Springer, 2014.

Digital Library

Google Scholar

[19]

T. Kuwahara, R. Sato, H. Unno, and N. Kobayashi. Predicate abstraction and CEGAR for disproving termination of higher-order functional programs. In Proceedings of CAV 2015, volume 9207 of Lecture Notes in Computer Science, pages 287–303. Springer, 2015.

Crossref

Google Scholar

[20]

M. Lange, É. Lozes, and M. V. Guzmán. Model-checking process equivalences. Theor. Comput. Sci., 560:326–347, 2014.

Digital Library

Google Scholar

[21]

É. Lozes. A type-directed negation elimination. In R. Matthes and M. Mio, editors, Proceedings of Tenth International Workshop on Fixed Points in Computer Science (FICS 2015), volume 191 of EPTCS, pages 132–142, 2015.

Google Scholar

[22]

M. Müller-Olm. A modal fixpoint logic with chop. In Proceedings of STACS 99, volume 1563 of Lecture Notes in Computer Science, pages 510–520. Springer, 1999.

Digital Library

Google Scholar

[23]

A. Murase, T. Terauchi, N. Kobayashi, R. Sato, and H. Unno. Temporal verification of higher-order functional programs. In Proceedings of POPL 2016, pages 57–68. ACM, 2016.

Digital Library

Google Scholar

[24]

R. P. Neatherway, S. J. Ramsay, and C.-H. L. Ong. A traversal-based algorithm for higher-order model checking. In Proceedings of ICFP ’12, pages 353–364, 2012.

Digital Library

Google Scholar

[25]

C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In Proceedings of LICS 2006, pages 81–90. IEEE Computer Society, 2006.

Digital Library

Google Scholar

[26]

C.-H. L. Ong and S. Ramsay. Verifying higher-order programs with pattern-matching algebraic data types. In Proceedings of POPL 2011, pages 587–598. ACM, 2011.

Digital Library

Google Scholar

[27]

S. Ramsay, R. Neatherway, and C.-H. L. Ong. An abstraction refinement approach to higher-order model checking. In Proceedings of POPL 2014, pages 61–72. ACM, 2014.

Digital Library

Google Scholar

[28]

S. Salvati and I. Walukiewicz. Krivine machines and higher-order schemes. In Proceedings of ICALP 2011, volume 6756 of Lecture Notes in Computer Science, pages 162–173. Springer, 2011.

Digital Library

Google Scholar

[29]

S. Salvati and I. Walukiewicz. Typing weak MSOL properties. In Proceedings of FoSSaCS 2015, volume 9034 of Lecture Notes in Computer Science, pages 343–357. Springer, 2015.

Crossref

Google Scholar

[30]

S. Salvati and I. Walukiewicz. A model for behavioural properties of higher-order programs. In Proceedings of CSL 2015, volume 41 of LIPIcs, pages 229–243. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015.

Google Scholar

[31]

C. Stirling and D. Walker. Local model checking in the modal mucalculus. Theoretical Computer Science, 89(1):161–177, 1991.

Digital Library

Google Scholar

[32]

T. Tsukada and C. L. Ong. Compositional higher-order model checking via ω-regular games over böhm trees. In Proceedings of CSL-LICS ’14, pages 78:1–78:10. ACM, 2014.

Digital Library

Google Scholar

[33]

H. Unno, T. Terauchi, and N. Kobayashi. Automating relatively complete verification of higher-order functional programs. In Proceedings of POPL 2013, pages 75–86. ACM, 2013.

Digital Library

Google Scholar

[34]

M. Viswanathan and R. Viswanathan. A higher order modal fixed point logic. In Proceedings of CONCUR 2004, volume 3170 of Lecture Notes in Computer Science, pages 512–528. Springer, 2004.

Crossref

Google Scholar

[35]

K. Yasukata, N. Kobayashi, and K. Matsuda. Pairwise reachability analysis for higher order concurrent programs by higher-order model checking. In Proceedings of CONCUR 2014, volume 8704 of Lecture Notes in Computer Science, pages 312–326. Springer, 2014.

Crossref

Google Scholar

Cited By

View all

Bruse FKreiker JLange MSälzer M(2020)Local Higher-Order Fixpoint IterationElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.326.7326(97-113)Online publication date: 20-Sep-2020
https://doi.org/10.4204/EPTCS.326.7
Walukiewicz IBouyer P(2019)LambdaY-calculus with prioritiesProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470172(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470172
Lange M(2019)Specifying Program Properties Using Modal Fixpoint Logics: A Survey of ResultsLogic and Its Applications10.1007/978-3-662-58771-3_5(42-51)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/978-3-662-58771-3_5
Show More Cited By

Index Terms

On the relationship between higher-order recursion schemes and higher-order fixpoint logic
1. Theory of computation
  1. Logic
  2. Models of computation
    1. Computability

Recommendations

On the relationship between higher-order recursion schemes and higher-order fixpoint logic
POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages

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 extedned to higher-order modal ...
Types and higher-order recursion schemes for verification of higher-order programs
POPL '09

We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the model-checking problem for higher-order recursion schemes (HORS's). A program is ...
Types and higher-order recursion schemes for verification of higher-order programs
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the model-checking problem for higher-order recursion schemes (HORS's). A program is ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 52, Issue 1

POPL '17

January 2017

901 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/3093333

Editor:
Matthew Fluet

Issue’s Table of Contents

POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
January 2017
901 pages
ISBN:9781450346603
DOI:10.1145/3009837
General Chair:
Giuseppe Castagna
Paris Diderot University, France / CNRS, France
,
Program Chair:
Andrew D. Gordon
Microsoft Research, UK / University of Edinburgh, UK

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 2017

Published in SIGPLAN Volume 52, Issue 1

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
248
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bruse FKreiker JLange MSälzer M(2020)Local Higher-Order Fixpoint IterationElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.326.7326(97-113)Online publication date: 20-Sep-2020
https://doi.org/10.4204/EPTCS.326.7
Walukiewicz IBouyer P(2019)LambdaY-calculus with prioritiesProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470172(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470172
Lange M(2019)Specifying Program Properties Using Modal Fixpoint Logics: A Survey of ResultsLogic and Its Applications10.1007/978-3-662-58771-3_5(42-51)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/978-3-662-58771-3_5
Sekiyama TUnno H(2024)Higher-Order Model Checking of Effect-Handling Programs with Answer-Type ModificationProceedings of the ACM on Programming Languages10.1145/36898058:OOPSLA2(2662-2691)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689805
Kobayashi NTanahashi KSato RTsukada T(2023)HFL(Z) Validity Checking for Automated Program VerificationProceedings of the ACM on Programming Languages10.1145/35711997:POPL(154-184)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571199
Bruse FKreiker JLange MSälzer M(2022)Local higher-order fixpoint iterationInformation and Computation10.1016/j.ic.2022.104963289(104963)Online publication date: Nov-2022
https://doi.org/10.1016/j.ic.2022.104963
Jochems J(2021)Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn ClausesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.344.4344(36-64)Online publication date: 13-Sep-2021
https://doi.org/10.4204/EPTCS.344.4
Kobayashi N(2021)An Overview of the HFL Model Checking ProjectElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.344.1344(1-12)Online publication date: 13-Sep-2021
https://doi.org/10.4204/EPTCS.344.1
Tsukada THermanns HZhang LKobayashi NMiller D(2020)On Computability of Logical Approaches to Branching-Time Property Verification of ProgramsProceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3373718.3394766(886-899)Online publication date: 8-Jul-2020
https://dl.acm.org/doi/10.1145/3373718.3394766
Iwayama NKobayashi NSuzuki RTsukada T(2020)Predicate Abstraction and CEGAR for Validity CheckingStatic Analysis10.1007/978-3-030-65474-0_7(134-155)Online publication date: 18-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-65474-0_7
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

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

Types and higher-order recursion schemes for verification of higher-order programs

Types and higher-order recursion schemes for verification of higher-order programs