Reasoning about iterators with separation logic
NR Krishnaswami - Proceedings of the 2006 conference on …, 2006 - dl.acm.org
Proceedings of the 2006 conference on Specification and verification of …, 2006•dl.acm.org
Reasoning about iterators with separation logic Page 1 Reasoning About Iterators With
Separation Logic Neelakantan R. Krishnaswami Carnegie Mellon University neelk@cs.cmu.edu
ABSTRACT Separation logic is an extension of Hoare logic which permits reasoning about
imperative programs that use shared mutable heap structure. In this note, we show how to use
higher-order separation logic to reason abstractly about an iterator protocol. Categories and
Subject Descriptors D.2 [Software/Program Verification]: Correctness Proofs General Terms …
Separation Logic Neelakantan R. Krishnaswami Carnegie Mellon University neelk@cs.cmu.edu
ABSTRACT Separation logic is an extension of Hoare logic which permits reasoning about
imperative programs that use shared mutable heap structure. In this note, we show how to use
higher-order separation logic to reason abstractly about an iterator protocol. Categories and
Subject Descriptors D.2 [Software/Program Verification]: Correctness Proofs General Terms …
Separation logic is an extension of Hoare logic which permits reasoning about imperative programs that use shared mutable heap structure. In this note, we show how to use higher-order separation logic to reason abstractly about an iterator protocol.
ACM Digital Library