🤖 AI Summary
This paper addresses the challenge of precisely characterizing data-state evolution and interference in parallel processes. Methodologically, it introduces the first framework systematically embedding rely/guarantee (R/G) logic into an imperative process algebra—specifically, an extension of ACP—by integrating predicate logic with operational program semantics. It designs R/G inference rules supporting partial, weak, and strong total correctness verification, and establishes a formally complete judgment system. Key contributions include: (i) the first deep integration of R/G logic with imperative process algebra; (ii) significantly enhanced expressiveness and precision in modeling interference among shared-variable parallel programs; and (iii) theoretical and empirical evidence demonstrating that, compared to Hoare logic, the framework yields more natural, accurate, compositional, and practical reasoning about concurrent interference.
📝 Abstract
This paper concerns the relation between imperative process algebra and rely/guarantee logic. An imperative process algebra is complemented by a rely/guarantee logic that can be used to reason about how data change in the course of a process. The imperative process algebra used is the extension of ACP (Algebra of Communicating Processes) that is used earlier in a paper about the relation between imperative process algebra and Hoare logic. A complementing rely/guarantee logic that concerns judgments of partial correctness is treated in detail. The adaptation of this logic to weak and strong total correctness is also addressed. A simple example is given that suggests that a rely/guarantee logic is more suitable as a complementing logic than a Hoare logic if interfering parallel processes are involved.