We show how to efficiently obtain linear a priori bounds on the heap space consumption of
first-order functional programs. The analysis takes space reuse by explicit deallocation into …

We present a Separation Logic with space credits for reasoning about heap space in a
sequential call-by-value lambda-calculus equipped with garbage collection and mutable …

As functional programmers we always face a dilemma: should we write purely functional
code, or sacrifice purity for efficiency and resort to in-place updates? This paper identifies …

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 …

This paper presents a region analysis and transformation framework for Java programs.
Given an input Java program, the compiler automatically translates it into an equivalent …

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 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 …

In the most general sense, dependent types are type-valued functions. This definition
includes, for example, the type operators of Fω such as Pair. When applied to two types S …