Logic of Global Synchrony
暂无分享,去创建一个
[1] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[2] Jan A. Bergstra,et al. Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..
[3] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.
[4] David B. Skillicorn. Building BSP Programs Using the Refinement Calculus , 1998, IPPS/SPDP Workshops.
[5] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.
[6] K. Mani Chandy. Parallel program design , 1989 .
[7] William F. McColl,et al. Scalability, portability and predictability: The BSP approach to parallel programming , 1996, Future Gener. Comput. Syst..
[8] Jim Davies,et al. A Brief History of Timed CSP , 1995, Theor. Comput. Sci..
[9] Yifeng Chen. How to Write a Healthiness Condition , 2000, IFM.
[10] Jeff W. Sanders,et al. WEAKEST SPECIFUNCTIONS FOR BSP , 2001 .
[11] Greg Nelson,et al. A generalization of Dijkstra's calculus , 1989, ACM Trans. Program. Lang. Syst..
[12] K. Mani Chandy,et al. Parallel program design - a foundation , 1988 .
[13] Paul R. Cohen,et al. Robot Baby 2001 , 2001, Discovery Science.
[14] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[15] Edsger W. Dijkstra,et al. Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.