Results 1  10
of
10
Separation Logic: A Logic for Shared Mutable Data Structures
, 2002
"... In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about lowlevel imperative programs that use shared mutable data structure. ..."
Abstract

Cited by 949 (6 self)
 Add to MetaCart
(Show Context)
In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about lowlevel imperative programs that use shared mutable data structure.
A Spatial Logic for Concurrency (Part II)
 IN CONCUR2002: CONCURRENCY THEORY (13TH INTERNATIONAL CONFERENCE), LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... ..."
(Show Context)
Dynamic Spatial Logics: A Tutorial Survey
"... Spatial logics for concurrency have been proposed with the aim of reasoning about distribution, resource usage, mobility, and other structural aspects of general computing systems. This tutorial aims to introduce and motivate the main intuitions behind the development of dynamic spatial logics, and ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Spatial logics for concurrency have been proposed with the aim of reasoning about distribution, resource usage, mobility, and other structural aspects of general computing systems. This tutorial aims to introduce and motivate the main intuitions behind the development of dynamic spatial logics, and then present some selected results and applications. 1
linked data structures; a proof of the SchorrWaite algorithm. In Manfried
, 1973
"... [1] Rodney M. Burstall. Some techniques for proving correctness of programs ..."
Abstract
 Add to MetaCart
[1] Rodney M. Burstall. Some techniques for proving correctness of programs
Specifying Dynamic Object Systems
, 1998
"... We present a specification logic for dynamic object systems that combines modalities with connectives expressing distribution, hiding and signature extension. The logic is given a semantics in certain abstract process structures and its usefulness illustrated by some simple examples. ..."
Abstract
 Add to MetaCart
We present a specification logic for dynamic object systems that combines modalities with connectives expressing distribution, hiding and signature extension. The logic is given a semantics in certain abstract process structures and its usefulness illustrated by some simple examples.
LPI encodings of choices, exceptions and firstclass events
, 1998
"... In this paper we present a revised and simplified formulation of the Lpi language, and give some evidence for its expressiveness in the context of communication and concurrency abstractions. ..."
Abstract
 Add to MetaCart
In this paper we present a revised and simplified formulation of the Lpi language, and give some evidence for its expressiveness in the context of communication and concurrency abstractions.
Specifications of Processes under Expanding Signatures
, 1998
"... We propose a specification logic based on a ¯calculus enriched with explicit signatures and certain connectives expressing component decomposition and name privacy. This logic is interpreted on certain variants of action calculi of Milner, called herein generative action structures, and that model ..."
Abstract
 Add to MetaCart
We propose a specification logic based on a ¯calculus enriched with explicit signatures and certain connectives expressing component decomposition and name privacy. This logic is interpreted on certain variants of action calculi of Milner, called herein generative action structures, and that model processes that interact in an environment of dynamically extensible signatures. To illustrate this basic framework, a specification logic for compositional reasoning about local and global properties of object systems with mobile features is presented. 1 Introduction Most of the proposed statebased specification logics for concurrent interacting modules or objects (for instance, [13, 5]) assume that computations are carried out over data defined with techniques from algebraic specification, and that objects provide a fixed set of services, both determined at specification time by a given signature. Nevertheless, many existing computational frameworks rely on the use of dynamically generate...
Separation Logic: A Logic for Shared Mutable Data Structures
"... In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about lowlevel imperative programs that use shared mutable data structure. The simple imperative programming language is extended with commands (not ex ..."
Abstract
 Add to MetaCart
(Show Context)
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about lowlevel imperative programs that use shared mutable data structure. The simple imperative programming language is extended with commands (not expressions) for accessing and modifying shared structures, and for explicit allocation and deallocation of storage. Assertions are extended by introducing a “separating conjunction ” that asserts that its subformulas hold for disjoint parts of the heap, and a closely related “separating implication”. Coupled with the inductive definition of predicates on abstract data structures, this extension permits the concise and flexible description of structures with controlled sharing. In this paper, we will survey the current development of this program logic, including extensions that permit unrestricted address arithmetic, dynamically allocated arrays, and recursive procedures. We will also discuss promising future directions. 1.