Concurrent programming for the masses (invited address)
暂无分享,去创建一个
[1] C. A. R. Hoare. Programs are predicates , 1984, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.
[2] Stephen A. Cook,et al. The Classifikation of Problems which have Fast Parallel Algorithms , 1983, FCT.
[3] E. W. Dijkstra,et al. Invariance and non-determinacy , 1984, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.
[4] K. Mani Chandy,et al. The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..
[5] John W. Backus,et al. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.
[6] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.
[7] Daniel Lehmann,et al. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.
[8] R. Kowalski,et al. The relation between logic programming and logic specification , 1984, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.