Addendum to `Proof rules for flush channels'

Scott Stoller

doi:10.1109/32.310675

Addendum to `Proof rules for flush channels'

Scott Stoller

Computer Science

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

1 Scopus citations

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 - 1994

Access to Document

10.1109/32.310675

Cite this

@article{202e4a203c694a42a09002e048cd7c81,

title = "Addendum to `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.",

author = "Scott Stoller",

year = "1994",

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 - Addendum to `Proof rules for flush channels'

AU - Stoller, Scott

PY - 1994

Y1 - 1994

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.

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

U2 - 10.1109/32.310675

DO - 10.1109/32.310675

M3 - Article

AN - SCOPUS:0028480304

SN - 0098-5589

VL - 20

SP - 664

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

IS - 8

ER -

Addendum to `Proof rules for flush channels'

Abstract

Access to Document

Other files and links

Fingerprint

Cite this