Completeness and incompleteness of trace-based network proof systems

Authors:
J. Widom;D. Gries;F. B. Schneider
Affiliations:
Computer Science Department, Cornell University, Ithaca, New York;Computer Science Department, Cornell University, Ithaca, New York;Computer Science Department, Cornell University, Ithaca, New York
Venue:
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1987

Citing 9
Cited 5

Communicating sequential processes

Communicating sequential processes
A model and temporal proof system for networks of processes

Distributed Computing
A model and proof system for asynchronous networks

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Proof System for Communicating Sequential Processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Ten Years of Hoare's Logic: A Survey—Part I

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Calculus of Communicating Systems

A Calculus of Communicating Systems
On the composition of processes

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scenarios: A Model of Non-Determinate Computation

Proceedings of the International Colloquium on Formalization of Programming Concepts
A Semantics and Proof System for Communicating Processes

Proceedings of the Carnegie Mellon Workshop on Logic of Programs

Trace-based network proof systems: expressiveness and completeness

ACM Transactions on Programming Languages and Systems (TOPLAS)
Composition and Refinement for Partial Object Specifications

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
P-A logic: a compositional proof system for distributed programs

Distributed Computing
Communication traces in the verification of distributed programs

2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
Compositional Proofs For Networks Of Processes

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.