Abstract
The views framework of Dinsdale-Young and others unifies several compositional techniques for reasoning about concurrent programs. This paper uses simple mathematics to construct the views framework incrementally from first principles. The result is a model for the views framework, which can also be understood as an independent theory of concurrent programs. Along the lines of “sequential programs are binary relations”, the theory adopts the maxim “concurrent programs are formal languages”. Consequently, programs obey familiar algebraic laws that can simplify reasoning; there is no need to postulate operational rules; the views program logic can be constructed in a stepwise fashion from more basic logics; program logic and operational thinking become largely decoupled; proving partial correctness becomes straightforward and it holds irrespectively of the specific choice of programming language constructs, operational rules, and the atomic actions that are implemented in a computer. All theorems have been formally checked with Isabelle/HOL. A proof script is available online.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.