We present an imperative object calculus where types are annotated with qualifiers for
aliasing and mutation control. There are two key novelties with respect to similar proposals …

In mainstream languages with state and explicit mutations, unwanted aliasing relations are
common bugs. This is exasperated by concurrency mechanisms, since unpredicted aliasing …

We introduce a type and effect system, for an imperative object calculus, which infers
sharing possibly introduced by the evaluation of an expression. Sharing is directly …

In this paper we use pre-existing language support for both reference and object capabilities
to enable sound runtime verification of representation invariants. Our invariant protocol is …

We present a type and effect system for expressing uniqueness and immutability properties
in imperative languages. The distinguishing feature is that typechecking infers sharing …

We outline a type and effect system which infers sharing possibly introduced by the
evaluation of an expression. In this way, expressions get very expressive types, which …

Traditionally, semantic models of imperative languages use an auxiliary structure which
mimics memory. In this way, ownership and other encapsulation properties need to be …

Programming languages have become an unavoidable tool, not only for computer experts,
but also for scientists and engineers from all horizons. For the sake of usability, modern …

We present an imperative object calculus where types are annotated with modifiers for
aliasing control. There are two key novelties wrt similar proposals. First, the expressivity of …

We present an imperative object calculus where types are annotated with qualifiers for
aliasing and mutation control. There are two key novelties with respect to similar proposals …