skip to main content
research-article

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

Published:01 January 2017Publication History
Skip Abstract Section

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 extedned to higher-order modal fixpoint logic. Those extensions

have been independently studied until recently, and the former has

been applied to higher-order program verification. We show that there

exist (arguably) 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.

References

  1. K. Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3), 2007.Google ScholarGoogle Scholar
  2. R. Axelsson, M. Lange, and R. Somla. The complexity of model checking higher-order fixpoint logic. Logical Methods in Computer Science, 3(2), 2007.Google ScholarGoogle Scholar
  3. 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 ScholarGoogle Scholar
  4. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. D. Jones. The expressive power of higher-order types or, life without CONS. Journal of Functional Programming, 11(1):5–94, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. N. Kobayashi. Model-checking higher-order functions. In Proceedings of PPDP 2009, pages 25–36. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. N. Kobayashi. Model checking higher-order programs. Journal of the ACM, 60(3), 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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 ScholarGoogle 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 ScholarGoogle 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. N. Kobayashi, É. Lozes, and F. Bruse. On the relationship between higher-order recursion schemes and higher-order fixpoint logic, 2016.Google ScholarGoogle Scholar
  17. A longer version, available from the first author’s web page.Google ScholarGoogle 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle ScholarCross RefCross Ref
  20. M. Lange, É. Lozes, and M. V. Guzmán. Model-checking process equivalences. Theor. Comput. Sci., 560:326–347, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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 ScholarGoogle 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle ScholarCross RefCross Ref
  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 ScholarGoogle Scholar
  31. C. Stirling and D. Walker. Local model checking in the modal mucalculus. Theoretical Computer Science, 89(1):161–177, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle ScholarCross RefCross Ref
  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.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

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

      Recommendations

      Comments

      Login options

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

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!