Completeness and Incompleteness of Trace-Based Network Proof Systems
| dc.contributor.author | Widom, Jennifer | en_US |
| dc.contributor.author | Gries, David | en_US |
| dc.contributor.author | Schneider, Fred B. | en_US |
| dc.date.accessioned | 2007-04-23T17:15:15Z | |
| dc.date.available | 2007-04-23T17:15:15Z | |
| dc.date.issued | 1986-07 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 1838417 bytes | |
| dc.format.extent | 427286 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-766 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6606 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Completeness and Incompleteness of Trace-Based Network Proof Systems | en_US |
| dc.type | technical report | en_US |