Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6606
Title: Completeness and Incompleteness of Trace-Based Network Proof Systems
Authors: Widom, Jennifer
Gries, David
Schneider, Fred B.
Keywords: computer science
technical report
Issue Date: Jul-1986
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-766
Abstract: Most 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.
URI: http://hdl.handle.net/1813/6606
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-766.pdf1.8 MBAdobe PDFView/Open
86-766.ps417.27 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us