(Enter summary)
Abstract: Standard type systems are not sufficiently expressive when applied
to low-level memory-management code. Such code often requires
some form of strong update (i.e. assignments that change the type
of the affected location) and needs to reason about the relative position
of objects in memory. We present a novel type system which,
like alias types, provides a form of strong update, but with the advantage
that it does not require the aliasing pattern to be statically
described. It can also provide... (Update)
Active bibliography (related documents): More All
0.5: the Garbage Collection Bibliography - Richard Jones (2003)
(Correct)
0.2: High-Assurance Common Language Runtime - Appel, Walker, Shao, Trifonov
(Correct)
0.2: A Syntactic Approach to Foundational Proof-Carrying Code - Hamid, Shao, Trifonov.. (2002)
(Correct)
Similar documents based on text: More All
0.6: Cv - Turcotte
(Correct)
0.4: Adaptive Boosting of Neural Networks for Character Recognition - Schwenk, Bengio (1997)
(Correct)
0.4: Diversification Strategies in Local Search for A.. - Gendron, Potvin, Soriano
(Correct)
BibTeX entry: (Update)
@misc{ monnier-typed,
author = "Stefan Monnier",
title = "Typed Regions",
url = "citeseer.ist.psu.edu/monnier04typed.html" }
Citations (may not include all citations):
650
An axiomatic basis for computer programming (context) - Hoare - 1969
566
Proof-carrying code
- Necula - 1997
382
Lambda calculi with types
- Barendregt - 1991
266
Information and Computation (context) - Coquand, Huet et al. - 1988
252
Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
233
The formulae-as-types notion of constructions (context) - Howard - 1980
201
to typed assembly language (context) - Morrisett, Walker et al. - 1998
186
Compiling polymorphism using intensional type analysis
- Harper, Morrisett - 1995
138
Enforcing high-level protocols in low-level software
- DeLine, ahndrich - 2001
117
Typed memory management in a calculus of capabilities
- Crary, Walker et al. - 1999
88
Implementation of the typed call-by-value #-calculus using a.. (context) - Tofte, Talpin - 1994
82
Alias types for recursive data structures
- Walker, Morrisett - 2000
58
Foundational proof-carrying code
- Appel - 2001
39
Adoption and focus: Practical linear types for imperative pr..
- ahndrich, DeLine - 2002
37
Alias types
- Smith, Walker et al. - 2000
30
Une Th eorie des Constructions Inductives (context) - Werner - 1994
23
A type system for certified binaries (context) - Shao, Saha et al. - 2002
21
A syntactic approach to foundational proof-carrying code
- Hamid, Shao et al. - 2002
19
Inductive definitions in the system Coq---rules and properti.. (context) - Paulin-Mohring - 1993
8
Principled scavenging (context) - Monnier, Saha et al. - 2001
2
Safe garbage collection = regions + intensional type analysi.. (context) - Wang, Appel - 1999
1
A typed interface for garbage collection
- Vanderwaart, Crary - 2003
1
The Coq proof assistant reference manual (context) - Huet, Paulin-Mohring - 2000
1
Principled Compilation and Scavenging (context) - Monnier - 2003
Documents on the same site (http://www.diku.dk/topps/space2004/): More
lfd_infer: an Implementation of a Static Inference on Heap Space.. - Jost (2004)
(Correct)
Comparing the expressive power of Separation logic and classical.. - Lozes (2004)
(Correct)
Experiments on the Effectiveness of an Automatic Insertion of.. - Lee, Yi (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC