Functional reachability

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 286-295

  Ong, C H L ^a   Tzevelekos, N ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CORRESPONDING SOLUTIONS; DECISION PROBLEMS; EMPTINESS PROBLEM; FINITE SET; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; HIGHER ORDER; OPEN PROBLEMS; REACHABILITY; REACHABILITY PROBLEM; RECURSIONS; STIRLING; TREE AUTOMATA;

COMPUTER SCIENCE; SET THEORY; TRANSLATION (LANGUAGES);

COMPUTABILITY AND DECIDABILITY;

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

References (23)

1. T. Ball and S. K. Rajamani. The SLAM Project: Debugging system software via static analysis. In Proc. POPL, 2002.
2. S. Berardi, M. Coppo, F. Damiani, and P. Giannini. Typebased useless-code elimination for functional programs. In Proc. SAIG, 2000.
3. W. Blum. The Safe Lambda Calculus. PhD thesis, University of Oxford, Dec 2008.
4. W. Blum and C.-H. L. Ong. Local computation of- reduction: a concrete presentation of game semantics. 2009. Preprint, downloadable at william.famille-blum.org/research/.
5. R. Cartwright, P.-L. Curien, and M. Felleisen. Fully abstract semantics for observably sequential languages. Information and Computation, 111:297-401, 1994.
6. H. Common, M. Dauchet, R. Gilleron, F. Jacquemard et al. Tree Automata Techniques and Applications. 2007. Draft book.
7. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Temporal-safety proofs for systems code. In Proc. SPIN Workshop, 2003.
8. J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I,II,III.. Info. and Comp., 163:285-408, 2000.
9. N. Kobayashi. Type-based useless-variable elimination. Higher Order Symbolic Computation, 14(2-3):221-260, 2001.
10. N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proc. POPL, 2009.
11. N. Kobayashi and C.-H. L. Ong. Complexity of model checking recursion schemes for fragments of the modal mucalculus. In Proc. ICALP, 2009.
12. N. Kobayashi and C.-H. L. Ong. A type theory equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In Proc. LICS, 2009.
13. R. Loader. Finitary PCF is not decidable. Theoretical Computer Science, 266:342-364, 2001.
14. P. Malacaria and C. Hankin. Generalised flowcharts and games. In Proc. ICALP, 1998.
15. P. Malacaria and C. Hankin. A new approach to control flow analysis. In Proc. Compiler Construction, 1998.
16. J. Midtgaard. Control-flow analysis of functional programs. Tech. Report BRICS RS-07-18, DAIMI, U. of Aarhus, 2007.
17. R. Milner. Fully abstract models of typed lambda-calculus. Theoretical Computer Science, 4:1-22, 1977.
18. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag New York, 1999.
19. C.-H. L. Ong. On model-checking trees generated by higherorder recursion schemes. In Proc. LICS, 2006. Long version downloadable at users.comlab.ox.ac. uk/luke.ong/.
20. G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
21. K. Sieber. Reasoning about sequential functions via logical relations. In Proc. Applic. of Categories in Comp. Sc., 1992.
22. C. Stirling. Dependency tree automata. In Proc. FoSSaCS, 2009.
23. M. Zaionc. On the lambda definable higher-order boolean functionals. Fundamenta Informaticae, 12, 1989.