Type-based data structure verification

ACM SIGPLAN Notices

Volumn 44, Issue 6, 2009, Pages 304-315

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Dependent types; Hindley Milner; Predicate abstraction; Type inference

Indexed keywords

ABSTRACTING; TREES (MATHEMATICS);

ABSTRACT INTERPRETATIONS; COMPLEX DATA STRUCTURES; COMPLEX PROPERTIES; DEPENDENT TYPES; HINDLEY-MILNER; PREDICATE ABSTRACTIONS; STATIC VERIFICATION; TYPE INFERENCES;

DATA STRUCTURES;

EID: 67650815244     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1543135.1542510     Document Type: Conference Paper

References (26)

1. A. W. Appel. SSA is functional programming. SIGPLAN Notices, 33(4), 1998.
2. L. Augustsson. Cayenne - a language with dependent types. In ICFP, 1998.
3. B. E. Chang and X. Rival. Relational inductive shape analysis. In POPL, pages 247-260, 2008.
4. S. Cui, K. Donnelly, and H. Xi. Ats: A language that combines programming with theorem proving. In FroCos, 2005.
5. Luca de Alfaro. Vec: Extensible, functional arrays for ocaml. http://www.dealfaro.com/vec.html.
6. L. de Moura and N. Bjørner. Z3: An efficient smt solver. In TACAS, pages 337-340, 2008.
7. Joshua Dunfield. A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA, 2007.
8. J.C. Filliatre. Ocaml software. http://www.lri.fr/filli-atr/software.en. html.
9. C. Flanagan. Hybrid type checking. In POPL. ACM, 2006.
10. S. Gulwani, B. McCloskey, and A. Tiwari. Lifting abstract interpreters to quantified logical domains. In POPL, pages 235-246, 2008.
11. F. Henglein. Type inference with polymorphic recursion. ACM TOPLAS, 15(2):253-289, 1993.
12. R. Jhala and R. Majumdar. Bit-level types for high-level reasoning. In FSE. ACM, 2006.
13. S. K. Lahiri and S. Qadeer. Back to the future: revisiting precise program verification using smt solvers. In POPL, 2008.
14. T. Lev-Ami and S. Sagiv. TVLA: A system for implementing static analyses. In SAS, LNCS 1824, pages 280-301. Springer, 2000.
15. John McCarthy. Towards a mathematical science of computation. In IFIP Congress, pages 21-28, 1962.
16. Alan Mycroft. Polymorphic type schemes and recursive definitions. In Symposium on Programming, pages 217-228, 1984.
17. A. Nanevski, G. Morrisett, A. Shinnar, P. Govereau, and L. Birkedal. Ynot: Reasoning with the awkward squad. In ICFP, 2008.
18. C. Okasaki. Purely Functional Data Structures. CUP, 1999.
19. B. C. Pierce. Types and Programming Languages. MIT Press, 2002.
20. Y. Regis-Gianas and F. Pottier. A Hoare logic for call-by-value functional programs. In MPC, 2008. To appear.
21. P. Rondon, M. Kawaguchi, and R. Jhala. Type based data structure verification. http://pho.ucsd.edu/liquid.
22. P. Rondon, M. Kawaguchi, and R. Jhala. Liquid types. In PLDI, pages 158-169, 2008.
23. H. Xi. DML code examples. http://www.cs.bu.edu/fac/hwxi/DML/.
24. H. Xi and F. Pfenning. Dependent types in practical programming. In POPL, pages 214-227, 1999.
25. H. Yang, J. Berdine, C. Calcagno, B. Cook, D. Distefano, and P. W. O'Hearn. Scalable shape analysis for systems code. In CAV, 2008.
26. K. Zee, V. Kuncak, and M. C. Rinard. Full functional verification of linked data structures. In PLDI, pages 349-361, 2008.