The Runtime Structure of Object Ownership

Mitchell, N.

doi:10.1007/11785477_5

Cited by 74 publications

(65 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[16]) and dynamic ownership inference (e.g. [28]) are concrete instances in this category. In those contexts, the object that forms the "dynamic object scope" of another is called a compositional object or an owner.…”

Section: Dynamic Heap Decompositionmentioning

confidence: 99%

“…The most advanced direction related to our work is ownership type inference, which can be achieved either through dynamic analysis [28,34] or static analysis [10,26,17]. Dynamic approaches are sound only w.r.t.…”

Section: Related Workmentioning

confidence: 99%

“…Dynamic approaches are sound only w.r.t. the (finite number of) executions the analysis is performed over, but on the positive side, they can often offer insight into complex structures of programs beyond ownership (an example would be a "butterfly" in [28]). Dietl et.…”

Section: Related Workmentioning

confidence: 99%

“…Our concrete proposal is Cypress, a sound, precise, and scalable constraint-based type inference. As a form of ownership inference [14,28,34,26,10,17], Cypress is distinct with the following features:…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Heap Decomposition Inference with Linear Programming

Zhu

Liu

2013

ECOOP 2013 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Hierarchical decomposition is a fundamental principle that encourages the organization of program elements into nested scopes of access, instead of treating all as "global." This paper offers a foundational study of heap decomposition inference, the problem of statically extracting the decomposition hierarchy latent in the runtimes of object-oriented programs, henceforth revealing the compositional nature of the heap. The centerpiece of the paper is Cypress, a sound, precise, and scalable constraint-based ownership type inference coupled with a novel application of linear programming over integers. All constraints in Cypress are linear, and the precision of decomposition -placing objects to scopes as non-global as possible -can be reduced to a linear programming problem. Cypress has been implemented as an open-source tool that can decompose realworld Java applications of more than 100K LOC and up to 6000 statically distinct instantiations.

show abstract

Section: Dynamic Heap Decompositionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Heap Decomposition Inference with Linear Programming

Zhu

Liu

2013

ECOOP 2013 – Object-Oriented Programming

View full text Add to dashboard Cite

show abstract

“…Several dynamic approaches for ownership inference exist [9,18,22,28]. Although a dynamic approach may produce more precise results, it is inherently unsound and incurs a significant performance overhead.…”

Section: Related Workmentioning

confidence: 99%

Inference and Checking of Object Ownership

Huang

Dietl

Milanova

et al. 2012

ECOOP 2012 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Ownership type systems describe a heap topology and enforce an encapsulation discipline; they aid in various program correctness and understanding tasks. However, the annotation overhead of ownership type systems has hindered their widespread use. We present a unified framework for specification, type inference and type checking of ownership type systems, and instantiate the framework for two such systems: Universe Types and Ownership Types. We present an objective metric defining a "best typing" for these type systems, and develop an inference approach that maximizes the metric. The programmer can influence the inference by adding partial annotations to the program. We implemented the approach on top of the Checker Framework and present the results of an experimental evaluation.

show abstract

Dynamic Architecture Extraction

Flanagan

Freund

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Object models capture key properties of object-oriented architectures, and they can highlight relationships between types, occurrences of sharing, and object encapsulation. We present a dynamic analysis to extract object models from legacy code bases. Our analysis reconstructs each intermediate heap from a log of object allocations and field writes, applies a sequence of abstraction-based operations to each heap, and combines the results into a single object model that conservatively approximates all observed heaps from the program's execution. The resulting object models reflect many interesting and useful architectural properties.

show abstract

The Runtime Structure of Object Ownership

Cited by 74 publications

References 29 publications

Heap Decomposition Inference with Linear Programming

Heap Decomposition Inference with Linear Programming

Inference and Checking of Object Ownership

Dynamic Architecture Extraction

Contact Info

Product

Resources

About