Dependent types from counterexamples

ACM SIGPLAN Notices

Volumn 45, Issue 1, 2010, Pages 119-130

  Terauchi, Tachio ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Counterexamples; Dependent types; Interpolation; Intersection types; Type inference

Indexed keywords

INTERPOLATION; RECURSIVE FUNCTIONS;

ABSTRACT MODEL-CHECKING; COUNTEREXAMPLES; DEPENDENT TYPES; INTERSECTION TYPES; PROTOTYPE IMPLEMENTATIONS; RECENT RESEARCHES; TYPE INFERENCES; UNINTERPRETED FUNCTION SYMBOLS;

MODEL CHECKING;

EID: 77149134671     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1707801.1706315     Document Type: Conference Paper

References (38)

1. L. Augustsson. Cayenne - a language with dependent types. In ICFP, pages 239-250, 1998.
2. T. Ball, O. Kupferman, and M. Sagiv. Leaping loops in the presence of abstraction. In CAV, pages 491-503, 2007.
3. T. Ball and S. K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL, pages 1-3, 2002.
4. J. Bengtson, K. Bhargavan, C. Fournet, A. D. Gordon, and S. Maffeis. Refinement types for secure implementations. In CSF, pages 17-32, 2008.
5. D. Beyer, D. Zufferey, and R. Majumdar. CSIsat: Interpolation for LA+EUF. In CAV, pages 304-308, 2008.
6. W.-N. Chin and S.-C. Khoo. Calculating sized types. Higher-Order and Symbolic Computation, 14(2-3):261-300, 2001.
7. W.-N. Chin, S.-C. Khoo, and D. N. Xu. Extending sized type with collection analysis. In PEPM, pages 75-84, 2003.
8. A. Cimatti, A. Griggio, and R. Sebastiani. Efficient interpolant generation in satisfiability modulo theories. In TACAS, pages 397-412, 2008.
9. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV, pages 154- 169, 2000.
10. J. Condit, M. Harren, Z. R. Anderson, D. Gay, and G. C. Necula. Dependent types for low-level programming. In ESOP, pages 520- 535, 2007.
11. W. Craig. Linear reasoning. a new form of the Herbrand-Gentzen theorem. J. Symb. Log., 22(3):250-268, 1957.
12. C. Flanagan. Hybrid type checking. In POPL, pages 245-256, 2006.
13. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In PLDI, pages 237-247, 1993.
14. T. Freeman and F. Pfenning. Refinement types for ML. In PLDI, pages 268-277, 1991.
15. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL, pages 232-244, 2004.
16. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL, pages 58-70, 2002.
17. H. Jain, E. M. Clarke, and O. Grumberg. Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations. In CAV, pages 254-267, 2008.
18. R. Jhala and K. L. McMillan. Interpolant-based transition relation approximation. In CAV, pages 39-51, 2005.
19. T. Johnsson. Lambda lifting: Transforming programs to recursive equations. In FPCA, pages 190-203, 1985.
20. D. Kapur, R. Majumdar, and C. G. Zarba. Interpolation for data structures. In SIGSOFT FSE, pages 105-116, 2006.
21. A. J. Kfoury and J. B. Wells. Principality and type inference for intersection types using expansion variables. Theor. Comput. Sci., 311(1-3):1-70, 2004.
22. K. Knowles and C. Flanagan. Compositional reasoning and decidable checking for dependent contract types. In PLPV, pages 27-38, 2009.
23. K. W. Knowles and C. Flanagan. Type reconstruction for general refinement types. In ESOP, pages 505-519, 2007.
24. N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In POPL, pages 416-428, 2009.
25. D. Kroening and G. Weissenbacher. Counterexamples with loops for predicate abstraction. In CAV, pages 152-165, 2006.
26. K. L. McMillan. Interpolation and SAT-based model checking. In CAV, pages 1-13, 2003.
27. K. L. McMillan. An interpolating theorem prover. Theor. Comput. Sci., 345(1):101-121, 2005.
28. K. L. McMillan. Lazy abstraction with interpolants. In CAV, pages 123-136, 2006.
29. P. M. Neergaard and H. G. Mairson. Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In ICFP, pages 138-149, 2004.
30. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In LICS, pages 81-90, 2006.
31. X. Ou, G. Tan, Y. Mandelbaum, and D. Walker. Dynamic typing with dependent types. In IFIP TCS, pages 437-450, 2004.
32. W. Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. In SC, pages 4-13, 1991.
33. P. M. Rondon, M. Kawaguchi, and R. Jhala. Liquid types. In PLDI, pages 159-169, 2008.
34. R. Statman. The typed lambda-calculus is not elementary recursive. Theor. Comput. Sci., 9:73-81, 1979.
35. T. Terauchi. Dependent types from counterexamples, 2009. http://www.kb.ecei.tohoku.ac.jp/~terauchi/.
36. H. Unno and N. Kobayashi. Dependent type inference with interpolants. In PPDP, pages 277-288, 2009.
37. J. B. Wells. The essence of principal typings. In ICALP, pages 913- 925, 2002.
38. H. Xi and F. Pfenning. Dependent types in practical programming. In POPL, pages 214-227, 1999.