Ownership and immutability in generic Java

Zibin, Yoav; Potanin, Alex; Li, Paley; Ernst, M.

doi:10.1145/1869459.1869509

Cited by 33 publications

(24 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, we build on Immutability Generic Java (IGJ) which encodes object and reference immutability using Java generics [41]. Subsequent work extends these ideas to allow (1) richer ownership patterns for creating immutable cyclic structures [42], (2) unique references, and ways to recover immutability after violating uniqueness, without requiring an alias analysis [13].…”

Section: Analyzing Typescript Feldthaus Et Al Present a Hybrid Analymentioning

confidence: 99%

Refinement types for TypeScript

VekrisPanagiotis¹,

CosmanBenjamin²,

JhalaRanjit³

2016

SIGPLAN Not.

View full text Add to dashboard Cite

We present Refined TypeScript (RSC), a lightweight refinement type system for TypeScript, that enables static verification of higher-order, imperative programs. We develop a formal core of RSC that delineates the interaction between refinement types and mutability. Next, we extend the core to account for the imperative and dynamic features of TypeScript. Finally, we evaluate RSC on a set of real world benchmarks, including parts of the Octane benchmarks, D3, Transducers, and the TypeScript compiler.

show abstract

Section: Analyzing Typescript Feldthaus Et Al Present a Hybrid Analymentioning

confidence: 99%

Refinement types for TypeScript

VekrisPanagiotis¹,

CosmanBenjamin²,

JhalaRanjit³

2016

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Qualifier systems have been developed in these frameworks for checking software properties such as null safety [8], [33], tainting [8], [33], format strings [35], [44], internationalization [33], regular expressions [36], UI threading [17], ownership [20], and immutability [21], [33], [40], [46].…”

Section: Type Qualifiersmentioning

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

“…Notable examples include reference immutability [22,44,49,50], and the owner-as-modifier interpretation of ownership and universe types [14]. Rely-guarantee references generalize reference immutability permissions (Section 3.3), allowing precise control over what modification is permitted through a given alias, not simply a choice between arbitrary mutation and local immutability.…”

Section: Related Workmentioning

confidence: 99%

Rely-guarantee references for refinement types over aliased mutable data

2013

Self Cite

View full text Add to dashboard Cite

Reasoning about side effects and aliasing is the heart of verifying imperative programs. Unrestricted side effects through one reference can invalidate assumptions about an alias. We present a new type system approach to reasoning about safe assumptions in the presence of aliasing and side effects, unifying ideas from reference immutability type systems and rely-guarantee program logics. Our approach, rely-guarantee references, treats multiple references to shared objects similarly to multiple threads in rely-guarantee program logics. We propose statically associating rely and guarantee conditions with individual references to shared objects. Multiple aliases to a given object may coexist only if the guarantee condition of each alias implies the rely condition for all other aliases. We demonstrate that existing reference immutability type systems are special cases of rely-guarantee references.In addition to allowing precise control over state modification, rely-guarantee references allow types to depend on mutable data while still permitting flexible aliasing. Dependent types whose denotation is stable over the actions of the rely and guarantee conditions for a reference and its data will not be invalidated by any action through any alias. We demonstrate this with refinement (subset) types that may depend on mutable data. As a special case, we derive the first reference immutability type system with dependent types over immutable data.We show soundness for our approach and describe experience using rely-guarantee references in a dependently-typed monadic DSL in COQ.

show abstract

Ownership and immutability in generic Java

Cited by 33 publications

References 29 publications

Refinement types for TypeScript

Refinement types for TypeScript

Cascade: A Universal Programmer-Assisted Type Qualifier Inference Tool

Rely-guarantee references for refinement types over aliased mutable data

Contact Info

Product

Resources

About