Local Action and Abstract Separation Logic

Calcagno, Cristiano; O’Hearn, Peter W.; Yang, Hongseok

doi:10.1109/lics.2007.30

Cited by 211 publications

(328 citation statements)

References 36 publications

Supporting

Mentioning

327

Contrasting

Order By: Relevance

“…In [9], these two properties were amalgamated and formulated for abstract functions on arbitrary separation algebras. Definition 2.6 (Local Function).…”

Section: Footprints In Local Reasoningmentioning

confidence: 99%

“…Our Hoare reasoning framework is formulated with tuples of pre-and post-conditions, rather than the usual Hoare triples that include the function as in [9]. In our case the standard triple shall be expressed as a function f satisfying a tuple (p, q), written f |= (p, q).…”

Section: Lemma 211 (Precision Characterization)mentioning

confidence: 99%

“…The discussion in this paper is based on the framework introduced in [9], where the approach of local reasoning about programs with separation logic was generalised to local reasoning about local functions that act on an abstract model of resource. Our objective in this work is to investigate the notion of footprint in this abstract setting, and this section gives a description of the underlying framework.…”

Section: Introductionmentioning

confidence: 99%

“…Now that we have regained the safety footprints for AD in the new model, we want to know if this is generally the case for any program. We consider the abstract imperative programming language given in [9]:…”

mentioning

confidence: 99%

“…As discussed in [9], conditionals and while loops can be encoded using + and (·) ⋆ and assume statements. The denotational semantics of commands is given in Figure 2.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Footprints in Local Reasoning

Raza¹,

Gardner²

2009

Logical Methods in Computer Science

View full text Add to dashboard Cite

ABSTRACT. Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint -that part of the resource accessed by the program. We address the problem of formally characterising and analysing the notion of footprint for abstract local functions introduced by Calcagno, O'Hearn and Yang. With our definition, we prove that the footprints are the only essential elements required for a complete specification of a local function. We formalise the notion of small specifications in local reasoning and show that, for well-founded resource models, a smallest specification always exists that only includes the footprints. We also present results for the non-well-founded case. Finally, we use this theory of footprints to investigate the conditions under which the footprints correspond to the smallest safe states. We present a new model of RAM in which, unlike the standard model, the footprints of every program correspond to the smallest safe states. We also identify a general condition on the primitive commands of a programming language which guarantees this property for arbitrary models.

show abstract

“…In [9], these two properties were amalgamated and formulated for abstract functions on arbitrary separation algebras. Definition 2.6 (Local Function).…”

Section: Footprints In Local Reasoningmentioning

confidence: 99%

Section: Lemma 211 (Precision Characterization)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

“…As discussed in [9], conditionals and while loops can be encoded using + and (·) ⋆ and assume statements. The denotational semantics of commands is given in Figure 2.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Footprints in Local Reasoning

Raza¹,

Gardner²

2009

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

On the Structure of Generalized Effect Algebras and Separation Algebras

Alexander

Jipsen

Upegui

2018

Relational and Algebraic Methods in Computer Science

View full text Add to dashboard Cite

Safe Deferred Memory Reclamation with Types

Kuru

Gordon

2019

Programming Languages and Systems

View full text Add to dashboard Cite

Memory management in lock-free data structures remains a major challenge in concurrent programming. Design techniques including read-copy-update (RCU) and hazard pointers provide workable solutions, and are widely used to great effect. These techniques rely on the concept of a grace period: nodes that should be freed are not deallocated immediately, and all threads obey a protocol to ensure that the deallocating thread can detect when all possible readers have completed their use of the object. This provides an approach to safe deallocation, but only when these subtle protocols are implemented correctly. We present a static type system to ensure correct use of RCU memory management: that nodes removed from a data structure are always scheduled for subsequent deallocation, and that nodes are scheduled for deallocation at most once. As part of our soundness proof, we give an abstract semantics for RCU memory management primitives which captures the fundamental properties of RCU. Our type system allows us to give the first proofs of memory safety for RCU linked list and binary search tree implementations without requiring full verification.

show abstract

Local Action and Abstract Separation Logic

Cited by 211 publications

References 36 publications

Footprints in Local Reasoning

Footprints in Local Reasoning

On the Structure of Generalized Effect Algebras and Separation Algebras

Safe Deferred Memory Reclamation with Types

Contact Info

Product

Resources

About