Rely-Guarantee References for Refinement Types Over Aliased Mutable Data

Gordon, Colin S., Ernst, Michael D., Grossman, Dan

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'13), June 2013, doi: 10.1145/2491956.2462160

pdf url

Abstract

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.

Bibtex

@inproceedings{pldi13,
  title = {{Rely-Guarantee References for Refinement Types Over Aliased Mutable Data}},
  author = {Gordon, Colin S. and Ernst, Michael D. and Grossman, Dan},
  year = 2013,
  booktitle = {{Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and
  Implementation (PLDI'13)}},
  address = {{Seattle, WA, USA}},
  month = {June},
  doi = {10.1145/2491956.2462160},
  abstract = {
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.
  },
  note = "Acceptance Rate 17\% (46/267).",
  url = {http://dl.acm.org/citation.cfm?id=2462160}
}