Higher-order model checking: From theory to practice

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2011, Pages 219-224

  Kobayashi, Naoki ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FUTURE DIRECTIONS; HASKELL; HIGHER ORDER; RECENT PROGRESS; RECURSION SCHEMES; SOFTWARE MODEL CHECKERS; THEORY AND PRACTICE;

COMPUTATION THEORY; FUNCTIONAL PROGRAMMING;

MODEL CHECKING;

EID: 80052157773     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2011.15     Document Type: Conference Paper

References (45)

1. K. Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3), 2007.
2. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In TLCA 2005, volume 3461 of Lecture Notes in Computer Science, pages 39-54. SpringerVerlag, 2005. (Pubitemid 41312707)
3. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. Safety is not a restriction at level 2 for string languages. In FoSSaCS, volume 3441 of Lecture Notes in Computer Science, pages 490-504. Springer-Verlag, 2005. (Pubitemid 41273725)
4. T. Ball and S. K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL, pages 1-3, 2002. (Pubitemid 35009025)
5. D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar. The software model checker Blast. International Journal on Software Tools for Technology Transfer, 9(5-6):505-525, 2007.
6. C. H. Broadbent, A. Carayol, C.-H. L. Ong, and O. Serre. Recursion schemes and logical reflection. In Proceedings of LICS 2010, pages 120-129. IEEE Computer Society Press, 2010.
7. D. Caucal. On infinite terms having a decidable monadic theory. In Proceedings of MFCS 2002, volume 2420 of Lecture Notes in Computer Science, pages 165-176. SpringerVerlag, 2002.
8. B. Cook, A. Gotsman, A. Podelski, A. Rybalchenko, and M. Y. Vardi. Proving that programs eventually do something good. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL), pages 265-276. ACM Press, 2007.
9. B. Coucelle. Handbook of Theoretical Computer Science, Volume B, chapter Recursive Applicative Program Schemes, pages 459-492. The MIT Press, 1990.
10. B. Courcelle and M. Nivat. The algebraic semantics of recursive program schemes. In Proceedings of MFCS 1978, volume 64 of Lecture Notes in Computer Science, pages 16-30, 1978.
11. W. Dam. The IO- and OI-hierarchies. Theoretical Computer Science, 20:95-207, 1982.
12. W. Damm. Higher type program schemes and their tree languages. In Theoretical Computer Science, 3rd GI-Conference, volume 48 of Lecture Notes in Computer Science, pages 51-72, 1977.
13. J. de Miranda. Structures generated by Higher-Order Grammars and the Safety Constraint. PhD thesis, University of Oxford, 2006.
14. J. Engelfriet. Simple Program Schemes and Formal Languages, volume 20 of Lecture Notes in Computer Science. Springer-Verlag, 1974.
15. D. R. Ghica and A. Smith. Verifying higher-order programs with pattern-matching algebraic data types. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL), pages 587-598, 2011.
16. M. Hague, A. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In Proceedings of 23rd Annual IEEE Symposium on Logic in Computer Science, pages 452-461. IEEE Computer Society, 2008.
17. M. Hague and A. W. To. The complexity of model checking (collapsible) higher-order pushdown systems. In Proceedings of FSTTCS 2010, pages 228-239, 2010.
18. A. Igarashi and N. Kobayashi. Resource usage analysis. ACM Transactions on Programming Languages and Systems, 27(2):264-313, 2005. (Pubitemid 41655742)
19. T. Knapik, D. Niwinski, and P. Urzyczyn. Deciding monadic theories of hyperalgebraic trees. In TLCA 2001, volume 2044 of Lecture Notes in Computer Science, pages 253-267. Springer-Verlag, 2001. (Pubitemid 33275732)
20. 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. SpringerVerlag, 2002.
21. T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 1450-1461. Springer-Verlag, 2005. (Pubitemid 41439649)
22. N. Kobayashi. Model-checking higher-order functions. In Proceedings of PPDP 2009, pages 25-36. ACM Press, 2009. See also [25].
23. N. Kobayashi. TRECS: A type-based model checker for recursion schemes. http://www.kb.ecei.tohoku.ac.jp/~koba/trecs/, 2009.
24. N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL), pages 416-428, 2009. See also [25].
25. N. Kobayashi. Model checking higher-order programs. Available at http://www.kb.ecei.tohoku.ac.jp/\~{}koba/papers/hmc.pdf. A revised and extended version of [24] and [22], 2010.
26. 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-Verlag, 2011.
27. N. Kobayashi and C.-H. L. Ong. Complexity of model checking recursion schemes for fragments of the modal mucalculus. In Proceedings of ICALP 2009, volume 5556 of Lecture Notes in Computer Science, pages 223-234. Springer-Verlag, 2009.
28. 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 Press, 2009.
29. N. Kobayashi, R. Sato, and H. Unno. MOCHI: A model checker for higher-order programs. http://www.kb.ecei.tohoku.ac.jp/~ryosuke/cegar/, 2011.
30. N. Kobayashi, R. Sato, and H. Unno. Predicate abstraction and cegar for higher-order model checking. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2011.
31. N. Kobayashi, N. Tabuchi, and H. Unno. Higher-order multiparameter tree transducers and recursion schemes for program verification. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL), pages 495-508, 2010.
32. M. M. Lester, R. P. Neatherway, C.-H. L. Ong, and S. J. Ramsay. Model checking liveness properties of higher-order functional programs. Unpublished manuscript, 2010.
33. J. Midtgaard and D. V. Horn. Subcubic control flow analysis algorithms. Higher-Order and Symbolic Computation.
34. C. Mossin. Exact flow analysis. Mathematical Structures in Computer Science, 13(1):125-156, 2003. (Pubitemid 36256729)
35. M. Nivat. On the interpretation of recursive program schemes. In Symposia Mathematica, pages 255-281, 1975.
36. C.-H. L. Ong. On model-checking trees generated by higherorder recursion schemes. In LICS 2006, pages 81-90. IEEE Computer Society Press, 2006. (Pubitemid 47130354)
37. C.-H. L. Ong. Logics and Languages for Reliability and Security, chapter Models of Higher-Order Computation: Recursive Schemes and Collapsible Pushdown Automata, pages 263-299. IOS Press, 2010.
38. C.-H. L. Ong and S. Ramsay. Verifying higher-order programs with pattern-matching algebraic data types. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL), pages 587-598, 2011.
39. P. Parys. Collapse operation increases expressive power of deterministic higher order pushdown automata. In Proceedings of STACS 2011, 2011.
40. O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie-Mellon University, May 1991.
41. T. Tsukada and N. Kobayashi. Untyped recursion schemes and infinite intersection types. In Proceedings of FOSSACS 2010, volume 6014 of Lecture Notes in Computer Science, pages 343-357. Springer-Verlag, 2010.
42. R. Turner. An infinite hierarchy of term languages - an approach to mathematical complexity. In Proceedings of ICALP, pages 593-608, 1972.
43. H. Unno, N. Tabuchi, and N. Kobayashi. Verification of tree-processing programs via higher-order model checking. In Proceedings of APLAS 2010, volume 6461 of Lecture Notes in Computer Science, pages 312-327. Springer-Verlag, 2010.
44. D. Vardoulakis and O. Shivers. Cfa2: A context-free approach to control-flow analysis. In Proceedings of ESOP 2010, volume 6012 of Lecture Notes in Computer Science, pages 570-589. Springer-Verlag, 2010.
45. M. Wand. An algebraic formulation of the chomsky hierarchy. In Category Theory Applied to Computation and Control, volume 25 of Lecture Notes in Computer Science, pages 209-213. Springer-Verlag, 1974.