Frederick Smith, David Walker, Greg Morrisett  Home/Search
Context Related
| cornell.edu/home/fms/Pape...aliastr.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cornell.edu/home/fms/fms (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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):
72.0%: Alias Types - Smith, Walker, Morrisett (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: Modularizing kCFA Makes It Polyvariant - Lee, Yi (Correct)
Similar documents based on text: More All
0.6: Alias Types for Recursive Data Structures - Walker, Morrisett (2000) (Correct)
0.2: Compiling for Template-Based Run-Time Code Generation - Smith, Grossman.. (2002) (Correct)
0.1: A Type Theory for Memory Allocation and Data Layout.. - Petersen, Harper.. (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/article/smith99alias.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/article/smith99alias.html" }
Citations (may not include all citations):1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
566 Proof-carrying code - Necula - 1997
375 ACM Transactions on Programming Languages and Systems (context) - Morrisett, Walker et al. - 1999
306 A syntactic approach to type soundness - Wright, Felleisen - 1994
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
238 Pizza into java: Translating theory into practice - Odersky, Wadler - 1997
210 TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1996
200 Solving shape-analysis problems in languages with destructiv.. - Sagiv, Reps et al. - 1996
188 Region-based memory management - Tofte, Talpin - 1997
184 Linear types can change the world - Wadler - 1990
178 Standard ML of New Jersey - Appel, MacQueen - 1991
138 Type inference for polymorphic references (context) - Tofte - 1990
131 Interprocedural may-alias analysis for pointers: Beyond k-li.. - Deutsch - 1994
120 The Java Virtual Machine Specication (context) - Lindholm, Yellin - 1996
117 Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999
97 Stack-based Typed Assembly Language - Morrisett, Crary et al. - 1998
88 Static detection of dynamic memory errors - Evans - 1996
81 Once upon a type - Turner, Wadler et al. - 1995
61 Conventional and uniqueness typing in graph rewrite systems - Barendsen, Smetsers - 1993
60 Flexible type analysis - Crary, Weirich - 1999
58 Simple imperative polymorphism - Wright - 1995
53 Quasi-linear types - Kobayashi - 1999
43 An overview of the FLINT/ML compiler - Shao - 1997
41 A type system for expressive security policies - Walker - 2000
18 Detecting memory errors via static pointer analysis - Dor, Rodeh et al. - 1998
13 Denitional interpreters for higher-order programming languag.. (context) - Reynolds - 1972
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/fms/fms.html): More
Kleene Algebra with Tests: Completeness and Decidability - Kozen, Smith (1996) (Correct)
TALx86: A Realistic Typed Assembly Language - Morrisett, Crary, Glew.. (1999) (Correct)
Mostly-Copying Collection: A Viable Alternative to.. - Smith, Morrisett (1997) (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