Saturation-based model checking of higher-order recursion schemes

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 23, Issue , 2013, Pages 129-148

  Broadbent, Christopher ^a   Kobayashi, Naoki ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Higher order recursion schemes; Intersection types; Model checking

Indexed keywords

ITERATIVE METHODS;

HIGHER ORDER MODELING; HIGHER-ORDER PROGRAMS; INTERSECTION TYPES; MODEL CHECKING ALGORITHM; PUSHDOWN SYSTEMS; RECURSION SCHEMES; SATURATION ALGORITHMS; TARGET CONFIGURATIONS;

MODEL CHECKING;

EID: 84893460833     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.CSL.2013.129     Document Type: Conference Paper

References (26)

1. Klaus Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3), 2007.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In International Conference on Concurrency Theory, pages 135-150, 1997.
3. Christopher Broadbent and Naoki Kobayashi. Streamlining collapsible pushdown systems and their model checking, 2013. Draft.
4. Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, and Olivier Serre. A saturation method for collapsible pushdown systems. In Proceedings of ICALP 2012, volume 7392 of LNCS, pages 165-176. Springer-Verlag, 2012.
5. Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, and Olivier Serre. C-SHORe: A collapsible approach to verifying higher-order programs. In Proceedings of ICFP 2013, 2013.
6. Arnaud Carayol and Olivier Serre. Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selection. In Proceedings of LICS 2012, pages 165-174. IEEE, 2012.
7. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY'97), Bologna, Italy, July 11-12, 1997, volume 9 of ENTCS. Elsevier, 1997.
8. Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of LNCS. Springer-Verlag, 2002.
9. Matthew Hague, Andrzej Murawski, C.-H. Luke Ong, and Olivier 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.
10. Teodor Knapik, Damian Niwinski, and Pawel Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS 2002, volume 2303 of LNCS, pages 205-222. Springer-Verlag, 2002.
11. Naoki Kobayashi. Model-checking higher-order functions. In Proceedings of PPDP 2009, pages 25-36. ACM Press, 2009.
12. Naoki Kobayashi. TRecS: A type-based model checker for recursion schemes. http://www-kb.is.s.u-tokyo.ac.jp/~koba/trecs/, 2009.
13. Naoki Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proc. of POPL, pages 416-428, 2009.
14. Naoki Kobayashi. A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes. In Proceedings of FoSSaCS 2011, volume 6604 of LNCS, pages 260-274. Springer-Verlag, 2011.
15. Naoki Kobayashi. GTRecS2: A model checker for recursion schemes based on games and types. A tool available at http://www-kb.is.s.u-tokyo.ac.jp/~koba/gtrecs2/, 2012.
16. Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara, and Kazuya Yaguchi. Functional programs as compressed data. Higher-Order and Symbolic Computation, 2013. To appear. A preliminary version appeared in Proceedings of PEPM12.
17. Naoki Kobayashi and C.-H. Luke 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.
18. Naoki Kobayashi and C.-H. Luke Ong. Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Logical Methods in Computer Science, 7(4), 2011.
19. Naoki Kobayashi, Ryosuke Sato, and Hiroshi Unno. Predicate abstraction and CEGAR for higher-order model checking. In Proc. of PLDI, pages 222-233, 2011.
20. Naoki Kobayashi, Naoshi Tabuchi, and Hiroshi Unno. Higher-order multi-parameter tree transducers and recursion schemes for program verification. In Proc. of POPL, pages 495-508, 2010.
21. Robin P. Neatherway, Steven James Ramsay, and C.-H. Luke Ong. A traversal-based algorithm for higher-order model checking. In ACM SIGPLAN International Conference on Functional Programming (ICFP '12), pages 353-364, 2012.
22. C.-H. Luke Ong. On model-checking trees generated by higher-order recursion schemes. In LICS 2006, pages 81-90. IEEE Computer Society Press, 2006.
23. C.-H. Luke Ong and Steven Ramsay. Verifying higher-order programs with patternmatching algebraic data types. In Proc. of POPL, pages 587-598, 2011.
24. C.-H. Luke Ong and Takeshi Tsukada. Two-level game semantics, intersection types, and recursion schemes. In Proceedings of ICALP 2012, volume 7392 of LNCS, pages 325-336. Springer-Verlag, 2012.
25. Jakob Rehof and Pawel Urzyczyn. Finite combinatory logic with intersection types. In Proceedings of TLCA 2011, volume 6690 of LNCS, pages 169-183. Springer, 2011.
26. Yoshihiro Tobita, Takeshi Tsukada, and Naoki Kobayashi. Exact flow analysis by higherorder model checking. In Proceedings of FLOPS 2012, volume 7294 of LNCS, pages 275-289. Springer, 2012.