We present a simple, but expressive type system that supports strong updates–updating a
memory cell to hold values of unrelated types at different points in time. Our formulation is …

We present SL♢, a Separation Logic that allows controlling the heap space consumption of
a program in the presence of dynamic memory allocation and garbage collection. A user of …

We present a new type system for an object-oriented (OO) language that characterizes the
sizes of data structures and the amount of heap memory required to successfully execute …

Linear typing schemes guarantee single-threadedness and so the soundness of in-place
update with respect to a functional semantics. But linear schemes are restrictive in practice …

We explore foundational typing support for strong updates—updating a memory cell to hold
values of unrelated types at different points in time. We present a simple, but expressive type …

Abstract We present the Mobile Resource Guarantees framework: a system for ensuring that
downloaded programs are free from run-time violations of resource bounds. Certificates are …

The concept of a" unique" object arises in many emerging programming languages such as
Clean, CQual, Cyclone, TAL, and Vault. In each of these systems, unique objects make it …

We verify the functional correctness of an array-of-bins (segregated free-lists) single-thread
malloc/free system with respect to a correctness specification written in separation logic. The …

We present a certified algorithm for resource usage analysis, applicable to languages in the
style of Java byte code. The algorithm verifies that a program executes in bounded memory …

This paper presents a model-based framework for the symbolic animation of object-oriented
specifications. A customized set-theoretic solver is used to simulate the execution of the …