Design patterns in separation logic

Authors:
Neelakantan R. Krishnaswami;Jonathan Aldrich;Lars Birkedal;Kasper Svendsen;Alexandre Buisse
Affiliations:
Carnegie Mellon University, Pittsburgh, PA, USA;Carnegie Mellon University, Pittsburgh, PA, USA;IT University of Copenhagen, Copenhagen, Denmark;IT University of Denmark, Copenhagen, Denmark;IT University of Copenhagen, Copenhagen, Denmark
Venue:
Proceedings of the 4th international workshop on Types in language design and implementation
Year:
2009

Citing 16
Cited 13

Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
Formal underpinnings of Java

Addendum to the 1998 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum)
Behavioural subtyping using invariants and constraints

Formal methods for distributed processing
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
An Introduction to Specification Logic

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
A judgmental reconstruction of modal logic

Mathematical Structures in Computer Science
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphism and separation in hoare type theory

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Reasoning about iterators with separation logic

Proceedings of the 2006 conference on Specification and verification of component-based systems
BI-hyperdoctrines, higher-order separation logic, and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Modular verification of higher-order methods with mandatory calls specified by model programs

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
jStar: towards practical verification for java

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Using history invariants to verify observers

ESOP'07 Proceedings of the 16th European conference on Programming
Abstract predicates and mutable adts in hoare type theory

ESOP'07 Proceedings of the 16th European conference on Programming
A realizability model for impredicative Hoare type theory

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
The spec# programming system: an overview

CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices

Formal methods: Practice and experience

ACM Computing Surveys (CSUR)
Structuring the verification of heap-manipulating programs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying event-driven programs using ramified frame properties

Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
Verifying generics and delegates

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
The next 700 separation logics

VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Modular verification of linked lists with views via separation logic

Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
Verifying stateful programs with substructural state and hoare types

Proceedings of the 5th ACM workshop on Programming languages meets program verification
Verifying object-oriented programs with higher-order separation logic in Coq

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Specification patterns and proofs for recursion through the store

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Dynamic boundaries: information hiding by second order framing with first order assertions (ESOP invited lecture)

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
On exceptions, events and observer chains

Proceedings of the 12th annual international conference on Aspect-oriented software development
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries

Journal of the ACM (JACM)
Separation logic for object-oriented programming

Aliasing in Object-Oriented Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Object-oriented programs are notable for making use of both higher-order abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the combination yields very flexible program designs and correspondingly difficult verification problems. In this paper, we show how to formally specify and verify programs that use several common design patterns in concert.