Separation Logic: A Logic for Shared Mutable Data Structures

Separation Logic: A Logic for Shared Mutable Data Structures (2002)

Cached

Download Links

Other Repositories/Bibliography

CiteULike
DBLP

by John Reynolds

Citations:

666 - 6 self

BibTeX

@INPROCEEDINGS{Reynolds02separationlogic:,
    author = {John Reynolds},
    title = {Separation Logic: A Logic for Shared Mutable Data Structures},
    booktitle = {},
    year = {2002},
    pages = {55--74},
    publisher = {IEEE Computer Society}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

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 low-level imperative programs that use shared mutable data structure.

Citations

72	Some techniques for proving correctness of programs which alter data structures - Burstall - 1972
44	O'Hearn: Computability and Complexity Results for a Spatial Assertion Language for Data Structures - Calcagno, Yang, et al.
20	Program logic and equivalence in the presence of garbage collection - Calcagno, O’Hearn, et al. - 2003
11	Verifiable and executable specifications of concurrent objects in Lπ - Caires, Monteiro - 1998
5	Semantic and Logical Properties of Stateful Programmming - Calcagno - 2002
5	On garbage and program logic - Calcagno, O’Hearn - 2001
2	Explicit description in BI pointer logic. Unpublished - Bornat - 2001
2	Program logics in the presence of garbage collection (abstract - Calcagno - 2001
1	Explicit description - Bornat