This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Addendum to "Proof Rules for Flush Channels"
August 1994 (vol. 20 no. 8)
pp. 664

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.

[1] T. Camp, P. Kearns, and M. Ahuja, "Proof rules for flush channels,"IEEE Trans. Software Eng., vol. 19, no. 4, pp. 366-378, 1993.

Index Terms:
distributed processing; program verification; message passing; formal logic; flush channels; multiple identical messages; channel; proof system; logic system; proof rules; communicating processes; asynchronous communication; distributed systems; program verification
Citation:
S. Stoller, "Addendum to "Proof Rules for Flush Channels"," IEEE Transactions on Software Engineering, vol. 20, no. 8, pp. 664, Aug. 1994, doi:10.1109/32.310675
Usage of this product signifies your acceptance of the Terms of Use.