“Proof Rules for Flush Channels”

Scott Stoller

doi:10.1109/32.310675

“Proof Rules for Flush Channels”

Scott Stoller

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The logic presented in the paper by Camp, Kearns, and Ahuja for processes that communicate using flush channels is inadequate for reasoning about processes that send multiple identical messages along a channel. A modification to the logic and proof system that remedies this deficiency is described herein.

Original language	English
Pages (from-to)	664
Number of pages	1
Journal	IEEE Transactions on Software Engineering
Volume	20
Issue number	8
DOIs	https://doi.org/10.1109/32.310675
State	Published - Aug 1994

Keywords

Asynchronous communication
distributed systems
program verification

Access to Document

10.1109/32.310675

Cite this

@article{ae166dec7ade400b845451c337293cf2,

title = "“Proof Rules for Flush Channels”",

abstract = "The logic presented in the paper by Camp, Kearns, and Ahuja for processes that communicate using flush channels is inadequate for reasoning about processes that send multiple identical messages along a channel. A modification to the logic and proof system that remedies this deficiency is described herein.",

keywords = "Asynchronous communication, distributed systems, program verification",

author = "Scott Stoller",

year = "1994",

month = aug,

doi = "10.1109/32.310675",

language = "English",

volume = "20",

pages = "664",

journal = "IEEE Transactions on Software Engineering",

issn = "0098-5589",

number = "8",

}

TY - JOUR

T1 - “Proof Rules for Flush Channels”

AU - Stoller, Scott

PY - 1994/8

Y1 - 1994/8

N2 - The logic presented in the paper by Camp, Kearns, and Ahuja for processes that communicate using flush channels is inadequate for reasoning about processes that send multiple identical messages along a channel. A modification to the logic and proof system that remedies this deficiency is described herein.

AB - The logic presented in the paper by Camp, Kearns, and Ahuja for processes that communicate using flush channels is inadequate for reasoning about processes that send multiple identical messages along a channel. A modification to the logic and proof system that remedies this deficiency is described herein.

KW - Asynchronous communication

KW - distributed systems

KW - program verification

UR - https://www.scopus.com/pages/publications/84944981939

U2 - 10.1109/32.310675

DO - 10.1109/32.310675

M3 - Article

AN - SCOPUS:84944981939

SN - 0098-5589

VL - 20

SP - 664

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

IS - 8

ER -

“Proof Rules for Flush Channels”

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this