Inference of Reference Immutability

Quinonez, Jaime; Tschantz, Matthew S.; Ernst, M.

doi:10.1007/978-3-540-70592-5_26

Cited by 27 publications

(18 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To find the correct classification, we first ran every tool available to us (including our analysis pipelines, Sȃlcianu's tool, and the Javarifier (Tschantz 2006;Quinonez et al 2008) type inference tool for Javari). Then, we manually verified the correct classification for every parameter where any two tool results differed, or where only one tool completed successfully.…”

Section: Methodology and Measurementsmentioning

confidence: 99%

Parameter reference immutability: formal definition, inference tool, and comparison

Artzi¹,

Kiežun²,

Quinonez³

et al. 2008

Autom Softw Eng

Self Cite

View full text Add to dashboard Cite

Knowing which method parameters may be mutated during a method's execution is useful for many software engineering tasks. A parameter reference is immutable if it cannot be used to modify the state of its referent object during the method's execution. We formally define this notion, in a core object-oriented language. Having the formal definition enables determining correctness and accuracy of tools approximating this definition and unbiased comparison of analyses and tools that approximate similar definitions.We present Pidasa, a tool for classifying parameter reference immutability. Pidasa combines several lightweight, scalable analyses in stages, with each stage refining the overall result. The resulting analysis is scalable and combines the strengths of its component analyses. As one of the component analyses, we present a novel dynamic mutability analysis and show how its results can be improved by random input generation. Experimental results on programs of up to 185 kLOC show that, compared to previous approaches, Pidasa increases both run-time performance and overall accuracy of immutability inference.

show abstract

Section: Methodology and Measurementsmentioning

confidence: 99%

Parameter reference immutability: formal definition, inference tool, and comparison

Artzi¹,

Kiežun²,

Quinonez³

et al. 2008

Autom Softw Eng

Self Cite

View full text Add to dashboard Cite

show abstract

“…Birka's case studies involved 160,000 lines of annotated code. The JavaCOP [3] and JQual [34] Javarifier [51,13,48] is a sound and precise type inference for Javari. Artzi et al [4] give a detailed comparison of four immutability inference tools, including JQual and Javarifier.…”

Section: Javarimentioning

confidence: 99%

Practical pluggable types for java

Papi

Ali

Correa

et al. 2008

Proceedings of the 2008 International Symposium on Software Testing and Analysis

Self Cite

139

View full text Add to dashboard Cite

This paper introduces the Checker Framework, which supports adding pluggable type systems to the Java language in a backward-compatible way. A type system designer defines type qualifiers and their semantics, and a compiler plug-in enforces the semantics. Programmers can write the type qualifiers in their programs and use the plug-in to detect or prevent errors. The Checker Framework is useful both to programmers who wish to write error-free code, and to type system designers who wish to evaluate and deploy their type systems.The Checker Framework includes new Java syntax for expressing type qualifiers; declarative and procedural mechanisms for writing type-checking rules; and support for flowsensitive local type qualifier inference and for polymorphism over types and qualifiers. The Checker Framework is well-integrated with the Java language and toolset.We have evaluated the Checker Framework by writing five checkers and running them on over 600K lines of existing code. The checkers found real errors, then confirmed the absence of further errors in the fixed code.

show abstract

“…JQual Immutability [18] Javarifier [34] for Javari [40] Pidasa [5] ReImInfer [21] for ReIm [21] Ownership Java Inferring Universe Types [11] Inferring Ownership [20] which are fully automatic and operate in batch mode. Each of the existing qualifier inference tools is imprecise, rigid, unpredictable, and specific to a single qualifier checker.…”

Section: Type Qualifiersmentioning

confidence: 99%

“…The burden of annotating code with qualifiers is a major obstacle to the adoption of qualifier systems. Realizing the burden of adding qualifiers, researchers have developed myriad qualifier inference tools [5], [9], [11]- [13], [18], [20], [21], [21]- [23], [26], [30], [34], [37], [38], [40]. These tools employ static analysis, dynamic analysis, or a combination of the two.…”

Section: Introductionmentioning

confidence: 99%

Cascade: A Universal Programmer-Assisted Type Qualifier Inference Tool

Vakilian¹,

Phaosawasdi²,

Ernst³

et al. 2015

2015 IEEE/ACM 37th IEEE International Conference on Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract-Type qualifier inference tools usually operate in batch mode and assume that the program must not be changed except to add the type qualifiers. In practice, programs must be changed to make them type-correct, and programmers must understand them. CASCADE is an interactive type qualifier inference tool that is easy to implement and universal (i.e., it can work for any type qualifier system for which a checker is implemented). It shows that qualifier inference can achieve better results by involving programmers rather than relying solely on automation.

show abstract

Inference of Reference Immutability

Cited by 27 publications

References 25 publications

Parameter reference immutability: formal definition, inference tool, and comparison

Parameter reference immutability: formal definition, inference tool, and comparison

Practical pluggable types for java

Cascade: A Universal Programmer-Assisted Type Qualifier Inference Tool

Contact Info

Product

Resources

About