skip to content
Expressiveness bounds for completeness in trace-based network proof systems Preview this item
ClosePreview this item
Checking...

Expressiveness bounds for completeness in trace-based network proof systems

Author: Jennifer Widom; Prakash Panangaden
Publisher: Ithaca, N.Y. : Cornell University, Dept. of Computer Science, 1987.
Series: Cornell University.; Department of Computer Science.; Technical report
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Jennifer Widom; Prakash Panangaden
OCLC Number: 18304690
Description: 22 pages : illustrations ; 28 cm.
Series Title: Cornell University.; Department of Computer Science.; Technical report
Responsibility: Jennifer Widom, Prakash Panangaden.

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/18304690>
library:oclcnum"18304690"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/18304690>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"1987"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/17225587>
schema:inLanguage"en"
schema:name"Expressiveness bounds for completeness in trace-based network proof systems"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.