Nested hoare triples and frame rules for higher-order store

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

Volumn 5771 LNCS, Issue , 2009, Pages 440-454

  Schwinghammer, Jan ^a   Birkedal, Lars ^b   Reus, Bernhard ^c   Yang, Hongseok ^d  

^a SAARLAND UNIVERSITY   (Germany)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

^c UNIVERSITY OF SUSSEX   (United Kingdom)

^d QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

HIGHER ORDER; HIGHER-ORDER FRAME RULES; KRIPKE MODEL; RECURSIONS; SEPARATION LOGIC; ULTRAMETRIC SPACE;

COMPUTER SCIENCE; CRYSTAL LATTICES; DATA STRUCTURES; FORMAL LOGIC;

HIGH LEVEL LANGUAGES;

EID: 70350417641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04027-6_32     Document Type: Conference Paper

References (15)

1. America, P., Rutten, J.J.M.M.: Solving reflexive domain equations in a category of complete metric spaces. J. Comput. Syst. Sci. 39(3), 343-375 (1989)
2. Birkedal, L., Reus, B., Schwinghammer, J., Yang, H.: A simple model of separation logic for higher-order store. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 348-360. Springer, Heidelberg (2008)
3. Birkedal, L., Støvring, K., Thamsborg, J.: Realizability semantics of parametric polymorphism, general references, and recursive types. In: FOSSACS 2009. LNCS, vol. 5504, pp. 456-470. Springer, Heidelberg (2009)
4. Birkedal, L., Torp-Smith, N., Yang, H.: Semantics of separation-logic typing and higher-order frame rules for Algol-like languages. Log. Methods Comput. Sci. 2(5:1) (2006)
5. Honda, K., Yoshida, N., Berger, M.: An observationally complete program logic for imperative higher-order functions. In: LICS, pp. 270-279. IEEE Computer Society Press, Los Alamitos (2005)
6. Krishnaswami, N., Birkedal, L., Aldrich, J., Reynolds, J.: Idealized ML and Its Separation Logic (2007), http://www.cs.cmu.edu/~neelk/
7. Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P., Birkedal, L.: Ynot: dependent types for imperative programs. In: ICFP, pp. 229-240. ACM Press, New York (2008)
8. O'Hearn, P.W., Pym, D.J.: The logic of bunched implications. B. Symb. Log. 5(2), 215-244 (1999)
9. Parkinson, M., Biermann, G.: Separation logic, abstraction and inheritance. In: POPL, pp. 75-86. ACM Press, New York (2008)
10. Pitts, A.M.: Relational properties of domains. Inf. Comput. 127, 66-90 (1996)
11. Pottier, F.: Hiding local state in direct style: a higher-order anti-frame rule. In: LICS, pp. 331-340. IEEE Computer Society Press, Los Alamitos (2008)
12. Reus, B., Schwinghammer, J.: Separation logic for higher-order store. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 575-590. Springer, Heidelberg (2006)
13. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS, pp. 55-74. IEEE Computer Society Press, Los Alamitos (2002)
14. Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11(4), 761-783 (1982)
15. Streicher, T.: Domain-theoretic Foundations of Functional Programming. World Scientific, Singapore (2006)