Automating relatively complete verification of higher-order functional programs

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

Volumn , Issue , 2013, Pages 75-86

  Unno, Hiroshi ^a   Terauchi, Tachio ^b   Kobayashi, Naoki ^c  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b NAGOYA UNIVERSITY   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

higher order programs; relative completeness; software model checking; type inference

Indexed keywords

AUTOMATED APPROACH; FIRST ORDER LOGIC; FUNCTIONAL PROGRAMS; HIGHER-ORDER; HIGHER-ORDER PROGRAMS; HOARE LOGIC; PROCEDURAL LANGUAGES; PROGRAM LOGIC; REACHABILITY; RELATIVE COMPLETENESS; SOFTWARE MODEL CHECKING; TYPE INFERENCES; TYPE SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES; MODEL CHECKING;

AUTOMATION;

EID: 84874181407     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2429069.2429081     Document Type: Conference Paper

References (30)

1. L. Augustsson. Cayenne - a language with dependent types. In ICFP, pages 239-250, 1998.
2. C. Barrett and C. Tinelli. CVC3. In CAV, pages 298-302, 2007.
3. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV, pages 154-169, 2000.
4. M. Colón, S. Sankaranarayanan, and H. Sipma. Linear invariant generation using non-linear constraint solving. In CAV, pages 420-432, 2003.
5. W. Damm and B. Josko. A sound and relatively* complete Hoarelogic for a language with higher type procedures. Acta Inf., 20:59-101, 1983. (Pubitemid 14471696)
6. S. M. German, E. M. Clarke, and J. Y. Halpern. Reasoning about procedures as parameters. In Logic of Programs, pages 206-220, 1983.
7. S. M. German, E. M. Clarke, and J. Y. Halpern. Reasoning about procedures as parameters in the language L4. Inf. Comput., 83(3):265-359, 1989.
8. A. Goerdt. A Hoare calculus for functions defined by recursion on higher types. In Logic of Programs, pages 106-117, 1985.
9. S. Gulwani, S. Srivastava, and R. Venkatesan. Program analysis as constraint solving. In PLDI, pages 281-292, 2008.
10. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10):576-580, 1969.
11. K. Honda, M. Berger, and N. Yoshida. Descriptive and relative completeness of logics for higher-order functions. In ICALP (2), pages 360-371, 2006.
12. R. Jhala and R. Majumdar. Software model checking. ACM Comput. Surv., 41(4), 2009.
13. R. Jhala, R. Majumdar, and A. Rybalchenko. HMC: Verifying functional programs using abstract interpreters. In CAV, pages 470-485, 2011.
14. R. Jhala and K. L. McMillan. A practical and complete approach to predicate refinement. In TACAS, pages 459-473, 2006.
15. T. Johnsson. Lambda lifting: Transforming programs to recursive equations. In FPCA, pages 190-203, 1985.
16. N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In POPL, pages 416-428, 2009.
17. N. Kobayashi and C.-H. L. Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In LICS, pages 179-188, 2009.
18. N. Kobayashi, R. Sato, and H. Unno. Predicate abstraction and CEGAR for higher-order model checking. In PLDI, pages 222-233, 2011.
19. U. D. Lago and M. Gaboardi. Linear dependent types and relative completeness. In LICS, pages 133-142, 2011.
20. J. Liu, N. Zhan, and H. Zhao. Computing semi-algebraic invariants for polynomial dynamical systems. In EMSOFT, pages 97-106, 2011.
21. E.-R. Olderog. Correctness of programs with Pascal-like procedures without global variables. Theor. Comput. Sci., 30:49-90, 1984.
22. B. Reus and T. Streicher. Relative completeness for logics of functional programs. In CSL, pages 470-480, 2011.
23. P. M. Rondon, M. Kawaguchi, and R. Jhala. Liquid types. In PLDI, pages 159-169, 2008.
24. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Constraint-based linear-relations analysis. In SAS, pages 53-68, 2004.
25. S. Srivastava, S. Gulwani, and J. S. Foster. From program verification to program synthesis. In POPL, pages 313-326, 2010.
26. T. Terauchi. Dependent types from counterexamples. In POPL, pages 119-130, 2010.
27. H. Unno and N. Kobayashi. Dependent type inference with interpolants. In PPDP, pages 277-288, 2009.
28. H. Unno, T. Terauchi, and N. Kobayashi. Automating relatively complete verification of higher-order functional programs, 2012. http://www.kb.is.s.u- tokyo.ac.jp/∼uhiro/relcomp.
29. A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Inf. Comput., 115(1):38-94, 1994.
30. H. Xi and F. Pfenning. Dependent types in practical programming. In POPL, pages 214-227, 1999.