A derivation of a broadcasting protocol using sequentially phased reasoning
暂无分享,去创建一个
[1] Adrian Segall,et al. Decentralized maximum-flow protocols , 1982, Networks.
[2] Nissim Francez,et al. Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..
[3] Eli Gafni,et al. Understanding and verifying distributed algorithms using stratified decomposition , 1988, PODC '88.
[4] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.
[5] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[6] Doron A. Peled,et al. Interleaving set temporal logic , 1987, PODC '87.
[7] Willem P. de Roever,et al. Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract) , 1989, WDAG.
[8] Adrian Segall,et al. A distributed shortest path protocol , 1981 .
[9] Adrian Segall,et al. Distributed network protocols , 1983, IEEE Trans. Inf. Theory.
[10] Pierre A. Humblet. A Distributed Algorithm for Minimum Weight Directed Spanning Trees , 1983, IEEE Trans. Commun..
[11] Adrian Segall,et al. A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..
[12] Adrian Segall. Decentralized maximum flow algorithms , 1979 .
[13] Richard D. Schlichting,et al. Using message passing for distributed programming: proof rules and disciplines , 1984, TOPL.
[14] K. Mani Chandy,et al. Parallel program design - a foundation , 1988 .
[15] Willem P. de Roever,et al. The evolution of list-copying algorithms and the need for structured program verification , 1979, POPL.
[16] Kaisa Sere,et al. Stepwise Refinement of Action Systems , 1991, Struct. Program..