Can message buffers be characterized in linear temporal logic?

Authors:
A. P. Sistla;E. M. Clarke;N. Francez;Y. Gurevich
Affiliations:
-;-;-;-
Venue:
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
1982

Citing 2
Cited 3

On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A consistent and complete deductive system for the verification of parallel programs

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Specifying message passing systems requires extending temporal logic

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Expressing interesting properties of programs in propositional temporal logic

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Yuri, logic, and computer science

Fields of logic and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Exchange of information between executing processes is one of the primary reasons for process interaction. Many distributed systems implement explicit message passing primitives to facilitate intercommunication. Typically, a process executes a write command to pass a message to another process, and the target process accepts the message by executing a read command. The semantics of write and read may differ considerably depending on the methods used for storing or buffering messages that have been sent but not yet accepted by the receiving process.