Modeling the distributed termination convention of CSP

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Modeling the distributed termination convention of CSP

Full text

Pdf (584 KB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 6 , Issue 3 (July 1984) table of contents

Pages: 370 - 379

Year of Publication: 1984

ISSN:0164-0925

Authors

Krzysztof R. Apt	Universite Paris 7
Nissim Francez	Technion-Israel Institute of Technology

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 24, Citation Count: 2

Additional Information:

references cited by index terms review 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/579.584 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, Formal Justification of a Proof System for Communicating Sequential Processes, Journal of the ACM (JACM), v.30 n.1, p.197-216, Jan. 1983 [doi>10.1145/322358.322372]
	2	APT, K.R. Modelling the distributed termination convention of CSP. Tech. Rep. 83-10, LITP, Paris, 1983.
	3	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]
	4	APT, K.R., AND OLDEROO, E.-R. Proof Rules and Trans{ormations Dealing with Fairness. Vol. 3, Science of Computer Programming. Elsevier North Holland, New York, 1983.
	5	Egidio Astesiano , Elena Zucca, Semantics of CSP via Translation into CCS, Proceedings on Mathematical Foundations of Computer Science, p.172-182, August 31-September 04, 1981
	6	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]
	7	G. N. Buckley , Abraham Silberschatz, An Effective Implementation for the Generalized Input-Output Construct of CSP, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.2, p.223-235, April 1983 [doi>10.1145/69624.357208]
	8	Nissim Francez, Distributed Termination, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.1, p.42-55, Jan. 1980 [doi>10.1145/357084.357087]
	9	FRANCEZ, N. Program transformations eliminating the distributed termination convention of CSP. Tech. Rep. RC-9935, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., 1983.
	10	FRANCEZ, N., LEHMANN, D., AND PNEULI, A. Linear history semantics for distributed languages. In Proceedings 21st FOCS Con{erence, (Syracuse, N.Y., October) 1980.
	11	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]
	12	Richard B. Kieburtz , Abraham Silberschatz, Comments on “Communicating Sequential Processes”, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.2, p.218-225, Oct. 1979 [doi>10.1145/357073.357077]
	13	LEVIN, G.M., AND GRiES, D. A proof technique for communicating sequential processes. Acta In{. 15, 3 (198 ! ), 281-302.
	14	R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982

CITED BY 2

	Rogier M. Van Eijk , Frank S. De Boer , Wiebe Van Der Hoek , John-Jules Ch. Meyer, A Verification Framework for Agent Communication, Autonomous Agents and Multi-Agent Systems, v.6 n.2, p.185-219, March 2003
	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

INDEX TERMS

Classification:
D. Software
D.1 PROGRAMMING TECHNIQUES
D.1.3 Concurrent Programming

Nouns: CSP
D.3 PROGRAMMING LANGUAGES
D.3.3 Language Constructs and Features
Subjects: Concurrent programming structures
D.4 OPERATING SYSTEMS

General Terms:
Algorithms, Design, Languages, Performance, Theory, Verification

REVIEW

"Robert Elliot Filman : Reviewer"

Communication Sequential Processes (CSP) [1], a language for distributed programming, uses guarded Boolean expressions to control intraprocess repetition and interprocess communication. In the original CSP, an attempt by a process, A more...

Collaborative Colleagues:

Krzysztof R. Apt: colleagues

Nissim Francez: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player