Graphical models of separation logic

Graphs are used to model control and data flow among events occurring in the execution of a concurrent program. Our treatment of data flow covers both shared storage and external communication. Nevertheless, the laws of Hoare and Jones correctness reasoning remain valid when interpreted in this general model.

[1]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[2]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[3]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[4]  Peter W. O'Hearn,et al.  Local Action and Abstract Separation Logic , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[5]  David J. Pym,et al.  A Calculus and logic of resources and processes , 2006, Formal Aspects of Computing.

[6]  Vaughan R. Pratt,et al.  The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial , 1984, Seminar on Concurrency.

[7]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[8]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[9]  Cliff B. Jones,et al.  Developing methods for computer programs including a notion of interference , 1981 .

[10]  Stephen D. Brookes.  The Essence of Parallel Algol , 2002, Inf. Comput..

[11]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[12]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[13]  Georg Struth,et al.  Foundations of Concurrent Kleene Algebra , 2009, RelMiCS.

[14]  Philippa Gardner,et al.  Context logic as modal logic: completeness and parametric inexpressivity , 2007, POPL '07.

[15]  Peter W. O'Hearn,et al.  Possible worlds and resources: the semantics of BI , 2004, Theor. Comput. Sci..

[16]  Georg Struth,et al.  Automated Reasoning in Kleene Algebra , 2007, CADE.

[17]  Dexter Kozen,et al.  On Kleene Algebras and Closed Semirings , 1990, MFCS.

[18]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[19]  Peter W. O'Hearn,et al.  Resources, Concurrency and Local Reasoning , 2004, CONCUR.

[20]  Georg Struth,et al.  Concurrent Kleene Algebra , 2009, CONCUR.

[21]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[22]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.