(Enter summary)
Abstract: Drawing upon early work by Burstall, we extend Hoare's approach
to proving the correctness of imperative programs, to deal with programs
that perform destructive updates to data structures containing
more than one pointer to the same location. The key concept is an
"independent conjunction" P & Q that holds only when P and Q
are both true and depend upon distinct areas of storage. To make
this concept precise we use an intuitionistic logic of assertions, with a
Kripke semantics whose... (Update)
Cited by: More
Permission Accounting in Separation Logic - Richard Bornat School (2005)
(Correct)
Variables as Resource in Hoare Logics - Matthew Parkinson And (2006)
(Correct)
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003)
(Correct)
Active bibliography (related documents): More All
0.8: Expressions, Commands, and Assertions - Reynolds (2002)
(Correct)
0.4: Lectures on Reasoning about Shared Mutable Data Structure Part 1 - Reynolds (2000)
(Correct)
0.3: Lectures on Reasoning about Shared Mutable Data Structure - Reynolds (2000)
(Correct)
Similar documents based on text: More All
0.3: Semantic and Logical Properties of Stateful Programming - Calcagno (2002)
(Correct)
0.3: Modeless Structure Editing - Sufrin, de Moor (1999)
(Correct)
0.2: Reasoning about Shared Mutable Data Structure - Reynolds, O'Hearn (2001)
(Correct)
Related documents from co-citation: More All
59: BI as an assertion language for mutable data structures
- Ishtiaq, O'Hearn - 2000
29: Separation logic: a logic for shared mutable data structures
- Reynolds - 2002
28: The logic of bunched implications (context) - O'Hearn, Pym - 1999
BibTeX entry: (Update)
Reynolds, J. Intuitionistic reasoning about shared mutable data structure. To appear in the Proceedings of the Symposium in Celebration of the Work of C.A.R. Hoare, 2000. http://citeseer.ist.psu.edu/reynolds00intuitionistic.html More
@misc{ reynolds00intuitionistic,
author = "J. Reynolds",
title = "Intuitionistic reasoning about shared mutable data structure",
text = "Reynolds, J. Intuitionistic reasoning about shared mutable data structure.
To appear in the Proceedings of the Symposium in Celebration of the Work
of C.A.R. Hoare, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/reynolds00intuitionistic.html" }
Citations (may not include all citations):
65
Equivalence in functional languages with effects
- Mason, Talcott - 1991 DBLP
41
Some techniques for proving correctness of programs which al.. (context) - Burstall - 1972
29
A variable typed logic of effects
- Honsell, Mason et al. - 1995 ACM DBLP
18
Proving assertions about programs that manipulate data struc.. (context) - Oppen, Cook - 1975 ACM DBLP
15
An assertion language for data structures (context) - Cook, Oppen - 1975 ACM DBLP
11
Center for the Study of Language and Information (context) - Mason, of et al. - 1986
9
Verification of programs that destructively manipulate data (context) - Mason - 1988 ACM DBLP
4
Correctness of programs manipulating data structures (context) - Kowaltowski - 1973
3
A general axiom of assignment; assignment and linked data st.. (context) - Morris - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/fox-19/member/jcr/www15819A3s2001/15819A3desc.html): More
Alias Types for Recursive Data Structures - Walker, Morrisett (2000)
(Correct)
BI as an Assertion Language for Mutable Data Structures - Ishtiaq, O'Hearn (2000)
(Correct)
An example of local reasoning in BI pointer logic: the.. - Yang (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC