Axioms for the term-wise correctness of programs

Sokołowski, Stefan

doi:10.1007/3-540-10856-4_118

Axioms for the term-wise correctness of programs

Stefan Sokołowski¹

Communications
Conference paper
First Online: 01 January 2005

116 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 118))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

References

Cook, S.A. “Soundness and completeness of an axiom system for program verification” SIAM J. Comput. 7, 70–90, 1978
Google Scholar
Mazurkiewicz, A. “Proving properties of processes” Algorytmy XI, 5–22, 1974
Google Scholar
Sokołowski, S. “Programs as term transformers” Fundamenta Informaticae III, 419–432, 1980
Google Scholar

Download references

Author information

Authors and Affiliations

Institute of Mathematics, University of Gdańsk, ul. Wita Stwosza 57, 80-952, Gdańsk, Poland
Stefan Sokołowski

Authors

Stefan Sokołowski
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Sokołowski, S. (1981). Axioms for the term-wise correctness of programs. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_118

Download citation

DOI: https://doi.org/10.1007/3-540-10856-4_118
Published: 03 June 2005
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10856-6
Online ISBN: 978-3-540-38769-5
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics