A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6604 LNCS, Issue , 2011, Pages 260-274

  Kobayashi, Naoki ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA MODELS; CONSTANT FACTORS; FIXED-POINT COMPUTATION; HIGHER ORDER; LINEAR-TIME ALGORITHMS; PRACTICAL MODEL; PROGRAM VERIFICATION; RECURSION SCHEMES; TIME COMPLEXITY;

ALGORITHMS; AUTOMATA THEORY; MATHEMATICAL MODELS;

MODEL CHECKING;

EID: 79953195556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19805-2_18     Document Type: Conference Paper

References (22)

1. Abramsky, S., McCusker, G.: Game semantics. In: Computational Logic: Proceedings of the 1997 Marktoberdorf Summer School, pp. 1-56. Springer, Heidelberg (1999)
2. Aehlig, K.: A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science 3(3) (2007)
3. Ball, T., Rajamani, S.K.: The SLAM project: Debugging system software via static analysis. In: Proc. of POPL, pp. 1-3 (2002)
4. Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker Blast. International Journal on Software Tools for Technology Transfer 9(5-6), 505-525 (2007)
5. Carlier, S., Polakow, J.,Wells, J.B., Kfoury, A.J.: System E: Expansion variables for flexible typing with linear and non-linear types and intersection types. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 294-309. Springer, Heidelberg (2004)
6. Hague, M., Murawski, A., Ong, C.-H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: Proceedings of 23rd Annual IEEE Symposium on Logic in Computer Science, pp. 452-461. IEEE Computer Society, Los Alamitos (2008)
7. Kfoury, A.J., Wells, J.B.: Principality and type inference for intersection types using expansion variables. Theor. Comput. Sci. 311(1-3), 1-70 (2004)
8. Knapik, T., Niwinski, D., Urzyczyn, P.: Deciding monadic theories of hyperalgebraic trees. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 253-267. Springer, Heidelberg (2001)
9. Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 205-222. Springer, Heidelberg (2002)
10. Kobayashi, N.: Model-checking higher-order functions. In: Proceedings of PPDP 2009, pp. 25-36. ACM Press, New York (2009), see also [13]
11. Kobayashi, N.: TRecS (2009), http://www.kb.ecei.tohoku.ac.jp/~koba/trecs/
12. Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Proc. of POPL, pp. 416-428 (2009), see also [13]
13. Kobayashi, N.: Model checking higher-order programs. A revised and extended version of [12] and [10], available from the author's web page (2010)
14. Kobayashi, N.: A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes (2010), an extended version http://www.kb.ecei.tohoku.ac.jp/~koba/gtrecs/
15. Kobayashi, N., Ong, C.-H.L.: Complexity of model checking recursion schemes for fragments of the modal mu-calculus. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 223-234. Springer, Heidelberg (2009)
16. Kobayashi, N., Ong, C.-H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: Proceedings of LICS 2009, pp. 179-188. IEEE Computer Society Press, Los Alamitos (2009)
17. Kobayashi, N., Sato, R., Unno, H.: Predicate abstraction and cegar for higher-order model checking (July 2010) (unpublished manuscript)
18. Kobayashi, N., Tabuchi, N., Unno, H.: Higher-order multi-parameter tree transducers and recursion schemes for program verification. In: Proc. of POPL, pp. 495-508 (2010)
19. Lester, M.M., Neatherway, R.P., Ong, C.-H.L., Ramsay, S.J.: Model checking liveness properties of higher-order functional programs (2010) (unpublished manuscript)
20. Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS 2006, pp. 81-90. IEEE Computer Society Press, Los Alamitos (2006)
21. Ong, C.-H.L., Ramsay, S.: Verifying higher-order programs with pattern-matching algebraic data types. In: Proceedings of POPL 2011 (to appear, 2011)
22. Rehof, J., Mogensen, T.: Tractable constraints in finite semilattices. Science of Computer Programming 35(2), 191-221 (1999)