On the Completeness of Propositional Hoare Logic
| dc.contributor.author | Kozen, Dexter | en_US |
| dc.contributor.author | Tiuryn, Jerzy | en_US |
| dc.date.accessioned | 2007-04-23T18:18:50Z | |
| dc.date.available | 2007-04-23T18:18:50Z | |
| dc.date.issued | 1999-09 | en_US |
| dc.description.abstract | We investigate the completeness of Hoare Logic on the propositional level. In particular, the expressiveness requirements of Cook's proof are characterized propositionally. We give a completeness result for Propositional Hoare Logic (PHL): all relationally valid rules {b1}p1{c1}, ..., {bn}pn{cn} --------------------------- {b}p{c} are derivable in PHL, provided the propositional expressiveness conditions are met. Moreover, if the programs pi in the premises are atomic, no expressiveness assumptions are needed. | en_US |
| dc.format.extent | 135164 bytes | |
| dc.format.extent | 126457 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR99-1766 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7420 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the Completeness of Propositional Hoare Logic | en_US |
| dc.type | technical report | en_US |