The “Hoare Logic'’ of CSP, and All That

59Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

Abstract

Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. It provides a uniform way to describe a variety of methods for reasoning about concurrent programs, including noninterference, satisfaction, and cooperation proofs. We describe a simple recta-rule of the Generalized Hoare Logic--the Decomposition Principle--and show how all these methods can be derived using it. © 1984, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Lamport, L., & Schneider, F. B. (1984). The “Hoare Logic’’’ of CSP, and All That.” ACM Transactions on Programming Languages and Systems (TOPLAS), 6(2), 281–296. https://doi.org/10.1145/2993.357247

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free