Expressing heap-shape contracts in linear logic

Proceedings of the 5th International Conference on Generative Programming and Component Engineering, GPCE'06

Volumn , Issue , 2006, Pages 101-110

  Perry, Frances ^a   Jia, Limin ^a   Walker, David ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Assertions; Contracts; Heap shape; Linear logic

Indexed keywords

COMPOSITIONAL SEMANTICS; LINEAR LOGIC; MEMORY SHAPES; SOFTWARE COMPONENTS;

DATA STRUCTURES; LINEAR SYSTEMS; LOGIC PROGRAMMING; PATTERN RECOGNITION; SEMANTICS; USER INTERFACES;

RECURSIVE FUNCTIONS;

EID: 34547468242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1173706.1173723     Document Type: Conference Paper

References (22)

1. A. Ahmed and D. Walker. The logical approach to stack typing. In ACM SIGPLAN Workshop on Types in Language Design and Implementation, New Orleans, Jan. 2003.
2. A. W. Appel and D. A. McAllester. An indexed model of recursive types for foundational proof-carrying code. Programming Languages and Systems, 23(5):657-683, 2001.
3. L. Birkedal, N. Torp-Smith, and J. Reynolds. Local reasoning about a copying garbage collector. In ACM Symposium on Principles of Programming Languages, pages 220-231, Venice, Italy, Jan. 2004.
4. R. B. Findler and M. Felleisen. Contracts for higher-order functions. In ICFP '02: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 48-59, New York, NY, USA, 2002. ACM Press.
5. R. Hastings and B. Joyce. Fast detection of memory leaks and access errors. In Proceedings of the Winter "92 USENIX conference, pages 125-136. USENIX Association, 1992.
6. M. Hauswirth and T. M. Chilimbi. Low-overhead memory leak detection using adaptive statistical profiling. In ASPLOS, pages 156-164, 2004.
7. J. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. In Papers presented at the IEEE symposium on Logic in computer science, pages 327-365, Orlando, FL, USA, 1994. Academic Press, Inc.
8. R. C. Holt and J. R. Cordy. The Turing programming language. Commun. ACM, 31(12):1410-1423, 1988.
9. S. Ishtiaq and P. O'Hearn. BI as an assertion language for mutable data structures. In Twenty-Eighth ACM Symposium on Principles of Programming Languages, pages 14-26, London, UK, Jan. 2001.
10. L. Jia, F. Spalding, D. Walker, and N. Glew. Certifying compilation for a language with stack allocation. In Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, LICS 2005, 2005.
11. L. Jia and D. Walker. ILC: A foundation for automated reasoning about pointer programs. In European Symposium on Programming Languages, Apr. 2006.
12. P. López, F. Pfenning, J. Polakow, and K. Watkins. Monadic concurrent linear logic programming. In PPDP '05, pages 35-46, New York, NY, USA, 2005. ACM Press.
13. P. López and J. Polakow. Implementing efficient resource management for linear logic programming. In Logic for Programming Artificial Intelligence and Reasoning (LPAR), pages 528-543, 2004.
14. D. C. Luckham. Programming with Specifications: An Introduction to Anna, a Language for Specifying ADA Programs. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1990.
15. B. Meyer. Eiffel: programming for reusability and extendibility. SIGPLAN Not., 22(2):85-94, 1987.
16. B. Meyer. Eiffel: the language. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1992.
17. 3: A linear language with locations. In Seventh International Conference on Typed Lambda Calculi and Applications, Apr. 2005.
18. P. O'Hearn and D. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, 1999.
19. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Computer Science Logic, number 2142 in LNCS, pages 1-19, Paris, 2001.
20. D. L. Parnas. A technique for software module specification with examples. Commun. ACM, 15(5):330-336, 1972.
21. Programming with assertions. http://java.sun.com/j2se/1.4.2/docs/guide/ lang/assert.html.
22. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 55-74, 2002.