Show simple item record

dc.contributor.authorWidom, Jenniferen_US
dc.date.accessioned2007-04-23T17:19:38Z
dc.date.available2007-04-23T17:19:38Z
dc.date.issued1987-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-833en_US
dc.identifier.urihttps://hdl.handle.net/1813/6673
dc.description.abstractMost trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this thesis, we isolate the componenets of a trace-based network proof system that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of any trace logic that encodes these componenets.en_US
dc.format.extent9520622 bytes
dc.format.extent2053550 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.titleTrace-Based Network Proof Systems: Expressiveness and Completenessen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics