Using Triples to Reason About Concurrent Programs
K. Mani Chandy · 1993
This paper presents adapatations of the Hoare triple for reasoning about concurrent programs. Tlie rules for the Hoare triple, familiar to programmers from their experience with sequential programming, can be applied to develop proofs of concurrent programs as well. The basis for the adaptations of the Hoare triple is temporal logic.