An Overview of Separation Logic

After some general remarks about program verification, we introduce separation logic, a novel extension of Hoare logic that can strengthen the applicability and scalability of program verification for imperative programs that use shared mutable data structures or shared-memory concurrency.

[1]  Peter W. O'Hearn,et al.  BI as an assertion language for mutable data structures , 2001, POPL '01.

[2]  David Walker,et al.  Alias Types for Recursive Data Structures , 2000, Types in Compilation.

[3]  Peter W. O'Hearn,et al.  A Decidable Fragment of Separation Logic , 2004, FSTTCS.

[4]  Peter W. O'Hearn,et al.  Permission accounting in separation logic , 2005, POPL '05.

[5]  Zhong Shao,et al.  Certified assembly programming with embedded code pointers , 2006, POPL '06.

[6]  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.

[7]  Zhong Shao,et al.  Building certified libraries for PCC: dynamic storage allocation , 2003, Sci. Comput. Program..

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

[9]  Stephen D. Brookes,et al.  A Semantics for Concurrent Separation Logic , 2004, CONCUR.

[10]  Xavier Leroy,et al.  Types in Compilation , 1998, Lecture Notes in Computer Science.

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

[12]  Hongseok Yang,et al.  Local reasoning for stateful programs , 2001 .

[13]  Lars Birkedal,et al.  BI Hyperdoctrines and Higher-Order Separation Logic , 2005, ESOP.

[14]  John C. Reynolds,et al.  Intuitionistic reasoning about shared mutable data structure , 1999 .

[15]  Peter W. O'Hearn,et al.  Refinement and Separation Contexts , 2004, FSTTCS.

[16]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[17]  Hongseok Yang,et al.  An Example of Local Reasoning in BI Pointer Logic: the Schorr−Waite Graph Marking Algorithm , 2001 .

[18]  Peter W. O'Hearn,et al.  Separation and information hiding , 2004, POPL.

[19]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[20]  Peter W. O'Hearn,et al.  Program logic and equivalence in the presence of garbage collection , 2003, Theor. Comput. Sci..

[21]  Peter W. O'Hearn,et al.  Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.

[22]  Kousha Etessami,et al.  Verifying Probabilistic Procedural Programs , 2004, FSTTCS.

[23]  Ivana Mijajlovic.  Refinement in a Separation Context , 2004 .

[24]  Hongseok Yang,et al.  Semantics of separation-logic typing and higher-order frame rules , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[25]  Lars Birkedal,et al.  Local reasoning about a copying garbage collector , 2004, POPL '04.

[26]  Ramesh Hariharan,et al.  FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science , 2001, Lecture Notes in Computer Science.