The Logical Approach to Stack Typing

The Logical Approach to Stack Typing (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Amal Ahmed , David Walker

Citations:

22 - 4 self

BibTeX

@MISC{Ahmed03thelogical,
    author = {Amal Ahmed and David Walker},
    title = {The Logical Approach to Stack Typing},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set of natural deduction-style inference rules. We deploy the logic in a simple type system for a stack-based assembly language. The connectives for the logic provide a flexible yet concise mechanism for controlling allocation, deallocation and access to both heap-allocated and stack-allocated data.

Citations

1023	The Java Virtual Machine Specification - Lindholm, Yellin - 1996
1016	Proof-carrying code - Necula - 1997
557	From system F to typed assembly language - Morrisett, Walker, et al. - 1999
381	Safe Kernel Extensions without Run-time Checking - Necula, Lee
347	Enforcing high-level protocols in low-level software - DeLine, Fähndrich - 2001
269	Region-based memory management - Tofte, Talpin - 1997
237	H.: Local Reasoning about Programs that Alter Data Structures - O’Hearn, Reynolds, et al. - 2001
213	Foundational proof-carrying code - Appel - 2001
186	Typed memory management in a calculus of capabilities - Crary, Walker, et al. - 1999
172	The logic of bunched implications - O’Hearn, Pym - 1999
164	Region-based memory management in Cyclone - Grossman, Morrisett, et al. - 2002
162	Eliminating Array Bound Checking Through Dependent Types - Xi, Pfenning - 1998
157	Alias types - Smith, Walker, et al. - 2000
148	as an assertion language for mutable data structures - BI - 2001
143	R.: A Judgmental Reconstruction of Modal Logic - Pfenning, Davies
136	Stack-based typed assembly language - Morrisett, Crary, et al. - 2002
128	Alias types for recursive data structures - Walker, Morrisett - 2000
122	A semantic model of types and machine instructions for proof-carrying code - Appel, Felty - 2000
120	types can change the world - Linear - 1990
101	Intuitionistic reasoning about shared mutable data structure - Reynolds - 2000
89	The linear abstract machine - Lafont - 1988
80	A type system for certified binaries - Shao, Trifonov, et al.
79	A type system for bounded space and functional in-place update - Hofmann - 2008
53	J.C.: From Algol to polymorphic linear lambda-calculus - O’Hearn, Reynolds - 2000
51	A simple, comprehensive type system for Java bytecode subroutines - O’Callahan - 1999
33	Ordered Linear Logic and Applications - Polakow - 2001
32	Reference counting as a computational interpretation of linear logic - Chirimar, Gunter, et al. - 1996
31	An expressive, scalable type theory for certified code - Crary, Vanderwaart - 2002
31	Natural deduction for intuitionistic non-commutative linear logic - Polakow, Pfenning - 1999
26	On Bunched Typing - O’Hearn
25	Trustless grid computing in ConCert - Chang, Crary, et al. - 2002
25	A type theory for memory allocation and data layout - Petersen, Harper, et al. - 2003
25	Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic - Polakow, Pfenning - 1999
12	Properties of terms in continuation-passing style in an ordered logical framework - Polakow, Pfenning - 2000
10	Using functor categories to generate intermediate code - REYNOLDS - 1995
10	Programming with regions in the ml kit (for version 3 - Tofte, Birkedal, et al. - 1998
8	Typed Memory Management - Walker - 2001
4	A region-based abstract machine for the ML Kit - Elsman, Hallenberg - 2002
1	Reasoning about hierarchical memory management. Unpublished manuscript - Ahmed, Jia, et al. - 2002