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