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.

• 03B40 - Combinatory logic and lambda calculus
• 03B70 - Logic in computer science
• 03E25 - Axiom of choice and related propositions
• 03E35 - Consistency and independence results