This work was supported by INRIA (SESORI-78208) and by CNRS (ATP Intelligence Artif.).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Apt K., Francez N. & de Roever W.P.[1979a], Semantics for concurrently communicating finite sequential processes, based on predicate transformers, Progress Report, Vakgroep inf., Rijksuniversiteit Utrecht, The Netherlands, (June 1979).
Apt K., Francez N. & de Roever W.P.[1979b], A proof system for communicating sequential processes, Tech. Rep. RUU-CS-79-8, Vakgroep Inf., Rijkuniv. Utrecht, NL., (Aug. 79).
Chandy K.M. & Misra J.[1979], An axiomatic proof technique for networks of communicating processes, TR 98, Univ. of Texas at Austin, (May 79).
Clarke E.M.Jr[1978], Proving correctness of coroutines without history variables, TR-CS-1978-4, Dept. of Comp. Sci., Duke Univ., USA, (1978).
Clarke E.M.Jr[1979], Synthesis of resource invariants for concurrent programs, 6th ACM-POPL, (Jan. 1979), 211–221.
Clint M.[1973], Program proving: coroutines, Acta Informatica 2(1973), 50–63.
Cousot P.[1977], Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice, Rap. de Recherche no88, Laboratoire IMAG, Univ. Grenoble, (Sept. 1977).
Cousot P.[1979], Analysis of the behavior of dynamic discrete systems, Rapport de Recherche no161, Laboratoire IMAG, Univ. Grenoble, (Jan. 1979).
Cousot P. & Cousot R.[1977a], Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, 4th ACM-POPL, (Jan. 1977), 238–252.
Cousot P. & Cousot R.[1977b], Automatic synthesis of optimal invariant assertions: mathematical foundations, ACM-Symp. on Artificial Int. & Prog. Languages, SIGPLAN Notices 12, 8(Aug. 1977), 1–12.
Cousot P. & Cousot R.[1979a], Systematic design of program analysis frameworks, 6th ACM-POPL, (Jan. 1979), 269–282.
Cousot P. & Cousot R.[1979b], Constructive versions of Tarski's fixed point theorems, Pacific J. Math. 82(1979), 43–57.
Cousot P. & Halbwachs N.[1978], Automatic discovery of linear restraints among variables of a program, 5th ACM-POPL, (Jan. 1978), 84–97.
Francez N., Hoare C.A.R., Lehmann D.J. & de Roever W.P.[1978], Semantics of nondeterminism, concurrency and communication, Lect. Notes Comp. Sci. 64, Springer Verlag, Extended abstract, (Sept. 1978), 191–200.
Gries D.[1979], Yet another exercise: using two shared variables in two processes to provide starvation-free mutual exclusion, TR 79-372, Dept. Comp. Sci., Cornell Univ., N.Y., (1979).
Hoare C.A.R.[1978], Communicating sequential processes, Comm. ACM 21, 8(1978), 666–677.
Owicki S. & Gries D.[1976], An axiomatic proof technique for parallel programs I, Acta Informatica 6(1976), 319–340.
Reif J.H.[1979], Data flow analysis of communicating processes, 6th ACM-POPL, (Jan. 1979), 257–268.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cousot, P., Cousot, R. (1980). Semantic analysis of communicating sequential processes. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_65
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive