论文信息 - Local reasoning, separation and aliasing

Local reasoning, separation and aliasing

Structures built by pointer aliasing, such as DAGs and graphs, are notoriously tricky to deal with. The mechanisms of separation logic can deal with these structures, but so far this has been done by the maintenance of a global invariant. Specifications and proofs which use local reasoning, and which may point the way to a structured programming for pointers, are discussed. An idiom for inclusion sharing, where one structure is included in another, is presented. A notion of ‘partial graphs’ – graphs with dangling pointers – is used to facilitate proof.

Richard Bornat | Cristiano Calcagno

[1] Richard Bornat,et al. Proving Pointer Programs in Hoare Logic , 2000, MPC.

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

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

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

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

[6] William M. Waite,et al. An efficient machine-independent procedure for garbage collection in various list structures , 1967, CACM.

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

[8] David J. Pym,et al. The semantics and proof theory of the logic of bunched implications , 2002, Applied logic series.

[9] L. Cardelli,et al. Querying Trees with Pointers , 2003 .

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

[11] Peter W. O'Hearn,et al. The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[12] Chris J. Cheney. A nonrecursive list compacting algorithm , 1970, Commun. ACM.