Abstract predicates and mutable ADTs in hoare type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4421 LNCS, Issue , 2007, Pages 189-204

  Nanevski, Aleksandar ^a   Ahmed, Amal ^b   Morrisett, Greg ^a   Birkedal, Lars ^c  

^a HARVARD UNIVERSITY   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER RESOURCE MANAGEMENT; DATA STRUCTURES; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; STORAGE ALLOCATION (COMPUTER);

DATA TYPES; HOARE TYPE THEORY (HTT); MEMORY MANAGER;

HIGH LEVEL LANGUAGES;

EID: 34548105576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_14     Document Type: Conference Paper

References (32)

1. M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. In CASSIS 2004. LNCS. Springer, 2004.
2. M. Barnett and D. Naumann. Friends need a bit more: Maintaining invariants over shared state. In Mathematics of Program Construction, LNCS 3125, 2004.
3. N. Benton. Abstracting Allocation: The New new Thing. In CSL'06.
4. M. Berger, K. Honda, and N. Yoshida. A logical analysis of aliasing in imperative higher-order functions. In ICFP'05, pages 280-293.
5. B. Biering, L. Birkedal, and N. Torp-Smith. BI hyperdoctrines, Higher-Order Separation Logic, and Abstraction. ITU-TR-2005-69, IT University, Copenhagen.
6. L. Burdy, Y. Cheon, D. Cok, M. Ernst, J. Kiniry, G. T. Leavens, K. R. M. Leino, and E. Poll. An overview of JML tools and applications. International Journal on Software Tools for Technology Transfer, 7(3):212-232, June 2005.
7. R. DeLine and M. Fahndrich. Enforcing high-level protocols in low-level software. In PLDI'01, pages 59-69, 2001.
8. D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Compaq Systems Research Center, Research Report 159, December 1998.
9. D. Evans and D. Larochelle. Improving security using extensible lightweight static analysis. IEEE Software, 19(1):42-51, 2002.
10. J.-C. Filliâtre. Verification of non-functional programs using interpretations in type theory. Journal of Functional Programming, 13(4):709-745, July 2003.
11. J. Harrison. Inductive definitions: automation and application. In Higher Order Logic Theorem Proving and Its Applications, LNCS 971, Springer, 1995.
12. T. Jim, G. Morrisett, D. Grossman, M. Hicks, J. Cheney, and Y. Wang. Cyclone: A safe dialect of C. USENIX Annual Technical Conference, 2002.
13. N. Krishnaswami. Separation logic for a higher-order typed language. SPACE'06.
14. Z. Luo. An Extended Calculus of Constructions. PhD thesis, U of Edinburgh, 1990.
15. Y. Mandelbaum, D. Walker, and R. Harper. An effective theory of type refinements. In ICFP'03, pages 213-226.
16. The Coq development team. The Coq proof assistant reference manual. LogiCal Project, 2004. Version 8.0.
17. C. McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
18. J. C. Mitchell. Foundations for Programming Languages. MIT Press, 1996.
19. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
20. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. TOPLAS, 21(3):527-568, 1999.
21. A. Nanevski, A. Ahmed, G. Morrisett, and L. Birkedal. Abstract predicates and mutable ADTs in Hoare Type Theory. TR-14-06, Harvard University. Available at http://www.eecs.harvard.edu/~aleks/papers/hoarelogic/htthol.pdf.
22. A. Nanevski, G. Morrisett, and L. Birkedal. Polymorphism and separation in Hoare Type Theory. In ICFP'06, pages 62-73.
23. Z. Ni and Z. Shao. Certified assembly programming with embedded code pointers. In POPL'06, pages 320-333.
24. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In POPL'04, pages 268-280.
25. B. C. Pierce and D. N. Turner. Local type inference. TOPLAS, 22(1):1-44, 2000.
26. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS'02, pages 55-74.
27. Z. Shao, V. Trifonov, B. Saha, and N. Papaspyrou. A type system for certified binaries. TOPLAS, 27(1):l-45, January 2005.
28. K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. A concurrent logical framework: The propositional fragment. LNCS 3085, Springer 2004.
29. H. Xi. Applied Type System (extended abstract). LNCS 3085, 2004.
30. H. Xi and F. Pfenning. Dependent types in practical programming. POPL'99.
31. N. Yoshida, K. Honda, and M. Berger. Logical reasoning for higher-order functions with local state. Personal communication, August 2006.
32. D. Zhu and H. Xi. Safe programming with pointers through stateful views. In PADL'05, pages 83-97.