This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
APT, K.R., Ten years of Hoare's logic, a survey in F.V. JENSEN, B.H. MAYOH and K.K. MØLLER (eds), Proceedings from 5th Scandinavian Logic Symposium, Aalborg University Press, Aalborg, 1979, 1–44. (A second edition of this paper will appear in ACM Transactions on Programming Languages and Systems).
DE BAKER, J.W., Mathematical theory of program correctness, Prentice-Hall International, London, 1980.
BERGSTRA, J.A., J. TIURYN & J.V. TUCKER, Floyd's principle, correctness theories and program equivalence (To appear in Theoretical Computer Science.)
BERGSTRA, J.A. & J.V. TUCKER, Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (To appear in Theoretical Computer Science.)
BERGSTRA, J.A. & J.V. TUCKER, Algebraically specified programming systems and Hoare's logic, in S. EVEN & O. KARIV (eds), Automata, languages and programming, 8th Colloquium, Springer-Verlag, Berlin, 1981, 348–362.
BERGSTRA, J.A. & J.V. TUCKER, Expressiveness and the completeness of Hoare's logic, Mathematical Centre, Department of Computer Science Research Report IW 149, Amsterdam, 1980.
BERGSTRA, J.A. & J.V. TUCKER, Hoare's logic and Peano's arithmetic, Mathematical Centre, Department of Computer Science Research Report, Amsterdam, 1980.
COOK, S.A., Soundness and completeness of an axiom system for program verification, SIAM J. Computing 7 (1978) 70–90.
GOGUEN, J.A., J.W. THATCHER & E.G. WAGNER, An initial algebra approach to the specification, correctness and implementation of abstract data types, in R.T. YEH (ed.), Current trends in programming methodology IV, Data structuring, Prentice-Hall, Engelwood Cliffs, New Jersey, 1978, 80–149.
GREIBACH, S.A., Theory of program structures: schemes, semantics, verification, Springer-Verlag, Berlin, 1975.
HOARE, C.A.R., An axiomatic basis for computer programming, Communications Association Computing Machinery 12 (1969) 576–580.
IGARASHI, S., R.L. LONDON & D.C. LUCKHAM, Automatic program verification I: a logical basis and its implementation, Acta Informatica 4 (1975) 145–182.
LUCKHAM, D.C. & N. SUZUKI, Verification of array, record and pointer operations in PASCAL, ACM-Transactions on Programming Languages and Systems 1 (1979) 226–244.
MUSSER, D.R., Abstract data type specification in the AFFIRM system, IEEE Transactions on Software Engineering 6(1) (1980) 24–32.
SACKS, G.E., Saturated model theory, W.A. Benjamin, Inc., Reading, Massachusetts, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergstra, J., Tucker, J. (1982). The refinement of specifications and the stability of Hoare's Logic. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025772
Download citation
DOI: https://doi.org/10.1007/BFb0025772
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11212-9
Online ISBN: 978-3-540-39047-3
eBook Packages: Springer Book Archive
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.