Liquid types

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 159-169

  Rondon, Patrick M ^a   Kawaguchi, Ming ^a   Jhala, Ranjit ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Dependent types; Hindley milner; Predicate abstraction; Type inference

Indexed keywords

CRITICAL PROPERTIES; DEPENDENT TYPES; FIXED SETS; HINDLEY-MILNER; MANUAL ANNOTATIONS; PREDICATE ABSTRACTION; PREDICATE ABSTRACTIONS; SAFETY PROPERTIES; STATIC VERIFICATIONS; TIME CHECKS; TYPE INFERENCE; TYPE INFERENCES;

ABSTRACTING; C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; COMPUTERS; LINGUISTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 57349128412     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375602     Document Type: Conference Paper

References (29)

1. Tilak Agerwala and Jayadev Misra. Assertion graphs for verifying and synthesizing programs. Technical Report 83, University of Texas, Austin, 1978.
2. L. Augustsson. Cayenne - a language with dependent types. In ICFP 1998.
3. T. Ball and S.K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL, pages 1-3. ACM, 2002.
4. S. Chaki, E. M. Clarke, A. Groce, J. Ouaknine, O. Strichman, and K. Yorav. Efficient verification of sequential and concurrent c programs. FMSD, 25(2-3): 129-166, 2004.
5. B. Chin, S. Markstrum, T. D. Millstein, and J. Palsberg. Inference of user-defined type qualifiers and qualifier rules. In ESOP, pages 264-278, 2006.
6. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV, LNCS 1855, pages 154-169. Springer, 2000.
7. L. Damas and R. Milner. Principal type-schemes for functional programs. In POPL, 1982.
8. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
9. B. Dutertre and L. De Moura. Yices SMT solver. http://yices.csl.sri.com/.
10. C. Flanagan. Hybrid type checking. In POPL. ACM, 2006.
11. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In POPL. ACM, 2002.
12. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In PLDI, 1993.
13. J.S. Foster. Type Qualifiers: Lightweight Specifications to Improve Software Quality. PhD thesis, U.C. Berkeley, 2002.
14. T. Freeman and F. Pfenning. Refinement types for ML. In PLDI, 1991.
15. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV, LNCS 1254, pages 72-83. Springer, 1997.
16. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. McMillan. Abstractions from proofs. In POPL 04. ACM, 2004.
17. F. Ivancic, I. Shlyakhter, A. Gupta, and M. K. Ganai. Model checking c programs using f-soft. In ICCD, pages 297-308, 2005.
18. K. Knowles and C. Flanagan. Type reconstruction for general refinement types. In ESOP, 2007.
19. P. Lincoln and J. C. Mitchell. Algorithmic aspects of type inference with subtypes. In POPL, Albequerque, New Mexico, 1992.
20. P. Martin-Lof. Constructive mathematics and computer programming. Royal Society of London Philosophical Transactions Series A, 312:501-518, October 1984.
21. G. Nelson. Techniques for program verification. Technical Report CSL81-10, Xerox Palo Alto Research Center, 1981.
22. X. Ou, G. Tan, Y. Mandelbaum, and D. Walker. Dynamic typing with dependent types. In IFIP TCS, pages 437-450, 2004.
23. F. Pottier. Simplifying subtyping constraints. In ICFP, New York, NY, USA, 1996. ACM Press.
24. P. Rondon, M. Kawaguchi. and R. Jhala. Liquid types. Technical Report CSE Tech Report, UCSD, 2008.
25. M. Sulzmann, M. Odersky, and M. Wehr. Type inference with constrained types. In FOOL, 1997.
26. H. Xi. DML code examples. http://www.cs.bu.edu/fac/hwxi/DML/.
27. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In PLDI, 1998.
28. H. Xi and F. Pfenning. Dependent types in practical programming. In POPL, pages 214-227, 1999.
29. Y. Xie and A. Aiken. Scalable error detection using Boolean satisfiability. In POPL, pages 351-363, 2005.