See this document in CiteSeerX!

Alias Types  (Make Corrections)  (37 citations)
Frederick Smith, David Walker, Greg Morrisett
Lecture Notes in Computer Science



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
cornell.edu/talc/papers/alias.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cornell.edu/home/jgm/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Linear type systems allow destructive operations such as object deallocation and imperative updates of functional data structures. These operations and others, such as the ability to reuse memory at different types, are essential in low-level typed languages. However, traditional linear type systems are too restrictive for use in low-level code where it is necessary to exploit pointer aliasing. We present a new typed language that allows functions to specify the shape of the store that they... (Update)

Cited by:   More
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003)   (Correct)
The Logical Approach to Stack Typing - Ahmed, Walker (2003)   (Correct)
Resources, Concurrency and Local Reasoning - O'Hearn (2005)   (Correct)

Similar documents (at the sentence level):
44.4%:   Alias Types - Smith, Walker, Morrisett (1999)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Detecting Memory Errors via Static Pointer Analysis - Dor (1999)   (Correct)
0.1:   Detecting Memory Errors via Static Pointer Analysis.. - Dor, Rodeh, Sagiv (1998)   (Correct)
0.1:   Typed Memory Management in a Calculus of Capabilities - Walker, Crary, Morrisett (2000)   (Correct)

Similar documents based on text:   More   All
0.7:   Alias Types for Recursive Data Structures - Walker, Morrisett (2000)   (Correct)
0.2:   Typed Memory Management via Static Capabilities - Walker, Crary, Morrisett (2000)   (Correct)
0.2:   Compiling for Template-Based Run-Time Code Generation - Smith, Grossman.. (2002)   (Correct)

Related documents from co-citation:   More   All
25:   Enforcing high-level protocols in low-level software - ahndrich, DeLine - 2001
24:   Alias types for recursive data structures - Walker, Morrissett - 2000
17:   Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999

BibTeX entry:   (Update)

F. Smith, D. Walker, and G. Morrissett. Alias types. ESOP'00. http://citeseer.ist.psu.edu/370935.html   More

@article{ smith00alias,
    author = "Frederick Smith and David Walker and Greg Morrisett",
    title = "Alias Types",
    journal = "Lecture Notes in Computer Science",
    volume = "1782",
    pages = "366+",
    year = "2000",
    url = "citeseer.ist.psu.edu/370935.html" }
Citations (may not include all citations):
1399   Compilers: Principles (context) - Aho, Sethi et al. - 1986
746   The Java Virtual Machine Specification (context) - Lindholm, Yellin - 1996
566   Proof-carrying code - Necula - 1997  ACM   DBLP
306   A syntactic approach to type soundness - Wright, Felleisen - 1994  ACM   DBLP
283   Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
210   TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1996  DBLP
200   Solving shape-analysis problems in languages with destructiv.. - Sagiv, Reps et al. - 1996
188   Region-based memory management - Tofte, Talpin - 1997
184   Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972  ACM   DBLP
184   Linear types can change the world - Wadler - 1990
178   Standard ML of New Jersey - Appel, MacQueen - 1991  DBLP
169   A type system for Java bytecode subroutines - Stata, Abadi - 1998  ACM   DBLP
138   Type inference for polymorphic references (context) - Tofte - 1990
132   Syntactic control of interference (context) - Reynolds - 1978  ACM   DBLP
117   Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999  ACM   DBLP
97   Stack-based Typed Assembly Language - Morrisett, Crary et al. - 1998
88   Static detection of dynamic memory errors - Evans - 1996  ACM   DBLP
81   Once upon a type - Turner, Wadler et al. - 1995  ACM   DBLP
79   ACM Transactions on Programming Languages and Systems (context) - Morrisett, Walker et al. - 1999
61   Conventional and uniqueness typing in graph rewrite systems - Barendsen, Smetsers - 1993  ACM   DBLP
58   Simple imperative polymorphism - Wright - 1995  ACM   DBLP
53   Quasi-linear types - Kobayashi - 1999
43   An overview of the FLINT/ML compiler - Shao - 1997
36   Interprocedural may-alias analysis for pointers: Beyond k-li.. (context) - Deutsch - 1994
31   A formal framework for the Java bytecode language and verifi.. - Freund, Mitchell - 1999
18   Detecting memory errors via static pointer analysis - Dor, Rodeh et al. - 1998
10   Technical Report TR (context) - Smith, Walker et al. - 1999
6   Points-to analysis in linear time (context) - Steensgaard - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.cornell.edu/home/jgm/papers.html):   More
Type Structure for Low-Level Programming Languages - Karl Crary (1999)   (Correct)
Optimistic Parallelization - Morrisett, Herlihy (1993)   (Correct)
Towards Compiler-Independent Certifying Compilation - Grossman, Morrisett   (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