×

zbMATH — the first resource for mathematics

The ”Hoare logic” of concurrent programs. (English) Zbl 0416.68032

MSC:
68Q65 Abstract data types; algebraic specification
68Q60 Specification and verification (program logics, model checking, etc.)
03B60 Other nonclassical logic
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ashcroft, E.A.: Proving assertions about parallel programs. J. Comput. Systm. Sci. 10, 110-135 (1975) · Zbl 0299.68013
[2] Floyd, R.W.: Assigning meanings to programs. Proc. A.M.S. Symp. in Applied Math., Amer. Math. Soc. pp. 19-31, 1967 · Zbl 0189.50204
[3] Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12, 576-583 (1969) · Zbl 0179.23105
[4] Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Soft. Engrg. SE-3, 2, 125-143 (1977) · Zbl 05341279
[5] Lamport, L.: Sometime is sometimes not never: On the temporal logic of programs. Proceedings of the Seventh Annual Symposium on Principles of Programming Languages, ACM SIGACTSIGPLAN, January 1980
[6] Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Informat. 6, 319-340 (1976) · Zbl 0324.68007
[7] Pnueli, A.: The temporal logic of programs. Proc. of the 18th Symposium on the Foundations of Computer Science, ACM, November 1977
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.