Show simple item record

dc.contributor.authorWidom, Jenniferen_US
dc.contributor.authorGries, Daviden_US
dc.contributor.authorSchneider, Fred B.en_US
dc.date.accessioned2007-04-23T17:15:15Z
dc.date.available2007-04-23T17:15:15Z
dc.date.issued1986-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-766en_US
dc.identifier.urihttps://hdl.handle.net/1813/6606
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 paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented.en_US
dc.format.extent1838417 bytes
dc.format.extent427286 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.titleCompleteness and Incompleteness of Trace-Based Network Proof Systemsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics