Show simple item record

Floyd-Hoare Logic Defines Semantics

dc.contributor.authorMeyer, Albert R.en_US
dc.date.accessioned2023-03-29T14:28:35Z
dc.date.available2023-03-29T14:28:35Z
dc.date.issued1986-05
dc.identifier.urihttps://hdl.handle.net/1721.1/149117
dc.description.abstractThe first-order patrial correctness assertions provable in Floyd-Hoare logic about an uninterpreted while-program scheme determine the scheme up to equivalence. This settles an open problem of Meyer and Halpern. The simple proof of this fact carries over to other partial correctness axiomatizations given in the literature for wider classes of ALGOL-like program schemes.en_US
dc.relation.ispartofseriesMIT-LCS-TM-308
dc.titleFloyd-Hoare Logic Defines Semanticsen_US
dc.identifier.oclc16999561
dc.identifier.oclc17559302


Files in this item

Thumbnail
Name:
MIT-LCS-TM-308.pdf
Size:
2.687Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record