🤖 AI Summary
In probabilistic separation logic, the frame rule relies on complex side conditions, hindering modular reasoning. Method: This paper proposes a semantic construction that directly embeds “safety” into program specifications and introduces “relative compactness” as a key semantic property—serving as a bridge to ensure frame rule soundness. This design eliminates auxiliary side conditions required by conventional frameworks, yielding a concise and sound frame rule. Technically, the approach integrates probabilistic program semantics, separation logic, and modal logic to rigorously formalize independence and locality of probabilistic states. Contribution/Results: The framework establishes a more robust and practical foundation for modular verification of probabilistic programs, significantly enhancing both expressive power and usability of the logic.
📝 Abstract
Probabilistic separation logic offers an approach to reasoning about imperative probabilistic programs in which a separating conjunction is used as a mechanism for expressing independence properties. Crucial to the effectiveness of the formalism is the frame rule, which enables modular reasoning about independent probabilistic state. We explore a semantic formulation of probabilistic separation logic, in which the frame rule has the same simple formulation as in separation logic, without further side conditions. This is achieved by building a notion of safety into specifications, using which we establish a crucial property of specifications, called relative tightness, from which the soundness of the frame rule follows.