This thesis presents structural separation logic, a novel program reasoning approach for software that manipulates both standard heaps and structured data such as lists and trees. Structural separation logic builds upon existing work in both separation logic and context logic. It considers data abstractly, much as it is exposed by library interfaces, ignoring implementation details. We provide a programming language that works over structural heaps, which are similar to standard heaps but allow data to be stored in an abstract form. We introduce abstract heaps, which extend structural heaps to enable local reasoning about abstract data. Such data can be split up with structural addresses. Structural addresses allow sub-data (e.g. a sub-tre...
Abstract. Separation logic formalizes the idea of local reasoning for heap-manipulating programs via...
AbstractWe study abstract local reasoning for concurrent libraries. There are two main approaches: p...
We present a formal model of memory that both captures the lowlevel features of C’s pointers and mem...
Separation logic (SL) is an extension of Hoare logic by operations and formulas that not only talk a...
Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexi...
Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexi...
Separation Logic brought an advance to program verification of data structures through its use of (r...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
© 2014 The Authors.We study abstract local reasoning for concurrent libraries. There are two main ap...
We describe an extension of Hoare’s logic for reasoning about programs that alter data structures. W...
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
We propose natural proofs for reasoning with programs that ma-nipulate data-structures against speci...
Static program analysis can improve programmer productivity and software reliability by definitively...
Separation logic (SL) is an extension of Hoare logic to reason about programs with mutable data stru...
Abstract. Separation logic formalizes the idea of local reasoning for heap-manipulating programs via...
AbstractWe study abstract local reasoning for concurrent libraries. There are two main approaches: p...
We present a formal model of memory that both captures the lowlevel features of C’s pointers and mem...
Separation logic (SL) is an extension of Hoare logic by operations and formulas that not only talk a...
Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexi...
Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexi...
Separation Logic brought an advance to program verification of data structures through its use of (r...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
© 2014 The Authors.We study abstract local reasoning for concurrent libraries. There are two main ap...
We describe an extension of Hoare’s logic for reasoning about programs that alter data structures. W...
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
We propose natural proofs for reasoning with programs that ma-nipulate data-structures against speci...
Static program analysis can improve programmer productivity and software reliability by definitively...
Separation logic (SL) is an extension of Hoare logic to reason about programs with mutable data stru...
Abstract. Separation logic formalizes the idea of local reasoning for heap-manipulating programs via...
AbstractWe study abstract local reasoning for concurrent libraries. There are two main approaches: p...
We present a formal model of memory that both captures the lowlevel features of C’s pointers and mem...