zbMATH — the first resource for mathematics

Recursive assertions and parallel programs. (English) Zbl 0436.68009

68Q60 Specification and verification (program logics, model checking, etc.)
68N01 General topics in the theory of software
PDF BibTeX Cite
Full Text: DOI
[1] Apt, K.R., Bergstra, J.A., Meertens, L.G.L.T.: Recursive assertions are not enough ? or are they?, Theor. Comput. Sci. 8, 73-87 (1979) · Zbl 0393.68016
[2] Cook, S.A.: Soundness and completeness of an axiom system for program verification, SIAM J. Comput. 7, 70-90 (1978) · Zbl 0374.68009
[3] Hennessy, M.C.B., Plotkin, G.D.: Full abstraction for a simple programming language. In: Proc. 8th Symposium on Mathematical Foundations of Computer Science, pp. 108-120, Lecture Notes in Computer Science 74, Berlin Heidelberg New York: Springer 1979 · Zbl 0457.68006
[4] Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Software Engrg., 3, 125-143 (1977) · Zbl 05341279
[5] Owicki, S.: Axiomatic proof techniques for parallel programs. Computer Science Dept., Cornell University. PhD thesis 1975
[6] Owicki, S.: A consistent and complete deductive system for the verification of parallel programs, In: Proc. 8th Annual Symposium on Theory of Computing, pp. 73-86 (1976) · Zbl 0365.68010
[7] Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs, Acta Informat. 6, 319-340 (1976) · Zbl 0324.68007
[8] Shoenfield, J.R.: Mathematical logic, Addison-Wesley 1967 · Zbl 0155.01102
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.