Proof Rules for Flush Channels
暂无分享,去创建一个
[1] Richard D. Schlichting,et al. Using message passing for distributed programming: proof rules and disciplines , 1984, TOPL.
[2] Amitabh Sinha,et al. Flush Message Passing in Communicating Sequential Processes. , 1990 .
[3] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[4] Shyamal K. Chowdhury. The Mean Resequencing Delay for M/HK/oo Systems , 1989 .
[5] Mohan Ahuja. Flush Primitives for Asynchronous Distributed Systems , 1990, Inf. Process. Lett..
[6] Tak-Shing Peter Yum,et al. Resequencing of messages in communication networks , 1986, IEEE Trans. Commun..
[7] Tracy Camp,et al. An implementation of flush channels based on a verification methodology , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.
[8] Leslie Lamport,et al. Distributed snapshots: determining global states of distributed systems , 1985, TOCS.
[9] Mohan Ahuja. An implementation of F-channels, a preferable alternative to FIFO channels , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.
[10] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.
[11] Shyamal K. Chowdhury. The Mean Resequencing Delay for M/H_K/infty Systems , 1989, IEEE Trans. Software Eng..
[12] Leslie Lamport,et al. Control predicates are better than dummy variables for reasoning about program control , 1988, TOPL.
[13] Subhash C. Agrawal,et al. Analysis of the resequencing delay for M/M/m systems , 1987, SIGMETRICS '87.