Specifying Concurrent Programs in Separation Logic: Morphisms and Simulations
In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources—a form of state transition systems—to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state. In this paper we introduce a novel notion of resource morphism, i.e. structure-preserving function on resources, and show how to effectively integrate it into separation logic, using an associated notion of morphism-specific simulation. We apply morphisms and simulations to programs verified under one resource, to compositionally adapt them to operate under another resource, thus facilitating proof reuse.
This program is tentative and subject to change.
Thu 24 Oct
|14:00 - 14:22|
|14:22 - 14:45|
|14:45 - 15:07|
|15:07 - 15:30|