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...
International audienceThis article presents the formal verification, using the Coq proof assistant, ...
Heap-manipulating programs are known to be challenging to reason about. We present a novel verifier ...
International audienceWe present SL⋄, a Separation Logic that allows controlling the heap space cons...
International audienceWe present a Separation Logic with space credits for reasoning about heapspace...
We present a Separation Logic with space credits for reasoning about heapspace in a sequential call-...
AbstractIt is generally thought that reasoning about programs in memory safe, garbage collected lang...
We show how abstract requirements of garbage collection can be captured using temporal logic. The te...
The peak heap consumption of a program is the maximum size of the live data on the heap during the e...
This thesis presents structural separation logic, a novel program reasoning approach for software th...
Separation Logic brought a major breakthrough in the area of program verification. Since its introdu...
Published correctness proofs of garbage collectors in separationlogic to date depend on extensive ma...
Our objective is to propose methods for resource-aware compilation inspired by the implicit complexi...
Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexi...
We present a formal model of memory that both captures the low-level features of C’s pointers and me...
Static program analysis can improve programmer productivity and software reliability by definitively...
International audienceThis article presents the formal verification, using the Coq proof assistant, ...
Heap-manipulating programs are known to be challenging to reason about. We present a novel verifier ...
International audienceWe present SL⋄, a Separation Logic that allows controlling the heap space cons...
International audienceWe present a Separation Logic with space credits for reasoning about heapspace...
We present a Separation Logic with space credits for reasoning about heapspace in a sequential call-...
AbstractIt is generally thought that reasoning about programs in memory safe, garbage collected lang...
We show how abstract requirements of garbage collection can be captured using temporal logic. The te...
The peak heap consumption of a program is the maximum size of the live data on the heap during the e...
This thesis presents structural separation logic, a novel program reasoning approach for software th...
Separation Logic brought a major breakthrough in the area of program verification. Since its introdu...
Published correctness proofs of garbage collectors in separationlogic to date depend on extensive ma...
Our objective is to propose methods for resource-aware compilation inspired by the implicit complexi...
Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexi...
We present a formal model of memory that both captures the low-level features of C’s pointers and me...
Static program analysis can improve programmer productivity and software reliability by definitively...
International audienceThis article presents the formal verification, using the Coq proof assistant, ...
Heap-manipulating programs are known to be challenging to reason about. We present a novel verifier ...