Hoare type theory, polymorphism and separation

Journal of Functional Programming

Volumn 18, Issue 5-6, 2008, Pages 865-911

  Nanevski, Aleksandar ^a   Morrisett, Greg ^a   Birkedal, Lars ^b  

^a HARVARD UNIVERSITY   (United States)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITE PROGRAMS; FUNCTIONAL LANGUAGES; HIGHER-ORDER FUNCTIONS; IMPERATIVE FEATURES; NON TERMINATIONS; PROGRAM COMPONENTS; SEPARATION LOGIC; SMALL FOOTPRINTS;

SPECIFICATIONS;

FORMAL LANGUAGES;

EID: 55249085443     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796808006953     Document Type: Conference Paper

References (73)

1. Abadi, Martin & Leino, K. Rustan M. (2004) A logic of object-oriented programs. In Verification: Theory and Practice. Lecture Notes in Computer Science, Vol. 2772. Springer, Berlin, Germany, pp. 11-41.
2. Ahmed, Amal, Fluet, Matthew & Morrisett, Greg. (2005) A step-indexed model of substructural state. In International Conference on Functional Programming, ICFP'05, ACM Press, New York, pp. 78-91.
3. Altenkirch, Thorsten, Dybjer, Peter, Hofmann, Martin & Scott, Phil. (2001) Normalization by evaluation for typed lambda calculus with coproducts. In Symposium on Logic in Computer Science, LICS'01, IEEE Computer Society Press, Los Alamitos, California, pp. 303-310.
4. Amtoft, Torben, Bandhakavi, Sruthi & Banerjee, Anindya. (2006) A logic for information flow in object-oriented programs. In Symposium on Principles of Programming Languages, POPL'06, ACM Press, New York, pp. 91-102.
5. Augustsson, Lennart. (1998) Cayenne - A language with dependent types. In International Conference on Functional Programming, ICFP'98, ACM Press, New York, pp. 239-250.
6. Barnes, John. (2003) High Integrity Software: The SPARK Approach to Safety and Security. Addison-Wesley, Boston, MA.
7. Barnett, Mike, Leino, K. Rustan M. & Schulte, Wolfram. (2004) The Spec# programming system: An overview. In International Workshop on Construction and Analysis of Safe, Secure and Interoperable Smart Devices, CASSIS'04. Lecture Notes in Computer Science, Vol. 3362. Springer, Berlin, Germany.
8. Berger, Martin, Honda, Kohei & Yoshida, Nobuko. (2005) A logical analysis of aliasing in imperative higher-order functions. In International Conference on Functional Programming, ICFP'05, ACM Press, New York, pp. 280-293.
9. Biering, B., Birkedal, L. & Torp-Smith, N. (July, 2005). BI Hyperdoctrines, Higher-Order Separation Logic, and Abstraction. Technical Report ITU-TR-2005-69. IT University of Copenhagen.
10. Birkedal, Lars, Torp-Smith, Noah & Reynolds, John C. (2004) Local reasoning about a copying garbage collector. In Symposium on Principles of Programming Languages, POPL'04, ACM Press, New York, pp. 220-231.
11. Birkedal, Lars, Torp-Smith, Noah & Yang, Hongseok. (2005) Semantics of separation-logic typing and higher-order frame rules. In Symposium on Logic in Computer Science, LICS'05, IEEE Comp. Soc. Press, Los Alamitos, California, pp. 260-290.
12. Burdy, Lilian, Cheon, Yoonsik, Cok, David, Ernst, Michael, Kiniry, Joe, Leavens, Gary T., Leino, K. Rustan M. & Poll, Erik. (2005) An overview of JML tools and applications. Int. J. Software Tools Technol. Transfer 7(3), 212-232.
13. Cartwright, Robert & Oppen, Derek C. (1978) Unrestricted procedure calls in Hoare's logic. In Symposium on Principles of Programming Languages, POPL'78, ACM Press, NY, pp. 131-140.
14. Chen, Chiyan & Xi, Hongwei. (2005) Combining programming with theorem proving. In International Conference on Functional Programming, ICFP'05, ACM Press, NY, pp. 66-77.
15. Church, Alonzo. (1940) A formulation of the simple theory of types. J. Symbol. Logic 5(2), 56-68.
16. Collinson, Matthew & Pym, David J. (2006) Bunching for regions and locations. Electr. Notes Theor. Comput. Sci. 158, 171-197.
17. Condit, Jeremy, Harren, Matthew, Anderson, Zachary, Gay, David & Necula, George. (2007) Dependent types for low-level programming. In European Symposium on Programming, ESOP'07. Lecture Notes in Computer Science, Vol. 4421. Springer, Berlin, Germany.
18. Cook, Stephen A. (1978) Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7(1), 70-90.
19. Detlefs, David L., Leino, K. Rustan M., Nelson, Greg & Saxe, James B. (December, 1998) Extended Static Checking. Research Report 159, Compaq Systems Research Center.
20. Dijkstra, Edsger W. (1975) Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453-457.
21. Dybjer, Peter. (1994) Inductive families. Formal Aspects Comput. 6(4), 440-465.
22. Dybjer, Peter & Setzer, Anton. (2006) Indexed induction-recursion. J. Logic Algebraic Program. 66(1), 1-49.
23. Evans, David & Larochelle, David. (2002) Improving security using extensible lightweight static analysis. IEEE Software 19(1), 42-51.
24. Feng, Xinyu, Ferreira, Rodrigo & Shao, Zhong. (2007) On the relationship between concurrent separation logic and assume-guarantee reasoning. In European Symposium on Programming, ESOP'07. Lecture Notes in Computer Science, Vol. 4421. Springer, Berlin, Germany, pp. 173-188.
25. Flanagan, Cormac. (2006) Hybrid type checking. In Symposium on Principles of Programming Languages, POPL'06, ACM Press, NY, pp. 245-256.
26. Fluet, Matthew, Morrisett, Greg & Ahmed, Amal. (2006) Linear regions are all you need. In European Symposium on Programming, ESOP'06, Springer, Berlin, Germany, pp. 7-21.
27. Ghani, N. (1995) Beta-eta equality for coproducts. In International Conference on Typed Lambda Calculus and Applications, TLCA'95. Lecture Notes in Computer Science, Vol. 902. Springer, Berlin, Germany, pp. 171-185.
28. Gill, Andrew, Launchbury, John & Peyton Jones, Simon L. (1993) A short cut to deforestation. In International Conference on Functional Programming Languages and Computer Architecture, FPCA'93, ACM Press, NY, pp. 223-232.
29. Girard, Jean-Yves, Lafont, Yves & Taylor, Paul. (1989) Proofs and Types. Cambridge, UK: Cambridge University Press.
30. Greif, I. & Meyer, A. (1979) Specifying programming language semantics: A tutorial and critique of a paper by Hoare and Lauer. In Symposium on Principles of Programming Languages, POPL'79, ACM Press, NY, pp. 180-189.
31. Harris, Tim, Marlow, Simon, Peyton Jones, Simon & Herlihy, Maurice. (2005) Composable memory transactions. In Symposium on Principles and Practice of Parallel Programming, PPoPP'05, ACM Press, NY, pp. 48-60.
32. Hoare, C. A. R. (1969) An axiomatic basis for computer programming. Commun. ACM 12(10), 576-580.
33. Hofmann, Martin. (July, 1995) Extensional Concepts in Intensional Type Theory. Ph.D. Thesis, Department of Computer Science, University of Edinburgh. Technical Report ECS-LFCS-95-327.
34. Honda, Kohei, Yoshida, Nobuko & Berger, Martin. (2005) An observationally complete program logic for imperative higher-order functions. In Symposium on Logic in Computer Science, LICS'05, IEEE Comp. Sci. Press, Los Alamitos, CA, pp. 270-279.
35. Howard, W. A. (1980) The formulae-as-types notion of construction. In Essays on Combinatory Logic, Lambda Calculus and Formalism, Curry, H. B. (ed). Academic Press, New York, pp. 479-490.
36. Jim, Trevor, Morrisett, Greg, Grossman, Dan, Hicks, Michael, Cheney, James & Wang, Yanling. (2002) Cyclone: A safe dialect of C. In USENIX Annual Technical Conference, USENIX'02, Usenix Association, Berkeley, CA, pp. 275-288.
37. Krishnaswami, Neelakantan. (2006) Separation logic for a higher-order typed language. In Workshop on Semantics, Program Analysis and Computing Environments for Memory Management, SPACE'06, Informal Proceedings, pp. 73-82.
38. Leavens, Gary T., Baker, Albert L. & Ruby, Clyde. (1999) JML: A notation for detailed design. In Behavioral Specifications of Businesses and Systems. International Series in Engineering and Computer Science, Vol. 523. Kluwer Academic Publishers, Norwell, MA, pp. 175-188.
39. Leino, K. R. M. & Nelson, G. (2002) Data abstraction and information hiding. ACM Trans. Program. Lang. Syst. 24(5), 491-553.
40. Leino, K. Rustan M., Nelson, Greg & Saxe, James B. (October, 2000) ESC/Java User's Manual. Technical Note 2000-002. Compaq Systems Research Center.
41. Luo, Zhaohui. (1990) An Extended Calculus of Constructions. Ph.D. Thesis, University of Edinburgh. Technical Report ECS-LFCS-90-118.
42. Luo, Zhaohui. (1994) Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, Oxford, UK.
43. Mandelbaum, Yitzhak, Walker, David & Harper, Robert. (2003) An effective theory of type refinements. In International Conference on Functional Programming, ICFP'03, ACM Press, NY, pp. 213-226.
44. Martin-Löf, Per. (1996) On the meanings of the logical constants and the justifications of the logical laws. Nordic J. Philosophic. Logic 1(1), 11-60.
45. McBride, Conor. (1999) Dependently Typed Functional Programs and Their Proofs. Ph.D. Thesis, University of Edinburgh. Technical Report ECS-LFCS-00-419.
46. McBride, Conor & McKinna, James. (2005) The view from the left. J. Funct. Program. 14(1), 69-111.
47. McCarthy, John L. (1962) Towards a mathematical science of computation. In Congress of the International Federation for Information Processing, IFIP'62, Elsevier Amsterdam, Netherlands, pp. 21-28.
48. Moggi, Eugenio. (1989) Computational lambda-calculus and monads. In Symposium on Logic in Computer Science, LICS'89, IEEE Comp. Sci. Press, Los Alamitos, CA, pp. 14-23.
49. Moggi, Eugenio. (1991) Notions of computation and monads. Info. Comput. 93(1), 55-92.
50. Morrisett, Greg, Ahmed, Amal & Fluet, Matthew. (2005) L3: A linear language with locations. In International Conference on Typed Lambda Calculus and Applications, TLCA'05. Lecture Notes in Computer Science, Vol. 3461. Springer, Berlin, Germany, pp. 293-307.
51. Nanevski, Aleksandar, Ahmed, Amal, Morrisett, Greg & Birkedal, Lars. (2007) Abstract predicates and mutable ADTs in Hoare type theory. In European Symposium on Programming, ESOP'07. Lecture Notes in Computer Science, Vol. 4421. Springer, Berlin, Germany, pp. 189-204.
52. Necula, George C. (January, 1997). Proof-carrying code. In Symposium on Principles of Programming Languages, POPL'97, ACM Press, NY, pp. 106-119.
53. O'Donnell, Michael J. (1982) A critique of the foundations of Hoare style programming logics. Commun. ACM 25(12), 927-935.
54. O'Hearn, Peter, Reynolds, John & Yang, Hongseok. (2001) Local reasoning about programs that alter data structures. In International Workshop on Computer Science Logic, CSL'01. Lecture Notes in Computer Science, Vol. 2142. Springer, Berlin, Germany, pp. 1-19.
55. O'Hearn, Peter W., Yang, Hongseok & Reynolds, John C. (2004) Separation and information hiding. In Symposium on Principles of Programming Languages, POPL'04, ACM Press, NY, pp. 268-280.
56. Paulson, Lawrence C. (1990) A formulation of the simple theory of types (for Isabelle). In International Conference in Computer Logic, COLOG'88. Lecture Notes in Computer Science, Vol. 417. Springer, Berlin, Germany, pp. 246-274.
57. Peyton Jones, Simon (ed). (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge, UK: Cambridge University Press.
58. Peyton Jones, Simon L. & Wadler, Philip. (1993) Imperative functional programming. In Symposium on Principles of Programming Languages, POPL'93, ACM Press, NY, pp. 71-84.
59. Pfenning, Frank & Davies, Rowan. (2001) A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11(4), 511-540.
60. Pierce, Benjamin C. & Turner, David N. (2000) Local type inference. ACM Trans. Program. Lang. Syst. 22(1), 1-44.
61. Reus, Bernhard & Schwinghammer, Jan. (2006) Separation logic for higher-order store. In International Workshop on Computer Science Logic, CSL'06, Szeged, Hungary.
62. Reynolds, John C. (2002) Separation logic: A logic for shared mutable data structures. In Symposium on Logic in Computer Science, LICS'02, IEEE Comp. Sci. Press, Los Alamitos, CA, pp. 55-74.
63. Shao, Zhong, Trifonov, Valery, Saha, Bratin & Papaspyrou, Nikolaos. (2005) A type system for certified binaries. ACM Trans. Program. Lang. Syst. 27(1), 1-45.
64. Sheard, Tim. (2004) Languages of the future. In International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA'04, ACM Press, NY, pp. 116-119.
65. Smith, Frederick, Walker, David & Morrisett, Greg. (2000) Alias types. In European Symposium on Programming, ESOP'00. Lecture Notes in Computer Science, Vol. 1782. Springer, Berlin, Germany, pp. 366-381.
66. SRI International & DSTO. (July, 1991) The HOL System: Description. Cambridge, UK: University of Cambridge Computer Laboratory.
67. Tan, Gang & Appel, AndrewW. (2006) A compositional logic for control flow. In International Conference on Verification, Model Checking and Abstract Interpretation, VMCAI'06. Lecture Notes in Computer Science, Vol. 3855. Springer, Berlin, Germany, pp. 80-94.
68. Wadler, Philip. (1998) The marriage of effects and monads. In International Conference on Functional Programming, ICFP'98, ACM Press, NY, pp. 63-74.
69. Watkins, Kevin, Cervesato, Iliano, Pfenning, Frank & Walker, David. (2004) A concurrent logical framework: The propositional fragment. In Types for Proofs and Programs. Lecture Notes in Computer Science, Vol. 3085. Springer, Berlin, Germany, pp. 355-377.
70. Westbrook, Edwin, Stump, Aaron & Wehrman, Ian. (2005) A language-based approach to functionally correct imperative programming. In International Conference on Functional Programming, ICFP'05, ACM Press, NY, pp. 268-279.
71. Xi, Hongwei & Pfenning, Frank. (1998) Eliminating array bound checking through dependent types. In Conference on Programming Language Design and Implementation, PLDI'98, ACM Press, NY, pp. 249-257.
72. Xi, Hongwei & Pfenning, Frank. (1999) Dependent types in practical programming. In Symposium on Principles of Programming Languages, POPL'99, ACM Press, NY, pp. 214-227.
73. Zhu, Dengping & Xi, Hongwei. (2005) Safe programming with pointers through stateful views. In Practical Aspects of Declarative Languages, PADL'05. Lecture Notes in Computer Science, Vol. 3350. Springer, Berlin, Germany, pp. 83-97.