Show simple item record

dc.contributor.authorKozen, Dexteren_US
dc.contributor.authorTiuryn, Jerzyen_US
dc.date.accessioned2007-04-23T18:18:50Z
dc.date.available2007-04-23T18:18:50Z
dc.date.issued1999-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR99-1766en_US
dc.identifier.urihttps://hdl.handle.net/1813/7420
dc.description.abstractWe 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.extent135164 bytes
dc.format.extent126457 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn the Completeness of Propositional Hoare Logicen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics