Algebraic principles for rely-guarantee style concurrency verification tools
FM 2014: Formal Methods: 19th International Symposium, Singapore, May 12-16 …, 2014•Springer
We provide simple equational principles for deriving rely-guarantee-style inference rules
and refinement laws based on idempotent semirings. We link the algebraic layer with
concrete models of programs based on languages and execution traces. We have
implemented the approach in Isabelle/HOL as a lightweight concurrency verification tool that
supports reasoning about the control and data flow of concurrent programs with shared
variables at different levels of abstraction. This is illustrated on a simple verification example.
and refinement laws based on idempotent semirings. We link the algebraic layer with
concrete models of programs based on languages and execution traces. We have
implemented the approach in Isabelle/HOL as a lightweight concurrency verification tool that
supports reasoning about the control and data flow of concurrent programs with shared
variables at different levels of abstraction. This is illustrated on a simple verification example.
Abstract
We provide simple equational principles for deriving rely-guarantee-style inference rules and refinement laws based on idempotent semirings. We link the algebraic layer with concrete models of programs based on languages and execution traces. We have implemented the approach in Isabelle/HOL as a lightweight concurrency verification tool that supports reasoning about the control and data flow of concurrent programs with shared variables at different levels of abstraction. This is illustrated on a simple verification example.
Springer