Verifying higher-order functional programs with pattern-matching algebraic data types

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 587-598

  Ong, C H Luke ^a   Ramsay, Steven J ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Languages; Verification

Indexed keywords

ALGEBRAIC DATA-TYPES; CORRECTNESS PROPERTIES; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; FIRST-ORDER; FUNCTIONAL PROGRAMS; HIGHER ORDER; INPUT SET; LANGUAGES; MATCHING RULES; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; MODEL OF COMPUTATION; NATURAL EXTENSION; RECURSION SCHEMES; REGULAR TREE; VERIFICATION PROBLEMS;

ABSTRACTING; ALGEBRA; ALGORITHMS; PROBLEM ORIENTED LANGUAGES; TREES (MATHEMATICS);

MODEL CHECKING;

EID: 79952026046     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1926385.1926453     Document Type: Conference Paper

References (17)

1. W. Blum and C.-H. L. Ong. Path-correspondence theorems and their applications. Preprint, 2009.
2. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV '00: Proceedings of the 12th International Conference on Computer Aided Verification, pages 154-169, London, UK, 2000. Springer-Verlag.
3. A. Igarashi and N. Kobayashi. Resource usage analysis. ACM Trans. Program. Lang. Syst., 27(2):264-313, 2005. (Pubitemid 41655742)
4. N. D. Jones. Flow analysis of lambda expressions (preliminary version). In Proceedings of the 8th Colloquium on Automata, Languages and Programming, pages 114-128. Springer-Verlag, 1981. ISBN 3- 540-10843-2.
5. N. D. Jones and N. Andersen. Flow analysis of lazy higher-order functional programs. Theoretical Computer Science, 375:120-136, 2007. (Pubitemid 46528648)
6. N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proceedings of POPL 2009, pages 416-428. ACM Press, 2009.
7. N. Kobayashi. Model-checking higher-order functions. In PPDP, pages 25-36, 2009.
8. N. Kobayashi and C.-H. L. Ong. A type theory equivalent to the modal mu-calculus model checking ofhigher-order recursion schemes. In Proceedings of LICS 2009. IEEE Computer Society, 2009.
9. N. Kobayashi, N. Tabuchi, and H. Unno. Higher-order multiparameter tree transducers and recursion schemes for program verification. In POPL, pages 495-508, 2010.
10. J. Kochems. Approximating reachable terms of functional programs. University of Oxford MMathsCompSc thesis, 2010.
11. R. P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton University Press, 1994.
12. J. Midtgaard. Control-flow analysis of functional programs. Technical Report BRICS RS-07-18, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, Dec 2007. URL http://www.brics.dk/RS/07/18/BRICS-RS-07- 18.pdf.
13. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag New York, 1999.
14. C.-H. L. Ong. On model-checking trees generated by higherorder recursion schemes. In Proceedings 21st Annual IEEE Symposium on Logic in Computer Science, Seattle, pages 81-90. Computer Society Press, 2006. Long version (55 pp.) downloadable at users.comlab.ox.ac.uk/luke.ong/. (Pubitemid 47130354)
15. C.-H. L. Ong and S. J. Ramsay. Verifying higherorder functional programs with pattern-matching algebraic data types. Long version, available from: https://mjolnir.comlab.ox.ac.uk/papers/pmrs.pdf.
16. C.-H. L. Ong and N. Tzevelekos. Functional reachability. In LICS, pages 286-295, 2009.
17. O. Shivers. Control-flow analysis of higher-order languages. PhD thesis, Carnegie-Mellon University, 1991.