Checking and inferring local non-aliasing

Aiken, Alex; Foster, Jeffrey S.; Kodumal, John; Terauchi, Tachio

doi:10.1145/781143.781146

Cited by 16 publications

(32 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint-based type inference has also been used for inferring atomicity annotations to detect races [7,11], inferring non-local aliasing [1], and supporting type qualifiers dependent on flow-sensitivity (like read, write, and open) [13].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Inference of Reference Immutability

Quinonez¹,

Tschantz²,

Ernst³

ECOOP 2008 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Javari is an extension of Java that supports reference immutability constraints. Programmers write readonly type qualifiers and other constraints, and the Javari typechecker detects mutation errors (incorrect side effects) or verifies their absence. While case studies have demonstrated the practicality and value of Javari, a barrier to usability remains. A Javari program will not typecheck unless all the references in the APIs of libraries it uses are annotated with Javari type qualifiers. Manually converting existing Java libraries to Javari is tedious and error-prone. We present an algorithm for inferring reference immutability in Javari. The flow-insensitive and context-sensitive algorithm is sound and produces a set of qualifiers that typecheck in Javari. The algorithm is precise in that it infers the most readonly qualifiers possible; adding any additional readonly qualifiers will cause the program to not typecheck. We have implemented the algorithm in a tool, Javarifier, that infers the Javari type qualifiers over a set of class files. Javarifier automatically converts Java libraries to Javari. Additionally, Javarifier eases the task of converting legacy programs to Javari by inferring the mutability of every reference in a program. In case studies, Javarifier correctly inferred mutability over Java programs of up to 110 KLOC.

show abstract

Section: Related Workmentioning

confidence: 99%

“…readonly), non-generics polymorphism (polyread), and containing-object context this-mutable. 1 Javari provides reference immutability guarantees over the abstract state of an object (see Section 2.1). The algorithm handles the complexities of the Java language, including subtyping, generics, arrays, and unseen code.…”

Section: Introductionmentioning

confidence: 99%

Inference of Reference Immutability

Quinonez¹,

Tschantz²,

Ernst³

ECOOP 2008 – Object-Oriented Programming

View full text Add to dashboard Cite

show abstract

“…f n , else φ ′′ (s k ) = ℓ any . Intuitively, field updates that might occur in the execution of q are learned in (1). Variables which are not output variables of q (2.1) are not affected by this step.…”

Section: Compositional Reference Constancy Analysismentioning

confidence: 99%

“…Without additional information, such as our RCA, this domain would be rather limited (imprecise) for bytecode. The notion of restricted variables used in [1] for C programs is related to our notion of reference constancy. However, [1] imposes more restrictive conditions, namely it avoids global pointers to be used locally and local copies to escape from the local context and, thus, it does not imply our reference constancy condition.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

“…The notion of restricted variables used in [1] for C programs is related to our notion of reference constancy. However, [1] imposes more restrictive conditions, namely it avoids global pointers to be used locally and local copies to escape from the local context and, thus, it does not imply our reference constancy condition. In general, more accurate aliasing analysis (see [1] and its references) can be used to improve the precision of our analysis when computing the read and write sets, but at a higher performance cost and, besides, such further precision might not be required in practice for analyzing subprograms context-independently.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Field-Sensitive Value Analysis by Field-Insensitive Analysis

Albert

Arenas

Genaim

et al. 2009

FM 2009: Formal Methods

View full text Add to dashboard Cite

Abstract. Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this paper, we first identify sufficient conditions under which heap allocated numeric variables in object oriented programs (i.e., numeric fields) can be handled as nonheap allocated variables. Then, we present a static analysis to infer which numeric fields satisfy these conditions at the level of (sequential) bytecode. This allows instrumenting the code with ghost variables which make such numeric fields observable to any field-insensitive value analysis. Our experimental results in termination analysis show that we greatly enlarge the class of analyzable programs with a reasonable overhead.

show abstract

From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis

et al. 2010

View full text Add to dashboard Cite

Abstract. Static analysis which takes into account the value of data stored in the heap is typically considered complex and computationally intractable in practice. Thus, most static analyzers do not keep track of object fields (or fields for short), i.e., they are field-insensitive. In this paper, we propose locality conditions for soundly converting fields into local variables. This way, field-insensitive analysis over the transformed program can infer information on the original fields. Our notion of locality is context-sensitive and can be applied both to numeric and reference fields. We propose then a polyvariant transformation which actually converts object fields meeting the locality condition into variables and which is able to generate multiple versions of code when this leads to increasing the amount of fields which satisfy the locality conditions. We have implemented our analysis within a termination analyzer for Java bytecode. Interestingly, we can now prove termination of programs which use iterators without the need of a sophisticated heap analysis.

show abstract

Checking and inferring local non-aliasing

Cited by 16 publications

References 0 publications

Inference of Reference Immutability

Inference of Reference Immutability

Field-Sensitive Value Analysis by Field-Insensitive Analysis

From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis

Contact Info

Product

Resources

About