skip to content
Trace-based network proof systems : expressiveness and completeness Preview this item
ClosePreview this item
Checking...

Trace-based network proof systems : expressiveness and completeness

Author: Jennifer Widom
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:
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 thesis, we isolate the componenets of a trace-based network proof system that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of any trace logic that encodes these componenets.
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
OCLC Number: 18262960
Description: x, 143 pages : illustrations ; 28 cm.
Series Title: Cornell University.; Department of Computer Science.; Technical report
Responsibility: Jennifer Widom.

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 thesis, we isolate the componenets of a trace-based network proof system that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of any trace logic that encodes these componenets.

Reviews

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

Tags

Be the first.
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/18262960>
library:oclcnum"18262960"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/18262960>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:author
schema:datePublished"1987"
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 thesis, we isolate the componenets of a trace-based network proof system that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of any trace logic that encodes these componenets."
schema:exampleOfWork<http://worldcat.org/entity/work/id/24663073>
schema:inLanguage"en"
schema:name"Trace-based network proof systems : expressiveness and completeness"
schema:publisher
rdf:typeschema:Organization
schema:name"Cornell University, Dept. of Computer Science"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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