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/6707
Title: Expressiveness Bounds for Completeness in Trace-Based Network Proof Systems
Authors: Widom, Jennifer
Panangaden, Prakash
Keywords: computer science
technical report
Issue Date: Sep-1987
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-867
Abstract: Network proof systems based on first-order specifications over channel traces are incomplete unless reasoning over the interleaving of communication events is permitted. Relatively complete trace-based proof systems using temporal logic have been described, but full temporal logic is more powerful than necessary. Using the interleaving approach, we isolate the expressiveness required of a relatively complete trace logic. A hierarchy of temporal logic subsets is then defined; a certain subset is shown to have necessary and sufficient expressive power for relative completeness.
URI: http://hdl.handle.net/1813/6707
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
87-867.pdf1.79 MBAdobe PDFView/Open
87-867.ps501.28 kBPostscriptView/Open

Refworks Export

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

 

© 2014 Cornell University Library Contact Us