An Effective Implementation for the Generalized Input-Output Construct of CSP

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Effective Implementation for the Generalized Input-Output Construct of CSP

Full text

Pdf (852 KB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 5 , Issue 2 (April 1983) table of contents

Pages: 223 - 235

Year of Publication: 1983

ISSN:0164-0925

Authors

G. N. Buckley	Department of Computer Sciences, College of Natural Sciences, The University of Texas at Austin, Austin, TX
Abraham Silberschatz	Department of Computer Sciences, College of Natural Sciences, The University of Texas at Austin, Austin, TX

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 37, Citation Count: 21

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/69624.357208 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Krzysztof R. Apt , Nissim Francez , Willem P. de Roever, A Proof System for Communicating Sequential Processes, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.3, p.359-385, July 1980 [doi>10.1145/357103.357110]
	2	Arthur Bernstein, Output Guards and Nondeterminism in “Communicating Sequential Processes”, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.2, p.234-238, April 1980 [doi>10.1145/357094.357101]
	3	Edsger W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, v.18 n.8, p.453-457, Aug. 1975 [doi>10.1145/360933.360975]
	4	FRANCEZ, N., AND ROOEH, M. A dis~but~ abstract data type implemented by a probabilistic communication scheme. In 21st Annual Symposium on Foundations of Computer Science, Syracuse, N.Y., Oct. 13-15, 1980, pp. 373-379.
	5	C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
	6	LF. vm, G.M., AND GRIES, D. A proof technique for Communicating Sequential Processes. Acta Inf. 15, 3 (June 1981), 281-302.
	7	Fred B. Schneider, Synchronization in Distributed Programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.2, p.125-148, April 1982 [doi>10.1145/357162.357163]
	8	SCHWARZ, J.S. Distributed synchronization of communicating sequential processes. Tech. Rep., Dep. of Artificial Intelligence, Univ. of Edinburgh, Edinburgh, Scofiand, July 1978.
	9	SILBERSCHATZ, A. Communication and synchronization in distributed systems. IEEE Trans. Sofiw. Eng. SE-5, 6 (Nov. 1979), 542-546.
	10	VAN DE SNEPSCHEUT, J.L.A. Synchronous communication between asynchronous components. inf. Process. Lett. 13, 3 (Dec. 1981), 127-130.

CITED BY 21

	Dave Berry , Robin Milner , David N. Turner, A semantics for ML concurrency primitives, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.119-129, January 19-22, 1992, Albuquerque, New Mexico, United States
	L. Bougé , N. Francez, A compositional approach to superimposition, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.240-249, January 10-13, 1988, San Diego, California, United States
	Arthur Charlesworth, The multiway rendezvous, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.350-366, July 1987
	R. J. R. Back , F. Kurki-Suonio, Distributed cooperation with action systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.4, p.513-554, Oct. 1988
	C.-D. Jung , E. Siberrt, Polling in concurrent programming, Proceedings of the 17th conference on ACM Annual Computer Science Conference, p.204-209, February 21-23, 1989, Louisville, Kentucky
	Rajive Bagrodia, Synchronization of asynchronous processes in CSP, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.585-597, Oct. 1989
	Rajiv Gupta , Scott A. Smolka , Shaji Bhaskar, On randomization in sequential and distributed algorithms, ACM Computing Surveys (CSUR), v.26 n.1, p.7-86, March 1994
	Simon Mørk, Distributed implementation of a process-algebra based programming language for embedded systems, Nordic Journal of Computing, v.8 n.1, p.121-158, Spring 2001
	K. K. Bagchi , O. Olsen , A. Christensen , L. Sorensen, Simulation & design of message routing systems for network of transputers, Proceedings of the 22nd annual symposium on Simulation, p.69-80, March 1989, Tampa, Florida, United States
	Y. K. Tsay , R. L. Bagrodia, Fault-Tolerant Algorithms for Fair Interprocess Synchronization, IEEE Transactions on Parallel and Distributed Systems, v.5 n.7, p.737-748, July 1994
	G. Castelli , F. De Cindio , G. De Michelis , C. Simone, An overview of the GCP programming language, Proceedings of the 1985 ACM SIGSMALL symposium on Small systems, p.245-253, May 1985, Danvers, Massachusetts, United States
	R. Kurki-Suonio, Action systems in incremental and aspect-oriented modeling, Distributed Computing, v.16 n.2-3, p.201-217, September 2003
	Manhoi Choy , Ambuj K. Singh, Efficient fault-tolerant algorithms for distributed resource allocation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.3, p.535-559, May 1995
	Nissim Francez , Shaula A. Yemini, Symmetric intertask communication, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.4, p.622-636, Oct. 1985
	Ratan Nalumasu , Ganesh Gopalakrishnan, Deriving Efficient Cache Coherence Protocols Through Refinement, Formal Methods in System Design, v.20 n.1, p.107-125, January 2002
	L. Chiu , M. T. Liu, High level specification of concurrency control in distributed database systems, Proceedings of the 10th international conference on Software engineering, p.309-317, April 11-15, 1988, Singapore
	R. Bagrodia, Process Synchronization: Design and Performance Evaluation of Distributed Algorithms, IEEE Transactions on Software Engineering, v.15 n.9, p.1053-1065, September 1989
	Yih-Kuen Tsay , Rajive L. Bagrodia, Some impossibility results in interprocess synchronization, Distributed Computing, v.6 n.4, p.221-231, July 1993
	Manhoi Choy , Ambuj K. Singh, Localizing Failures in Distributed Synchronization, IEEE Transactions on Parallel and Distributed Systems, v.7 n.7, p.705-716, July 1996
	Krzysztof R. Apt , Nissim Francez, Modeling the distributed termination convention of CSP, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.3, p.370-379, July 1984
	N. Plouzeau , M. Raynal, Elements for a course on the design of distributed algorithms, ACM SIGCSE Bulletin, v.24 n.2, p.35-40, June 1992