The Hoare logic of concurrent programs
From MaRDI portal
Publication:754637
DOI10.1007/BF00289062zbMath0416.68032OpenAlexW1983409972MaRDI QIDQ754637
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289062
Other nonclassical logic (03B60) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items (9)
Invariants, composition, and substitution ⋮ A generalization of Owicki-Gries's Hoare logic for a concurrent while language ⋮ A language independent proof of the soundness and completeness of generalized Hoare logic ⋮ Méthode axiomatique sur les propriétés de fatalité des programmes parallèles ⋮ Wait-free linearization with an assertional proof ⋮ Reasoning about programs by exploiting the environment ⋮ On using temporal logic for refinement and compositional verification of concurrent systems ⋮ The lifeness property of on-the-fly garbage collector - a proof ⋮ Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
Cites Work
This page was built for publication: The Hoare logic of concurrent programs
