Formalized Verification of Snapshotable Trees: Separation and Sharing
| Citations: | 1 - 1 self |
BibTeX
@MISC{Mehnert_formalizedverification,
author = {Hannes Mehnert and Filip Sieczkowski and Lars Birkedal and Peter Sestoft},
title = {Formalized Verification of Snapshotable Trees: Separation and Sharing},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We use separation logic to specify and verify a Java program that implements snapshotable search trees, fully formalizing the specification and verification in the Coq proof assistant. We achieve local and modular reasoning about a tree and its snapshots and their iterators, although the implementation involves shared mutable heap data structures with no separation or ownership relation between the various data. The paper also introduces a series of four increasingly sophisticated implementations and verifies the first one. The others are included as future work and as a set of challenge problems for full functional specification and verification, whether by separation logic or by other formalisms. 1
