A traversal-based algorithm for higher-order model checking

ACM SIGPLAN Notices

Volumn 47, Issue 9, 2012, Pages 353-364

  Neatherway, Robin P ^a   Ong, C H Luke ^a   Ramsay, Steven J ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Higher order Programs; Model checking

Indexed keywords

ABSTRACT GAMES; ABSTRACT MODELS; ABSTRACTION-REFINEMENT; FINITE-STATE; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; GENERALISATION; HASKELL; INTERSECTION TYPES; MODEL CHECKING PROBLEM; NON-DETERMINISM; PUSHDOWN MODELS; RECURSION SCHEMES; SOFTWARE MODEL CHECKING; TREE LANGUAGES; UNION TYPES;

ALGORITHMS; AUTOMATA THEORY; FORESTRY; JAVA PROGRAMMING LANGUAGE; SEMANTICS;

MODEL CHECKING;

ALGORITHMS; COMPUTER PROGRAMS; MATHEMATICAL MODELS; PROBLEM SOLVING; PROGRAMING LANGUAGES; ROBOTS;

EID: 84870438868     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2398856.2364578     Document Type: Conference Paper

References (19)

1. Klaus Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Comp. Sci., 3(3), 2007.
2. Thomas Ball, Rupak Majumdar, Todd D. Millstein, and Sriram K. Rajamani. Automatic predicate abstraction of C programs. In PLDI, pages 203-213, 2001.
3. Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. The software model checker blast. STTT, 9(5-6):505-525, 2007.
4. Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, and Olivier Serre. Collapsible pushdown automata and recursion schemes. In LICS, pages 452-461, 2008.
5. J. M. E. Hyland and C.-H. Luke Ong. On full abstraction for PCF: I, II, and III. Inf. Comput., 163(2):285-408, 2000.
6. Teodor Knapik, Damian Niwinski, and Pawel Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS, pages 205-222, 2002.
7. Naoki Kobayashi. Model-checking higher-order functions. In PPDP, pages 25-36, 2009.
8. Naoki Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In POPL, pages 416-428, 2009.
9. Naoki Kobayashi. http://www-kb.is.s.u-tokyo.ac.jp/~koba/trecs/. 2009.
10. Naoki Kobayashi. A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes. In FOSSACS, pages 260-274, 2011.
11. Naoki Kobayashi and C.-H. Luke Ong. Complexity of model checking recursion schemes for fragments of the modal mu-calculus. In ICALP (2), pages 223-234, 2009.
12. Naoki Kobayashi and C.-H. Luke Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In LICS, pages 179-188, 2009.
13. Naoki Kobayashi, Naoshi Tabuchi, and Hiroshi Unno. Higher-order multi-parameter tree transducers and recursion schemes for program verification. In POPL, pages 495-508, 2010.
14. Neil Mitchell and Colin Runciman. Not all patterns, but enough - an automatic verifier for partial but sufficient pattern matching. In Haskell '08: Proceedings of the first ACM SIGPLAN symposium on Haskell, pages 49-60. ACM, September 2008.
15. Robin P. Neatherway, C.-H. Luke Ong, and Steven J. Ramsay. A traversal-based algorithm for higher-order model checking. Long version, available from: http://mjolnir.cs.ox. ac.uk/papers/traversal.pdf, 2012.
16. C.-H. Luke Ong. On model-checking trees generated by higherorder recursion schemes. In LICS, pages 81-90, 2006. Long version (55 pp.) http://www.cs.ox.ac.uk/people/luke. ong/personal/publications/ntree.pdf.
17. C.-H. Luke Ong and Steven J. Ramsay. Verifying functional programs with pattern matching algebraic data types. In POPL, pages 587-598, 2011.
18. Jakob Rehof and Torben Æ. Mogensen. Tractable constraints in finite semilattices. Sci. Comput. Program., 35(2):191-221, 1999.
19. Sylvain Salvati and Igor Walukiewicz. Krivine machines and higherorder schemes. In ICALP (2), pages 162-173, 2011.