## BI as an Assertion Language for Mutable Data Structures (2000)

### Cached

### Download Links

- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.dcs.qmw.ac.uk]
- [www.dcs.qmul.ac.uk]
- [ftp.dcs.qmw.ac.uk]
- DBLP

### Other Repositories/Bibliography

Citations: | 149 - 14 self |

### BibTeX

@MISC{Ishtiaq00bias,

author = {Samin Ishtiaq and Peter W. O'Hearn},

title = {BI as an Assertion Language for Mutable Data Structures},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

Reynolds has developed a logic for reasoning about mutable data structures in which the pre- and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O'Hearn and Pym. We begin by giving a model in which the law of the excluded middle holds, thus showing that the approach is compatible with classical logic. The relationship between the intuitionistic and classical versions of the system is established by a translation, analogous to a translation from intuitionistic logic into the modal logic S4. We also consider the question of completeness of the axioms. BI's spatial implication is used to express weakest preconditions for object-component assignments, and an axiom for allocating a cons cell is shown to be complete under an interpretation of triples that allows a command to be applied to states with dangling pointers. We make this latter a feature, by incorporating an operation, and axiom, for disposing of memory. Finally, we describe a local character enjoyed by specifications in the logic, and show how this enables a class of frame axioms, which say what parts of the heap don't change, to be inferred automatically.