Reasoning about iterators with separation logic

Authors:
Neelakantan R. Krishnaswami
Affiliations:
Carnegie Mellon University
Venue:
Proceedings of the 2006 conference on Specification and verification of component-based systems
Year:
2006

Citing 6
Cited 10

Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
An axiomatic basis for computer programming

Communications of the ACM
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Smallfoot: modular automatic assertion checking with separation logic

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
BI hyperdoctrines and higher-order separation logic

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Verifying C++ with STL containers via predicate abstraction

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Separation Logic Contracts for a Java-Like Language with Fork/Join

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Design patterns in separation logic

Proceedings of the 4th international workshop on Types in language design and implementation
Practical API Protocol Checking with Access Permissions

Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
Semantics of fractional permissions with nesting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mechanized verification with sharing

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Automated program verification made SYMPLAR: symbolic permissions for lightweight automated reasoning

Proceedings of the 10th SIGPLAN symposium on New ideas, new paradigms, and reflections on programming and software
Implicit dynamic frames

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof search for propositional abstract separation logics via labelled sequents

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A proof system for separation logic with magic wand

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

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.