Addendum to "Proof Rules for Flush Channels"

  • Authors:

  • S. Stoller

  • Affiliations:

  • -

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

The logic presented in a previous paper, see ibid., vol. 19, no.4, p.366-78 (1993) 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.