Reasoning about iterators with separation logic

Proceedings of the 2006 Conference on Specification and Verification of Component-Based Systems, SAVCBS 2006

Volumn , Issue , 2006, Pages 83-86

  Krishnaswami, Neelakantan R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Aliasing; Challenge problem; Iterators; Separation logic

Indexed keywords

CHALLENGE PROBLEM; IMPERATIVE PROGRAMS; ITERATOR PROTOCOLS; SEPARATION LOGIC;

COMPUTER PROGRAMMING; DATA STRUCTURES; ITERATIVE METHODS; NETWORK PROTOCOLS; USER INTERFACES;

FORMAL LOGIC;

EID: 34547156032     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1181195.1181213     Document Type: Conference Paper

References (6)

1. J. Berdine, C. Calcagno, and P. W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In Proceedings of the Fourth International Symposium on Formal Methods for Components and Objects, Amsterdam, The Netherlands, 2001.
2. B. Biering, L. Birkedal, and N. Torp-Smith. BI-hyperdoctrines and higher order separation logic. In Proc. of ESOP 2005: The European Symposium on Programming, pages 233-247, Edinburgh, Scotland, April 2005.
3. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns. Elements of reusable object-oriented software. Addison-Wesley, 1995.
4. C. A. R. Hoare. An axiomatic approach to computer programming. Communications of the ACM, 12(583):576-580, 1969.
5. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In Proceedings of the 28th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL'01), London, 2001.
6. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), pages 55-74, Copenhagen, Denmark, July 2002. IEEE Press.