F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Checking and Inferring Local Non-Aliasing - Aiken, Foster, Kodumal, Terauchi (2003) (5 citations) (Correct)
....One of the limitations of our approach is that restrict and confine must be lexically scoped. This assumption fits well with many, but not all, uses of restrict and confine in practice. Other type based systems that model strong and weak updates and do not have lexical scoping restrictions [9, 12, 25] are more expressive, but also less suited to tractable automatic inference than our approach. For example, Boyland [3] shows how to check several programming paradigms using non lexically scoped linearities and flow sensitive aliasing information. There are several systems for modeling ....
.... us to locally recover the ability to treat a pointer as a reference to a unique value, which allows analyses that use restrict and confine information to perform strong updates [5] This idea is the subject of previous work [15] that combines restrict with ideas from flow sensitive type systems [25]. The resulting system can be used to check flow sensitive program properties. Several other systems, such at Meta level compilation [17] and ESP [8] check flow sensitive program properties using approaches more directly based on dataflow analysis. In these systems, arbitrary dataflow facts are ....
F. Smith, D. Walker, and G. Morrisett. Alias Types. In G. Smolka, editor, 9th European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 366--381, Berlin, Germany, 2000. Springer-Verlag.
Observational Determinism for Concurrent Program Security - Zdancewic, Myers (2003) (3 citations) (Correct)
....ensure that references and nonlinear channels are used sequentially. Simple syntactic constraints can enforce this property [31] Sequentiality can 10 also be formulated in the type system [19] but doing so is rather complex. Another possibility is to track aliasing directly in the type system [40, 46], which would potentially permit very finegrained control of concurrency. More generally, pointer or shape analysis can be used to approximate read( and write( 21, 9, 10, 33] Because # SEC s sequential core is essentially an imperative language with goto, we expect that these existing ....
F. Smith, D. Walker, and G. Morrisett. Alias types. In Proc. of the 9th European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 366--381, 2000.
Existential Heap Abstraction Entailment is Undecidable - Kuncak, Rinard (2003) (1 citation) (Correct)
....limits the set of properties that they can express. It is therefore desirable to develop abstractions that change as the properties of objects change. A typestate is a system where types of objects change over time. A simple typestate system was introduced in [34] more recent examples include [8 11,14,21,33,36]. Similarly to [13] these typestate systems are a step towards the highly automated static checking of complex properties of objects. One of the di#culties in specifying properties of objects in the presence of linked data structures is that a property of an object x may depend on properties of ....
....than the requirements of analyses intended for program optimization. It is these precision requirements of the compositional analysis that motivate the study of the completeness of heap property entailment algorithms. 4 Several recent systems support the analysis of tree like data structures [3, 9, 15,24,33,36]. The restriction to tree like data structures is in contrast to our notion of a heap, which allows nodes with in degree greater than one. The presence of non tree data structures is one of the key factors that make the implication of regular graph constraints undecidable. 1] suggests an ....
F. Smith, D. Walker, and G. Morrisett. Alias types. In Proc. 9th European Symposium on Programming, Berlin, Germany, March 2000.
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003) (9 citations) Self-citation (Walker) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
The Logical Approach to Stack Typing - Ahmed, Walker (2003) (7 citations) Self-citation (Walker) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
Reasoning about Hierarchical Storage - Amal Ahmed Limin (2003) (4 citations) Self-citation (Walker) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
A Linear Language with Locations - Greg Morrisett Amal Self-citation (Morrisett) (Correct)
No context found.
Smith, F., Walker, D., Morrisett, G.: Alias types. In: (ESOP). (2000)
Local Reasoning about a Copying Garbage Collector - Birkedal, Torp-Smith, Reynolds (2004) (7 citations) Self-citation (Smith) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, March 2000.
Reasoning about Hierarchical Storage - Amal Ahmed Limin (2003) (4 citations) Self-citation (Walker) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003) (9 citations) Self-citation (Walker) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2002) (9 citations) Self-citation (Walker) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
The Logical Approach to Stack Typing - Ahmed, Walker (2003) (7 citations) Self-citation (Walker) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003) (9 citations) Self-citation (Walker) (Correct)
....in our examples as they may easily be inferred in a similar manner to the way the Twelf system [30] infers leading quantifiers. 4. 1 Alias Types Our first example demonstrates how our system of type refinements is able to capture simple aliasing constraints, as in previous work on alias types [34, 38]. These constraints allow us to deallocate memory explicitly, yet safely, using the free function. The refinement signature for this application appears below. unit i : int (for any integer i) # : int ref (for any location #) new : Its(i) 1) # #[#:int ref ] Its(#) ctns(#, i) get : ....
....find locking bugs in the Linux kernel. One significant difference between our work and the others is that we have chosen to use a general substructural logic to encode program properties. Vault is the most similar since its type system is derived from the capability calculus [37] and alias types [34, 38], which is also an inspiration for this work. However, the capability logic is somewhat ad hoc whereas we base our type system directly on linear logic. As far as we are aware, the semantics of vault has not geen fully formalized. We hope this work is an e#ective starting point in that endeavour. ....
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, pages 366--381, Berlin, Mar. 2000.
Resources, Concurrency and Local Reasoning - O'Hearn (2005) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. Proceedings of ESOP'99.
On Spatial Conjunction as Second-Order Logic - Kuncak, Rinard (2004) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In Proc. 9th ESOP, Berlin, Germany, Mar. 2000.
Checking and Inferring Local Non-Aliasing - Alex Aiken Aiken (2003) (5 citations) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias Types. In G. Smolka, editor, 9th European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 366--381, Berlin, Germany, 2000. Springer-Verlag.
Ownership Transfer and Abstraction - Banerjee, Naumann (2003) (Correct)
No context found.
G. Morrisett, F. Smith, and D. Walker. Alias types. In ESOP, 2000.
Typestates for Objects - Deline, Fahndrich (2004) (10 citations) (Correct)
No context found.
Smith, F., Walker, D., Morrisett, J.G.: Alias types. In: European Symposium on Programming. (2000) 366--381
Existential Heap Abstraction Entailment is Undecidable - Kuncak, Rinard (2003) (1 citation) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In Proc. 9th European Symposium on Programming, Berlin, Germany, March 2000.
Connecting Effects and Uniqueness with Adoption - Boyland (Correct)
No context found.
Smith, F., Walker, D., Morrisett, J.G.: Alias types. In Smolka, G., ed.: ESOP'00 --- Programming Languages and Systems, 9th European Symposium on Programming. Volume 1782 of Lecture Notes in Computer Science., Berlin, Heidelberg, New York, Springer (2000) 366--381
Prospectus - Student Nadeem Abdul (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In G. Smolka, editor, Proc. 9th European Symposium on Programming (ESOP 2000.
A Language for Role Specifications - Kuncak, Lam, Rinard (2001) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In Proc. 9th European Symposium on Programming, Berlin, Germany, March 2000.
Typed Regions - Monnier (2004) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, 2000.
Time Regions and Effects for Resource Usage Analysis - Kobayashi (2003) (Correct)
No context found.
F. Smith, D. Walker, and J. G. Morrisett. Alias types. In European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 366--381, 2000.
Flow-Sensitive Type Qualifiers - Foster, Terauchi, Aiken (2002) (43 citations) (Correct)
No context found.
F. Smith, D. Walker, and G. Morrisett. Alias Types. In G. Smolka, editor, 9th European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 366--381, Berlin, Germany, 2000. Springer-Verlag.
First 50 documents
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