John Reynolds  Home/Search
Context Related
Links: DBLP | cmu.edu/user/jcr/seplogic.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/user/jcr/www/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Cited by: More
Automated Verification of the Deutsch-Schorr-Waite - Tree-Traversal Algorithm Alexey (Correct)
A Semantics for Procedure Local Heaps - And Its Ions (Correct)
A Marriage of Rely/Guarantee and Separation - Logic Viktor Vafeiadis (Correct)
Active bibliography (related documents): More All
1.7: Expressions, Commands, and Assertions - Reynolds (2002) (Correct)
0.7: Lectures on Reasoning about Shared Mutable Data Structure Part 1 - Reynolds (2000) (Correct)
0.6: Semantic and Logical Properties of Stateful Programming - Calcagno (2002) (Correct)
Similar documents based on text: More All
0.2: Reasoning about Shared Mutable Data Structure - Reynolds, O'Hearn (2001) (Correct)
0.2: Hoare Logic and Auxiliary Variables - Kleymann (1998) (Correct)
0.2: Local Reasoning about Programs that Alter Data Structures - O'Hearn, Reynolds, Yang (2001) (Correct)
Related documents from co-citation: More All
36: Local reasoning about programs that alter data structures (context) - O'Hearn, Reynolds et al. - 2001
34: BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2000
34: A spatial logic for concurrency - Caires, Cardelli - 2001
BibTeX entry: (Update)
J. C. Reynolds. Separation logic: a logic for shared mutable data structures. Invited Paper, LICS'02, 2002. 29 http://citeseer.ist.psu.edu/reynolds02separation.html More
@misc{ reynolds02separation,
author = "J. Reynolds",
title = "Separation logic: a logic for shared mutable data structures",
text = "J. C. Reynolds. Separation logic: a logic for shared mutable data structures.
Invited Paper, LICS'02, 2002. 29",
year = "2002",
url = "citeseer.ist.psu.edu/reynolds02separation.html" }
Citations (may not include all citations):650 An axiomatic basis for computer programming (context) - Hoare - 1969 ACM DBLP
362 Dynamic Logic - Harel, Kozen et al. - 2000 ACM
274 Prentice-Hall International (context) - Reynolds, of - 1981
110 BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2001 ACM DBLP
97 Stack-based typed assembly language - Morrisett, Crary et al. - 1998 ACM DBLP
88 Intuitionistic reasoning about shared mutable data structure - Reynolds - 2000
88 Implementation of the typed callby -value -calculus using a.. (context) - Tofte, Talpin - 1994
82 Alias types for recursive data structures - Walker, Morrisett - 2071 ACM DBLP
82 anywhere: Modal logics for mobile ambients (context) - Cardelli, Gordon - 2000
58 The logic of bunched implications (context) - O'Hearn, Pym - 1999
58 Local reasoning about programs that alter data structures (context) - O'Hearn, Reynolds et al. - 2001 ACM DBLP
45 The Semantics and Proof Theory of the Logic of Bunched Impli.. (context) - Pym - 2002
44 Verifying properties of parallel programs: An axiomatic appr.. (context) - Owicki, Gries - 1976 DBLP
43 Towards a theory of parallel programming (context) - Hoare - 1972 ACM
42 A query language based on the ambient logic - Cardelli, Ghelli - 2001 ACM DBLP
41 Some techniques for proving correctness of programs which al.. (context) - Burstall - 1972
37 A spatial logic for querying graphs - Cardelli, Gardner et al. - 2002 ACM DBLP
31 Proof of a program: FIND (context) - Hoare - 1971 DBLP
20 Computability and complexity results for a spatial assertion.. - Calcagno, Yang et al. - 2001 ACM DBLP
17 Local Reasoning for Stateful Programs (context) - Yang - 2001 ACM
15 Lectures on reasoning about shared mutable data structure - Reynolds - 2000
10 A semantic basis for local reasoning - Yang, O'Hearn - 2002 ACM DBLP
8 Reasoning about shared mutable data structure - Reynolds, O'Hearn - 2001
8 Proof-search and countermodel generation in propositional BI.. - Galmiche, Mery - 2001 ACM DBLP
8 The query language TQL - Conforti, Ghelli et al. - 2002 DBLP
7 Verifiable and executable specifications of concurrent objec.. (context) - Caires, Monteiro - 1998
6 An example of local reasoning in BI pointer logic: The Schor.. - Yang - 2001
6 Resource tableaux (context) - Galmiche, Mery et al. - 2002 ACM DBLP
5 Program logic and equivalence in the presence of garbage col.. - Calcagno, O'Hearn et al. - 2001 ACM DBLP
4 Semantic and Logical Properties of Stateful Programmming - Calcagno - 2002
4 Notes on separation logic for shared-variable concurrency (context) - O'Hearn - 2002
4 On garbage and program logic - Calcagno, O'Hearn - 2030 ACM DBLP
3 Program logics in the presence of garbage collection (context) - Calcagno - 2001
1 Notes on conditional critical regions in spatial pointer log.. (context) - O'Hearn - 2001
1 Explicit description in BI pointer logic (context) - Bornat - 2001
The graph only includes citing articles where the year of publication is known.
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