A type system and a static analysis for heap properties using roles.
Abstract: This thesis presents a system for specifying constraints on dynamically changing referencing relationships of heap objects, and an analysis for static verification of these constraints. The constraint specification system is based on the concept of role. The role of an object depends, in large part, on its aliasing relationships with other objects, with the role of each object changing as its aliasing relationships change. In this way roles capture object and data structure properties such as... (Update)
Cited by: More
On Generalized Records and Spatial Conjunction in Role Logic - Kuncak, Rinard (2004)
(Correct)
On Role Logic - Kuncak, Rinard (2003)
(Correct)
Similar documents (at the sentence level):
48.4%: Roles Are Really Great! - Kuncak, Lam, Rinard (2001)
(Correct)
14.1%: Role Analysis - Kuncak, Lam, Rinard (2002)
(Correct)
Active bibliography (related documents): More All
0.6: A Language for Role Specifications - Kuncak, Lam, Rinard (2001)
(Correct)
0.6: On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004)
(Correct)
0.5: Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004)
(Correct)
Similar documents based on text: More All
0.6: Region-Based Memory Management for Real-Time Java - Beebee, Jr. (2001)
(Correct)
0.5: JPS: A Distributed Persistent Java System - Boyapati (1998)
(Correct)
0.4: Existential Heap Abstraction Entailment is Undecidable - Kuncak, Rinard (2003)
(Correct)
Related documents from co-citation: More All
12: Parametric shape analysis via 3valued logic
- Sagiv, Reps et al. - 1999
9: Description logics in data management
- Borgida - 1995
9: Boolean algebra of shape analysis constraints
- Kuncak, Rinard - 2004
BibTeX entry: (Update)
Viktor Kuncak. Designing an algorithm for role analysis. Master's thesis, MIT Laboratory for Computer Science, 2001. http://citeseer.ist.psu.edu/kuncak01designing.html More
@mastersthesis{ kuncak01designingroleanalysis,
author = {Viktor Kuncak},
title = {Designing an Algorithm for Role Analysis},
school = {Massachusetts Institute of Technology},
year = 2001,
url = {citeseer.ist.psu.edu/kuncak01designing.html} }
Citations (may not include all citations):
259
Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981
254
Elements of Reusable Object-Oriented Software (context) - Gamma, Helm et al. - 1994
252
Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
200
Solving shape-analysis problems in languages with destructiv..
- Sagiv, Reps et al. - 1996
184
Linear types can change the world
- Wadler - 1990
182
Skip lists: A probabilistic alternative to balanced trees
- Pugh - 1990
181
Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
157
Soft typing with conditional types
- Aiken, Wimmers et al. - 1994
150
Computational Complexity (context) - Papadimitriou - 1994
150
Parametric shape analysis via 3-valued logic
- Sagiv, Reps et al. - 1999
141
COMPAQ Systems Research Center (context) - Detlefs, Rustan et al. - 1998
138
Enforcing high-level protocols in lowlevel software
- DeLine, Fahndrich - 2001
131
and logic (context) - Thomas, automata - 1997
117
Typed memory management in a calculus of capabilities
- Crary, Walker et al. - 1999
110
Bi as an assertion language for mutable data structures
- Ishtiaq, O'Hearn - 2001
108
Introduction to the Theory of Computation (context) - Sipser - 1997
107
Automatic predicate abstraction of C programs
- Ball, Majumdar et al. - 2001
102
Tree automata techniques and applications
- Comon, Dauchet et al. - 1997
100
Islands: Aliasing protection in object-oriented languages (context) - Hogg - 1991
95
Forward and backward simulations { Part I: Untimed systems
- Lynch, Vaandrager - 1995
88
Static detection of dynamic memory errors
- Evans - 1996
88
Intuitionistic reasoning about shared mutable data structure
- Reynolds - 2000
85
Special issue on Formal Methods in Software Practice (context) - Holzmann, checker et al. - 1997
84
Predicate classes
- Chambers - 1993
82
Alias types for recursive data structures
- Walker, Morrisett - 2000
78
Soft typing
- Cartwright, Fagan - 1991
72
Putting pointer analysis to work
- Ghiya, Hendren - 1998
68
Flexible alias protection
- Noble, Vitek et al. - 1998
65
Typestate: A programming language concept for enhancing soft.. (context) - Strom, Yemini - 1986
63
Using role components to implement collaboration-based desig..
- VanHilst, Notkin - 1996
61
Conventional and uniqueness typing in graph rewrite systems
- Barendsen
58
The expression of graph properties and graph transformations..
- Courcelle - 1997
53
Quasi-linear types
- Kobayashi - 1999
51
Connection analysis: A practical interprocedural heap analys..
- Ghiya, Hendren - 1995
49
A general data dependence test for dynamic (context) - Hendren, Hummel et al. - 1994
49
Type-based alias analysis
- Diwan, McKinley et al. - 1998
47
The Java Language Specication (context) - Gosling, Joy et al. - 2001
46
Larch: Languages and Tools for Formal Speci cation (context) - Guttag, Horning - 1993
38
Handbook of Graph Grammars and Computing by Graph Transforma.. (context) - Rozenberg - 1997
38
Ownership types for exible alias protection (context) - Clarke, Potter et al. - 1998
37
Introduction to set constraint-based program analysis (context) - Aiken - 1999
37
Balloon types: Controlling sharing of state in data types (context) - Almeida - 1997
37
Shape types
- Fradet, Le Metayer - 1997
37
An annotation language for optimizing software libraries
- Guyer, Lin - 1999
37
Alias types
- Smith, Walker et al. - 2000
36
Interprocedural may-alias analysis for pointers: beyond k- l.. (context) - Deutsch - 1994
35
An automatic technique for selection of data representations.. (context) - Schonberg, Schwartz et al. - 1991
35
The pointer assertion logic engine
- Moeller, Schwartzbach - 2001
34
Theoretical Aspects of ObjectOriented Programming (context) - Gunter, Mitchell - 1994
34
Relevant context inference (context) - Chatterjee, Ryder et al. - 1999
33
Extending typestate checking using conditional liveness anal.. (context) - Strom, Yellin - 1993
33
Nils Klarlund and Michael (context) - Klarlund, Graph et al. - 1993
31
Safety checking of machine code
- Xu, Miller et al. - 2000
31
The Classical Decision Problem (context) - Boerger, Graedel et al. - 1997
28
Working With Objects (context) - Reenskaug - 1996
28
Ecient context-sensitive pointer analysis for C programs (context) - Wilson, Lam - 1995
25
Graphs and decidable transductions based on edge constraints
- Klarlund, Schwartzbach - 1994
23
or a cyclic graph (context) - Ghiya, Hendren et al. - 1996
22
Checking cleanness in linked lists
- Dor, Rodeh et al. - 2000
19
Dealing with roles
- Fowler - 1997
19
Massachusetts Institute of Technology (context) - Kuncak, Lam et al. - 2001
18
Extending object-oriented systems with roles (context) - Gottlob, Schre et al. - 1994
16
Context-free graph grammars (context) - Engelfriet - 1997
16
and Jerzy Tiuryn (context) - Harel, Kozen - 2000
16
A decidable logic for linked data structures (context) - Benedikt, Reps et al. - 1999
16
A language for conveying the aliasing properties of dynamic
- Hummel, Hendren et al. - 1994
16
Abstract description of pointer data structures: An approach.. (context) - Hummel, Hendren et al. - 1993
15
Two approaches to interprocedural data ow analysis problems (context) - Sharir, Pnueli - 1981
14
Tree languages (context) - Gecseg, Steinby - 1997
13
Fickle: Dynamic object re-classication (context) - Drossopoulou, Damiani et al. - 2001
13
Science of Computer Programming (context) - Fradet, Le Metayer - 1998
11
Extended SSA numbering: Introducing SSA properties to langua..
- Lapkowski, Hendren - 1998
11
Typestate checking of machine code
- Xu, Reps et al. - 2001
9
Interprocedual shape analysis for recursive programs (context) - Rinetzky, Sagiv - 2001
9
Automatic verication of pointer programs using monadic secon.. (context) - Jensen, Joergensen et al. - 1997
9
Algebraic reconstruction of types and eects (context) - Jouvelot, Gi - 1991
8
An introduction to the database programming language Fibonac.. (context) - Albano, Bergamini et al. - 1995
8
Design-driven compilation
- Rugina, Rinard - 2001
7
Foundations for extensible objects with roles
- Ghelli, Palmerini
6
Using shape analysis to reduce nite-state models of concurre.. (context) - Corbett - 2000
6
TVLA: A framework for kleene based logic static analyses (context) - Lev-Ami - 2000
5
Analysis of dynamic structures for ecient parallel execution (context) - Plevyak, Karamcheti et al. - 1993
5
and Thomas Reps (context) - Wilhelm, Sagiv - 2000
5
A new denition of the subtype relation (context) - Liskov, Wing - 1993
3
Theory of Sets (context) - Bourbaki - 1968
3
The Unied Modelling Language Reference Manual (context) - Rumbaugh, Jacobson et al. - 1999
2
Data Dependence Testing in the Presence of Pointers and Poin.. (context) - Hummel - 1998
2
DIGITAL Systems Research Center (context) - Detlefs, Rustan et al. - 1998
2
Experimental classication facilities for Smalltalk (context) - Yelland - 1992
1
A checkable interface language for pointer-based structures (context) - Russell, Strom et al. - 1994
1
An inference algorithm for the static verication of pointer .. (context) - Fradet, Gaugne et al. - 1996
1
A language for role speci- cations (context) - Kuncak, Lam et al. - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mit.edu/people/vkuncak/papers/index.html): More
Reducibility Method for Simple Types and Church-Rosser Property - Ghilezan, Kuncak (2000)
(Correct)
Reducibility Method for Intersection Types - Ghilezan, Kuncak (2000)
(Correct)
Numerical Representations as Purely Functional Data Structures - Ivanovic, Kuncak (2000)
(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