A theory of indirection via approximation

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 171-184

  Hobor, Aquinas ^a   Dockins, Robert ^b   Appel, Andrew W ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Indirection theory; Step indexed models

Indexed keywords

AXIOMATIZATION; CONSTRUCT MODELS; GENERAL METHOD; HIGHER ORDER; HIGHER-ORDER FUNCTIONS; INDIRECTION THEORY; MUTEXES; OBJECT REFERENCE; SEMANTIC MODEL; SEPARATION LOGIC; SHARED MEMORIES;

COMPUTER SOFTWARE; LINGUISTICS;

OBJECT ORIENTED PROGRAMMING;

EID: 77950884829     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1706299.1706322     Document Type: Conference Paper

References (39)

1. +09] Amal Ahmed, Andrew W. Appel, Christopher D. Richards, Kedar N. Swadi, Gang Tan, and Daniel C. Wang. Semantic foundations for typed assembly languages. ACM. Trans. on Programming Languages and Systems, 2009.
2. [AAV03] Amal Ahmed, Andrew W. Appel, and Roberto Virga. An indexed model of impredicative polymorphism and mutable references. http://www.cs.princeton. edu/~appel/papers/impred.pdf, January 2003.
3. [AB07] Andrew W. Appel and Sandrine Blazy. Separation logic for small-step C minor. In 20th Int'l Conference on Theorem Proving in Higher-Order Logics (TPHOLs), pages 5-21, 2007.
4. [ADR09] Amal Ahmed, Derek Dreyer, and Andreas Rossberg. State-dependent representation independence. In POPL '09: Proc. 36th annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 340-353, 2009.
5. [AFM05] Amal Ahmed, Matthew Fluet, and Greg Morrisett. A step-indexed model of substructural state. In ICFP '05: Proceedings of the tenth ACM SIGPLAN International Conference on Functional programming, pages 78-91, 2005.
6. [Age06] Sten Agerholm. Domain theory in HOL. In Higher Order Logic Theorem Proving and Its Applications, LNCS, pages 295-309. Springer, 2006.
7. [Ahm04] Amal J. Ahmed. Semantics of Types for Mutable State. PhD thesis, Princeton University, Princeton, NJ, November 2004. Tech Report TR-713-804
8. [AMRV07] Andrew W. Appel, Paul-Andre Melliès, Christopher D. Richards, and Jerôme Vouillon. A very modal model of a modern, major, general type system. In Proc. 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07), pages 109-122, January 2007.
9. [BBTS07] Bodil Biering, Lars Birkedal, and Noah Torp-Smith. Bi-hyperdoctrines, higher-order separation logic, and abstraction. ACM Trans. Program. Lang. Syst., 29(5):24, 2007.
10. [BKV09] Nick Benton, Andrew Kennedy, and Carsten Varming. Some domain theory and denotational semantics in coq. In Theorem Proving in Hogher Order Logics, LNCS, pages 115-130. Springer, 2009.
11. [BST09] Lars Birkedal, Kristian Støvring, and Jacob Thamsborg. The category-theoretic solution of recursive metric-space equations. Technical report, 2009. TR-2009-2119
12. [BT09] Nick Benton and Nicolas Tabareau. Compiling functional types to relational specifications for low level imperative code. In TLDI '09: Proc. 4th international workshop on Types in language design and implementation, pages 3-14, 2009.
13. [CO78] Robert Cartwright and Derek Oppen. Unrestricted procedure calls in Hoare's logic. In POPL '78: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages, pages 131-140, 1978.
14. [COY07] Cristiano Calcagno, Peter W. O'Hearn, and Hongseok Yang. Local action and abstract separation logic. In LICS '07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, pages 366-378, 2007.
15. [Cra03] Karl Crary. Toward a foundational typed assembly language. In POPL '03: 30th ACM Symp. on Principles of Programming Languages, pages 198-212, 2003.
16. [DAB09] Derek Dreyer, Amal Ahmed, and Lars Birkedal. Logical step-indexed logical relations. In Proceedings 24th Annual IEEE Symposium on Logic in Computer Science (LICS'09), 2009.
17. [DAH08] Robert Dockins, AndrewW. Appel, and Aquinas Hobor. Multi-modal separation logic for reasoning about operational semantics. In 24th Conference on the Mathematical Foundations of Programming Semantics, pages 5-20. Springer ENTCS, 2008.
18. [DHA09] Robert Dockins, Aquinas Hobor, and Andrew W. Appel. A fresh look at separation algebras and share accounting. In The 7th Asian Symposium on Programming Languages and Systems. Springer ENTCS, 2009. To appear.
19. [DNRB10] Derek Dreyer, Georg Neis, Andreas Rossberg, and Lars Birkedal. A relational modal logic for higher-order stateful adts. In POPL '10: Proc. 37th annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010. To appear.
20. +07] Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, and Mooly Sagiv. Local reasoning for storable locks and threads. In Proceedings 5th Asian Symposium on Programming Languages and Systems (APLAS'07), 2007.
21. +03] G. Gierz, K. H. Hofmann, K. Kiemel, J. D. Lawson, M. Mislove, and D. S. Scott. Continuous Lattices and Domains, volume 93 of Encylopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, UK, 2003.
22. [Har94] Robert Harper. A simplified account of polymorphic references. Information Processing Letters, 51:201-206, 1994.
23. [HAZ08] Aquinas Hobor, Andrew W. Appel, and Francesco Zappa Nardelli. Oracle semantics for concurrent separation logic. In Proc. European Symp. on Programming (ESOP 2008) (LNCS 4960), pages 353-367. Springer, 2008.
24. [Hob08] Aquinas Hobor. Oracle Semanatics. PhD thesis, Princeton University, Princeton, NJ, November 2008.
25. [HS97] Robert Harper and Chris Stone. A type-theoretic interpretation of Standard ML. http://foxnet.cs.cmu.edu/papers/rwh-interpret.ps, 1997.
26. [HS08] Cǎtǎlin Hriţcu and Jan Schwinghammer. A step-indexed semantics of imperative objects. International Workshop on Foundations of Object-Oriented Languages (FOOL'08), 2008.
27. [Ler06] Xavier Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In POPL'06, pages 42-54, 2006.
28. [Lev02] Paul Blain Levy. Possible world semantics for general storage in call-by-value. In Computer Science Logic, 16th International Workshop, CSL 2002, volume 2471 of LNCS, pages 232-246, Edinburgh, Scotland, UK, September 2002. Springer.
29. [Mil72] Robin Milner. Logic for computable functions: description of a machine implementation. Technical report, Stanford, CA, USA, 1972.
30. [MNOS99] Olaf Müller, Tobias Nipkow, David von Oheimb, and Oskar Slotosch. HOLCF = HOL + LCF. Journal of Functional Programming, 9:191-223, 1999.
31. [Nip02] Tobias Nipkow. Hoare logics for recursive procedures and unbounded nondeterminism. In Computer Science Logic, volume 2471/2002 of LNCS, pages 155-182. Springer, 2002.
32. [O'H07] Peter W. O'Hearn. Resources, concurrency and local reasoning. Theoretical Computer Science, 375(1):271-307, May 2007.
33. [Ohe01] David von Oheimb. Analyzing Java in Isabelle/HOL: Formalization, Type Safety and Hoare Logic. PhD thesis, Technische Universität München, 2001.
34. [PBC06] Matthew Parkinson, Richard Bornat, and Cristiano Calcagno. Variables as resource in Hoare logics. Proc. of 21st Annual IEEE Symp. on Logic in Computer Science, 0:137-146, 2006.
35. [Pym02] David J. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications, volume 26 of Applied Logic Series. Kluwer Academic Publishers, 2002.
36. [Res00] Greg Restall. An Introduction to Substructural Logics. Rout-ledge, London, England, 2000.
37. [Sch97] Thomas Schreiber. Auxiliary variables and recursive procedures. In TAPSOFT '97: Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development, pages 697-711, London, UK, 1997. Springer-Verlag.
38. [Sch06] Norbert Schirmer. Verification of Sequential Imperative Programs in Isabelle/HOL. PhD thesis, Technische Universität München, 2006.
39. [WF94] Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994.