This is a preview of subscription content, log in via an institution to check access.
1.5 References
Apt, K.R., Francez, N. and de Roever, W.P. A proof system for communicating sequential processes. ACM Transactions on Programming Languages and Systems, Vol. 2, No. 3, July 1980, pp 359–385.
Chandy, K. and Misra, J. Proofs of networks of processes. IEEE TOSE, Vol. SE-7, No. 4, July 1981.
Hoare, C.A.R. A Calculus for Total Correctness for Communicating Sequential Processes. Science of Computer Programming, Vol. 1, 1981, pp. 49–72.
Jones, C.B. Software Development: a rigorous approach. Prentice-Hall International, 1980.
Levin, G.M. and Gries, D. A Proof Technique for Communicating Sequential Processes. Acta Information, Vol. 15, 1981, pp 281–302.
Lucas, P. On the Formaisation of Programming Languages: Early History and Main Approaches. in ‘The Vienna Development Method: The Meta Language', Bjorner, D. and Jones, C.B. LNCS, Vol. 61, Springer-Verlag, 1978.
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1985). Introduction. In: A Survey of Verification Techniques for Parallel Programs. Lecture Notes in Computer Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15239-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-15239-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15239-2
Online ISBN: 978-3-540-39416-7
eBook Packages: Springer Book Archive