Reasoning about hierarchical storage

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 33-44

  Ahmed, Amal ^a   Jia, Limin ^a   Walker, David ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); FORMAL LOGIC; HIERARCHICAL SYSTEMS; MULTIPROCESSING PROGRAMS; SEMANTICS; ASSEMBLY; BISMUTH; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATA STRUCTURES; DIGITAL STORAGE; LOGIC PROGRAMMING;

SUBSTRUCTURAL LOGIC;

COMPUTER SCIENCE; INFORMATION MANAGEMENT;

ABSTRACT MACHINES; ADDRESS SPACE; HIERARCHICAL STORAGE; MEMORY MANAGEMENT; SUBSTRUCTURAL LOGIC; TYPE SYSTEMS; VIRTUAL MACHINING;

EID: 0041466342     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

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. L. Cardelli, P. Gardner, and G. Ghelli. A spatial logic for querying graphs. In 29th International Colloquium on Automata, Languages, and Programming, ICALP 2002, volume 2380 of Lecture Notes in Computer Science, pages 597-610, Malaga, Spain, July 2002. Springer-Verlag.
3. L. Cardelli and A. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Twenty-Seventh ACM Symposium on Principles of Programming Languages, pages 365-377. ACM Press, Jan. 2000.
4. J. Chirimar, C. A. Gunter, and J. G. Riecke. Reference counting as a computational interpretation of linear logic. Journal of Functional Programming, 6(2):195-244, Mar. 1996.
5. R. Deline and M. Fähndrich. Enforcing high-level protocols in low-level software. In ACM Conference on Programming Language Design and Implementation, pages 59-69, Snowbird, Utah, June 2001. ACM Press.
6. M. Elsman and N. Hallenberg. A region-based abstract machine for the ML Kit. Technical Report TR-2002-18, Royal Veterinary and Agricultural University of Denmark and IT University of Copenhagen, August 2002. IT University Technical Report Series.
7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
8. 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.
9. Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157-180, 1988.
10. T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1996.
11. M. Löf. On the meanings of the logical constants and the justifications of the logical laws. Technical Report 2, University of Siena, 1985.
12. G. Morrisett, K. Crary, N. Glew, and D. Walker. Stack-based Typed Assembly Language. In Second International Workshop on Types in Compilation, pages 95-117, Kyoto, Mar. 1998. Published in Xavier Leroy and Atsushi Ohori, editors, Lecture Notes in Computer Science, volume 1473, pages 28-52. Springer-Verlag, 1998.
13. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to Typed Assembly Language. ACM Transactions on Programming Languages and Systems, 3(21):528-569, May 1999.
14. G. Necula. Proof-carrying code. In Twenty-Fourth ACM Symposium on Principles of Programming Languages, pages 106-119, Paris, 1997.
15. G. Necula and P. Lee. Safe kernel extensions without runtime checking. In Proceedings of Operating System Design and Implementation, pages 229-243, Seattle, Oct. 1996.
16. P. O'Hearn and D. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, 1999.
17. L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In ACM Symposium on Principles of Programming Languages, Jan. 2003. To appear.
18. F. Pfenning. Logical frameworks. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, chapter 16, pages 977-1061. Elsevier Science and MIT Press, 2001.
19. F. Pfenning and R. Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001.
20. J. Polakow. Ordered Linear Logic and Applications. PhD thesis, Carnegie Mellon University, 2001. Available As Technical Report CMU-CS-01-152.
21. J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, pages 295-309, Berlin, 1999. Springer-Verlag.
22. J. Polakow and F. Pfenning. Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic. Electronic Notes in Theoretical Computer Science, 20, 1999.
23. J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial perspectives in computer science, Palgrove, 2000.
24. F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366-381, Berlin, Mar. 2000.
25. Standard ECMA-335: Common Language Infrastructure (CLI), Dec. 2001. http://www.ecma.ch.
26. M. Tofte, L. Birkedal, M. Elsman, N. Hallenberg, T. H. Olesen, P. Sestoft, and P. Bertelsen. Programming with regions in the ML Kit (for version 3). Technical Report 98/25, Computer Science Department, University of Copenhagen, 1998.
27. M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1997.
28. P. Wadler. Linear types can change the world! In M. Broy and C. Jones, editors, Progarmming Concepts and Methods, Sea of Galilee, Israel, Apr. 1990. North Holland. IFIP TC 2 Working Conference.
29. D. Walker, K. Crary, and G. Morrisett. Typed memory management in a calculus of capabilities. ACM Transactions on Programming Languages and Systems, 22(4):701-771, May 2000.
30. D. Walker and G. Morrisett. Alias types for recursive data structures. In Workshop on Types in Compilation, Montreal, Sept. 2000.
31. D. Walker and K. Watkins. On linear types and regions. In ACM International Conference on Functional Programming, Florence, Sept. 2001. ACM Press.