Results 1 - 10 of 1,603

Separation Logic and Abstraction

by Matthew Parkinson, Gavin Bierman , 2005
"... In this paper we address the problem of writing specifications for programs that use various forms of modularity, including procedures and Java-like classes. We build on the formalism of separation logic and introduce the new notion of an abstract predicate and, more generally, abstract predicate fa ..."
Abstract - Cited by 165 (9 self) - Add to MetaCart
In this paper we address the problem of writing specifications for programs that use various forms of modularity, including procedures and Java-like classes. We build on the formalism of separation logic and introduce the new notion of an abstract predicate and, more generally, abstract predicate

Higher-Order Separation Logic and Abstraction

by unknown authors
"... Abstract. We present a simple extension of separation logic which makes the specification language higher order, in the sense that quantification over predicates and higher types is possible. The force of this extension is illustrated via examples; specifically we demonstrate that existential and un ..."
Abstract - Add to MetaCart
Abstract. We present a simple extension of separation logic which makes the specification language higher order, in the sense that quantification over predicates and higher types is possible. The force of this extension is illustrated via examples; specifically we demonstrate that existential

Bi hyperdoctrines, higher-order separation logic, and abstraction

by Bodil Biering, Lars Birkedal, Noah Torp-Smith - IN ESOP’05, LNCS , 2005
"... We present a precise correspondence between separation logic and a simple notion of predicate BI, extending the earlier correspondence given between part of separation logic and propositional BI. Moreover, we introduce the notion of a BI hyperdoctrine and show that it soundly models classical and in ..."
Abstract - Cited by 67 (25 self) - Add to MetaCart
and intuitionistic first- and higher-order predicate BI, and use it to show that we may easily extend separation logic to higher-order. We also demonstrate that this extension is important for program proving, since it provides sound reasoning principles for data abstraction in the presence of

Permission Accounting in Separation Logic (Extended Abstract)

by Richard Bornat, Cristiano Calcagno, Peter O'Hearn, Matthew Parkinson
"... Separation logic began by describing total separation between the heap space used by separate parts of a program. It has moved on to consider how total and partial permissions to access heap elements can be transferred between concurrent threads. The roots of the new approach are in Boyland's [ ..."
Abstract - Add to MetaCart
Separation logic began by describing total separation between the heap space used by separate parts of a program. It has moved on to consider how total and partial permissions to access heap elements can be transferred between concurrent threads. The roots of the new approach are in Boyland

Local action and abstract separation logic

by Cristiano Calcagno, Peter W. O’Hearn, Hongseok Yang - IN PROC. 22ND ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS’07 , 2007
"... Separation logic is an extension of Hoare’s logic which supports a local way of reasoning about programs that mutate memory. We present a study of the semantic structures lying behind the logic. The core idea is of a local action, a state transformer that mutates the state in a local way. We formula ..."
Abstract - Cited by 109 (11 self) - Add to MetaCart
formulate local actions for a general class of models called separation algebras, abstracting from the RAM and other specific concrete models used in work on separation logic. Local actions provide a semantics for a generalized form of (sequential) separation logic. We also show that our conditions on local

Symbolic execution with separation logic

by Josh Berdine, Cristiano Calcagno, Peter W. O’hearn, Queen Mary - In APLAS , 2005
"... Abstract. We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame axiom ..."
Abstract - Cited by 144 (28 self) - Add to MetaCart
Abstract. We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame

A local shape analysis based on separation logic

by Dino Distefano, Peter W. O’Hearn, Hongseok Yang - IN: 12TH INTERNATIONAL CONFERENCE ON TOOLS AND ALGORITHMS FOR , 2006
"... We describe a program analysis for linked list programs where the abstract domain uses formulae from separation logic. ..."
Abstract - Cited by 161 (24 self) - Add to MetaCart
We describe a program analysis for linked list programs where the abstract domain uses formulae from separation logic.

Giotto: A time-triggered language for embedded programming

by Thomas A. Henzinger, Benjamin Horowitz, Christoph Meyer Kirsch - PROCEEDINGS OF THE IEEE , 2001
"... Giotto provides an abstract programmer's model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic software tasks together with a mode switching logic for enabling and disabling tasks. Giotto speci es timetrigger ..."
Abstract - Cited by 286 (37 self) - Add to MetaCart
Giotto provides an abstract programmer's model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic software tasks together with a mode switching logic for enabling and disabling tasks. Giotto speci es

Types, Bytes and Separation Logic

by Harvey Tuch, Gerwin Klein, Michael Norrish , 2007
"... We present a formal model of memory that both captures the low-level features of C’s pointers and memory, and that forms the basis for an expressive implementation of separation logic. At the low level, we do not commit common oversimplifications, but correctly deal with C’s model of programming lan ..."
Abstract - Cited by 84 (25 self) - Add to MetaCart
language values and the heap. At the level of separation logic, we are still able to reason abstractly and efficiently. We implement this framework in the theorem prover Isabelle/HOL and demonstrate it on two case studies. We show that the divide between detailed and abstract does not impose undue

A semantics for concurrent separation logic

by Stephen Brookes - Theoretical Computer Science , 2004
"... Abstract. We present a denotational semantics based on action traces, for parallel programs which share mutable data and synchronize using resources and conditional critical regions. We introduce a resource-sensitive logic for partial correctness, adapting separation logic to the concurrent setting, ..."
Abstract - Cited by 108 (1 self) - Add to MetaCart
Abstract. We present a denotational semantics based on action traces, for parallel programs which share mutable data and synchronize using resources and conditional critical regions. We introduce a resource-sensitive logic for partial correctness, adapting separation logic to the concurrent setting
Results 1 - 10 of 1,603