skip to content
Completeness and incompleteness of trace-based network proof systems Preview this item
ClosePreview this item
Checking...

Completeness and incompleteness of trace-based network proof systems

Author: Jennifer Widom; David Gries; Fred B Schneider
Publisher: Ithaca, N.Y. : Cornell University, Dept. of Computer Science, 1986.
Series: Cornell University.; Department of Computer Science.; Technical report.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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  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; David Gries; Fred B Schneider
OCLC Number: 15994392
Description: 12 pages : illustrations ; 28 cm.
Series Title: Cornell University.; Department of Computer Science.; Technical report.
Responsibility: Jennifer Widom, David Gries, Fred B. Schneider.

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.

Reviews

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

Tags

Be the first.

Similar Items

Related Subjects:(2)

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/15994392>
library:oclcnum"15994392"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/15994392>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1986"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/11721837>
schema:inLanguage"en"
schema:name"Completeness and incompleteness of 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.