C-SHORe: A collapsible approach to verifying higher-order programs

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2013, Pages 13-24

  Broadbent, Christopher ^a,b,c,d   Carayol, Arnaud ^b,d,e   Hague, Matthew ^a,e,f   Serre, Olivier ^a,b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b CNRS   (France)

^c National Institute of Informatics   (Japan)

^d TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^e UNIVERSITÉ PARIS EST   (France)

^f UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Collapsible pushdown systems; Higher order; Model checking; Recursion schemes; Verification

Indexed keywords

HIGHER-ORDER; HIGHER-ORDER PROGRAMS; MODEL-CHECKING ALGORITHMS; PUSHDOWN SYSTEMS; REACHABILITY ANALYSIS; RECURSION SCHEMES; SATURATION ALGORITHMS; VERIFICATION TECHNIQUES;

ALGORITHMS; AUTOMATA THEORY; C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; MODEL CHECKING; TOOLS; VERIFICATION;

FUNCTIONAL PROGRAMMING;

EID: 84887154132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2500365.2500589     Document Type: Conference Paper

References (40)

1. M. F. Atig. Global model checking of ordered multi-pushdown systems. In FSTTCS, 2010.
2. T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In POPL, 2002.
3. M. Benois. Parties rationnelles du groupe libre. Comptes-Rendus de l'Acamdémie des Sciences de Paris, Série A, 269: 1188-1190, 1969.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In CONCUR, 1997.
5. A. Bouajjani and A. Meyer. Symbolic Reachability Analysis of Higher-Order Context-Free Processes. In FSTTCS, 2004.
6. C. H. Broadbent, A. Carayol, C.-H. L. Ong, and O. Serre. Recursion schemes and logical reflection. In LICS, 2010.
7. C. H. Broadbent, A. Carayol, M. Hague, and O. Serre. A saturation method for collapsible pushdown systems. In ICALP, 2012.
8. T. Cachat. Games on Pushdown Graphs and Extensions. PhD thesis, RWTH Aachen, 2003.
9. T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In ICALP, 2003.
10. A. Carayol and O. Serre. Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selection. In LICS, 2012.
11. A. Carayol, M. Hague, A. Meyer, C.-H. L. Ong, and O. Serre. Winning Regions of Higher-Order Pushdown Games. In LICS, 2008.
12. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In CAV, 2000.
13. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In INFINITY, 1997.
14. M. Hague and C.-H. L. Ong. Symbolic backwards-reachability analysis for higher-order pushdown systems. Logical Methods in Computer Science, 4(4), 2008.
15. M. Hague and C.-H. L. Ong. Analysing mu-calculus properties of pushdown systems. In SPIN, 2010.
16. M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In LICS, 2008.
17. D. Hopkins and C.-H. L. Ong. Homer: A higher-order observational equivalence model checker. In CAV, 2009.
18. D. Hopkins, A. S. Murawski, and C.-H. L. Ong. Hector: An equivalence checker for a higher-order fragment of ml. In CAV, 2012.
19. R. Jhala, R. Majumdar, and A. Rybalchenko. Hmc: Verifying functional programs using abstract interpreters. In CAV, 2011.
20. N. D. Jones and S. S. Muchnick. Even simple programs are hard to analyze. J. ACM, 24: 338-350, April 1977.
21. T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In ICALP, 2005.
22. N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In POPL, 2009.
23. N. Kobayashi. Model-checking higher-order functions. In PPDP, 2009.
24. N. Kobayashi. Higher-order model checking: From theory to practice. In LICS, 2011.
25. N. Kobayashi. A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes. In FOSSACS, 2011.
26. N. 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.
27. N. Kobayashi, R. Sato, and H. Unno. Predicate abstraction and cegar for higher-order model checking. In PLDI, 2011.
28. R. P. Neatherway, S. J. Ramsay, and C.-H. L. Ong. A traversal-based algorithm for higher-order model checking. In ICFP, 2012.
29. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In LICS, 2006.
30. C.-H. L. Ong and S. J. Ramsay. Verifying higher-order functional programs with pattern-matching algebraic data types. In POPL, 2011.
31. T. W. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program., 58(1-2): 206-263, 2005.
32. S. Salvati and I. Walukiewicz. Recursive schemes, krivine machines, and collapsible pushdown automata. In RP, 2012.
33. S. Schwoon. Model-checking Pushdown Systems. PhD thesis, Technical University of Munich, 2002.
34. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis, chapter 7, pages 189-234. Prentice-Hall, 1981.
35. O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie-Mellon University, 1991.
36. D. Suwimonteerabuth, S. Schwoon, and J. Esparza. Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains. In ATVA, 2006.
37. D. Suwimonteerabuth, J. Esparza, and S. Schwoon. Symbolic context-bounded analysis of multithreaded java programs. In SPIN, 2008.
38. H. Unno, N. Tabuchi, and N. Kobayashi. Verification of tree-processing programs via higher-order model checking. In APLAS, 2010.
39. D. Vardoulakis. CFA2: Pushdown-Flow Analysis for Higher-Order Languages. PhD thesis, Northeastern University, Boston, 2012.
40. D. Vardoulakis and O. Shivers. Pushdown flow analysis of first-class control. In ICFP, 2011.