In the verification of programs that manipulate the heap, logics that emphasize localized reasoning, such as separation logic, are being used extensively. In such logics, state conditions may only refer to parts of the heap that are reachable from the stack. However, the correct implementation of some data structures is based on state conditions that depend on unreachable locations. For example...

We present a new connection between self-adjusting binary search trees (BSTs) and heaps, two fundamental, extensively studied, and practically relevant families of data structures (Allen, Munro, 1978; Sleator, Tarjan, 1983; Fredman, Sedgewick, Sleator, Tarjan, 1986; Wilber, 1989; Fredman, 1999; Iacono, Özkan, 2014). Roughly speaking, we map an arbitrary heap algorithm within a broad and natural...

Ownership confinement expresses encapsulation in heap structures, in support of modular reasoning about effects, representation independence, and other properties. This paper studies heap encapsulation from the perspective of substitutability for the class construct of Java-like languages and a particular form of confinement is justified by a representation independence result. A syntax-directe...

This paper describes a general approach for automatic and accurate space and space-bound analyses for high-level languages, considering stack space, heap allocation and live heap space usage of programs. The approach is based on program analysis and transformations and is fully automatic. The analyses produce accurate upper bounds in the presence of partially known input structures. The analyse...

This paper describes a general approach for optimized live heap space and live heap space-bound analyses for garbage-collected languages. The approach is based on program analysis and transformations and is fully automatic. In our experience, the space-bound analysis generally produces accurate (tight) upper bounds in the presence of partially known input structures. The optimization drasticall...

In this lecture we extend our language with the ability to allocate data structures on the so-called heap. Addresses of heap elements serve as pointers which can be dereferenced to read stored values, or used as destinations for write operations. Similarly, arrays are stored on the heap1 and via appropriate address calculations. Adding mutable store requires yet again a significant change in th...

With the proliferation of online source code repositories such as GitHub and BitBucket, programmers have instant access to countless code examples. With the availability of these resources the focus in software development shifts away from writing code towards understanding source code. Many common algorithms, that see a lot of reuse across different problem domains, involve complex manipulatio...

For the past 60 yr, chromate-copper-arsenate (CCA) has been used to pressure-treat millions of cubic meters of wood in the United States for the construction of many outdoor structures. Leaching of arsenic from these structures is a possible health concern as there exists the potential for soil and groundwater contamination. While previous studies have focused on total arsenic concentrations le...