International audienceWe 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 the logic works with space credits, a resource that is consumed when an object is allocated and produced when a group of objects is logically deallocated, that is, when the user is able to prove that it has become unreachable and therefore can be collected. To prove such a fact, the user maintains pointed-by assertions that record the immediate predecessors of every object. Our calculus, SpaceLang, has mutable state, shared-memory concurrency, and code pointers. We prove that SL⋄ is sound and present several simple examples of its use
Static program analysis can improve programmer productivity and software reliability by definitively...
We propose a type-directed garbage collection (GC) scheme for a programming language with static mem...
We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in w...
International audienceWe present SL⋄, a Separation Logic that allows controlling the heap space cons...
We present a Separation Logic with space credits for reasoning about heapspace in a sequential call-...
International audienceWe present a Separation Logic with space credits for reasoning about heapspace...
We develop a series of calculi that are just low-level enough that we can express allocation and gar...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Separation logic (SL) is an extension of Hoare logic by operations and formulas that not only talk a...
AbstractWe introduce a space-improvement relation on programs which guarantees that whenever M is im...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
This thesis presents structural separation logic, a novel program reasoning approach for software th...
Separation logic began by describing total separation between the heap space used by separate parts ...
We present a formal model of memory that both captures the low-level features of C’s pointers and me...
Abstract. Separation Logic is a recent development in programming logic which has been applied by Pe...
Static program analysis can improve programmer productivity and software reliability by definitively...
We propose a type-directed garbage collection (GC) scheme for a programming language with static mem...
We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in w...
International audienceWe present SL⋄, a Separation Logic that allows controlling the heap space cons...
We present a Separation Logic with space credits for reasoning about heapspace in a sequential call-...
International audienceWe present a Separation Logic with space credits for reasoning about heapspace...
We develop a series of calculi that are just low-level enough that we can express allocation and gar...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
Separation logic (SL) is an extension of Hoare logic by operations and formulas that not only talk a...
AbstractWe introduce a space-improvement relation on programs which guarantees that whenever M is im...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
This thesis presents structural separation logic, a novel program reasoning approach for software th...
Separation logic began by describing total separation between the heap space used by separate parts ...
We present a formal model of memory that both captures the low-level features of C’s pointers and me...
Abstract. Separation Logic is a recent development in programming logic which has been applied by Pe...
Static program analysis can improve programmer productivity and software reliability by definitively...
We propose a type-directed garbage collection (GC) scheme for a programming language with static mem...
We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in w...