Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Concurrent Processes and Their Syntax

Published: 01 April 1979 Publication History
First page of PDF

References

[1]
B~rdc, H Towards a mathemaucal theory of processes Tech Rep TR25.125, IBM Lab, Vienna, Dec 1971
[2]
BURSTALL, R M., xr~-o LANDIN, P.J Programs and their proofs In Machine Intelhgence, Vol 4, B Meltzer and D Mlchte, Eds., Edinburgh U Press, Edmburgh, Scotland, 1969, pp 17-43.
[3]
DraKS'rax, E.W. The structure of the "THE"--multiprogrammmg system Comm ACM I1, 5 (May 1968), 341-346
[4]
GoctrEN, J A, THATCHER, J W, WAGNER, E.G, AreD WRIGHT, J B Imttal algebra semanUcs and continuous algebras. J. ACM 24, 1 (Jan 1977), 68-95
[5]
GILl/IF, I On proofs of programs for synchromsatton Proc 3rd Int CoUoqumm Automata Languages and Programming, Edinburgh U Press. Edmburgh, Scotland, 1976, pp 494-507
[6]
HOARE, C A R An axiomatic basts for computer programming Comm A CM 12, 10 (Oct 1969), 576-580, 583.
[7]
HO~.E, C A R Commumcatmg sequential processes Comm A CM 21, 8 (Aug 1978), 666--677
[8]
KAHN, G., AND MACQUEEN, D Co-routmes and networks of parallel processes. Res Rep 202, IRIA, Pans, 1976.
[9]
LUCAS, P, AND WALK, K On the formal descnptlon of PL/I Ann Rev. m A utom. Prog 6, 3 (1969), 105- 182.
[10]
MILTS, G A mathematical model of concurrent computation. Ph D Th, U. of Edinburgh, Edinburgh, Scotland, 1978.
[11]
MtLNE, G, AND MILNER, R Concurrent processes and their syntax Rep CSR-2-77, Comptr Scl. Dept, U of Edinburgh, Edinburgh, Scotland, 1977
[12]
MILNER, R Processes, a mathematical model of computing agents Proc Logic Colloqumm, Bristol, North- Holland Pub Co, Amsterdam, 1973, pp 157-174
[13]
MILNER, R Flowgraphsand flow algebras Rep CSR-5-77, Comptr Scl Dept, U of Edinburgh, Edinburgh, Scotland, 1977
[14]
MOSSES, P The mathemaucal semanUcs of ALGOL 60 Tech Mono DRG-12, Programming Res Group, Comptng Lab, Oxford U, Oxford, England, 1974.
[15]
OwIcKa, S Amomatic proof techraques for parallel programs TR 75-251, Cornell U, Ithaca, N Y, 1975
[16]
PDPI 1 Peripherals and lnterfacmg Handbook DtgRal Eqmpment Corp, Maynard, Mass, 1971
[17]
PLOTKIN, G. A powerdomam construction SIAM J Comptng 5, 3 (1976), 452-487
[18]
SCOTT, D The lattice of flow dmgrams in Symposmm on Semantics of Algorithmic Languages, E Engeler, Ed, Springer Lecture Note Senes No 188, Sprmger-Verlag, Heidelberg, 1971, pp 311-366
[19]
SCOTT, D Lattice theoretic models for various type-free calcuh Proc 4th Int Congress Logic, Methodology and Phdosophy of Sc~, Bucharest, Romama, 1972, North-Holland Pub Co, Amsterdam, 1973, pp 157-187
[20]
SMa'TH, M Powerdomams Proc 5th Math. Foundations of Comptr Sc~ Symposmm, Gdansk, Poland, Lecture Notes m Computer Science 45, Sprmger-Vedag, 1976, pp 537-543
[21]
TEN/CENT, R The denotattonal semantics of programming languages Comm A CM 19, 8 (Aug 1976), 437- 453
[22]
VAN WIJNGAARDEN, A., ET AL Revised report on the algorithmic language ALGOL 68 A cta Informauca 5 (1975), 1-236
[23]
WroTH, N MODULA A language for modular multlprogrammmg Res Rep 18, Inst fur Informauk, Zurich, Switzerland, 1975
[24]
ZAVE, P On the formal definmon of processes Proc Int Conf on Parallel Processmg, 1976 (avadable from IEEE, New York)

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 26, Issue 2
April 1979
205 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/322123
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1979
Published in JACM Volume 26, Issue 2

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6,718
  • Downloads (Last 6 weeks)29
Reflects downloads up to 22 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Leader ElectionDistributed Systems10.1002/9781119825968.ch7(157-188)Online publication date: 10-Feb-2023
  • (2019)Network Protocol Security: A Linear Bitwise Protocol TransformationIntelligent Computing10.1007/978-3-030-22868-2_53(751-770)Online publication date: 9-Jul-2019
  • (2018)Concurrent systems and time synchronizationInternational Journal of General Systems10.1080/03081079.2018.142529847:4(313-328)Online publication date: 28-Feb-2018
  • (2017)An Architecture for Self-Awareness Experiments2017 IEEE International Conference on Autonomic Computing (ICAC)10.1109/ICAC.2017.33(255-262)Online publication date: Jul-2017
  • (2014)Concurrency Theory: A Historical Perspective on Coinduction and Process CalculiComputational Logic10.1016/B978-0-444-51624-4.50009-5(399-442)Online publication date: 2014
  • (2012)Behavioral interface specification languagesACM Computing Surveys10.1145/2187671.218767844:3(1-58)Online publication date: 14-Jun-2012
  • (2012)Election in partially anonymous networks with arbitrary knowledge in message passing systemsDistributed Computing10.1007/s00446-012-0163-y25:4(297-311)Online publication date: 22-Feb-2012
  • (2011)A Study on Network Service Behavior Verification with Process Algebra and Its ApplicationChinese Journal of Computers10.3724/SP.J.1016.2011.0160034:9(1660-1668)Online publication date: 15-Oct-2011
  • (2010)On the power of synchronization between two adjacent processesDistributed Computing10.1007/s00446-010-0115-323:3(177-196)Online publication date: 1-Nov-2010
  • (2009)The concept of nondeterminismACM SIGCSE Bulletin10.1145/1595453.159549541:2(141-160)Online publication date: 25-Jun-2009
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media