Permission-Based Separation Logic for Message-Passing Concurrency

Abstract

We develop local reasoning techniques for message passing concurrent programs based on ideas from separation logics and resource usage analysis. We extend processes with permission- resources and define a reduction semantics for this extended language. This provides a foundation for interpreting separation formulas for message-passing concurrency. We also define a sound proof system permitting us to infer satisfaction compositionally using local, separation-based reasoning.

Keywords

• computer science - logic in computer science
• f.3.1, f.3.2, f.3.3