Abstract
A method is presented for proving the correctness of an implementation of shared abstract data types. The proposed correctness proof method is an extension of Hoare's method developed for proving the correctness of an implementation of abstract data types specified in a sequential programming environment. An example is given to illustrate the proposed proof method.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.W. Dijkstra "Guarded Commands, Nondeterminacy and Formal Derivation of Programs" Comm. of the ACM 18, 8, pp. 453–457 /1975/
C.A.R. Hoare Proofs of Correctness of Data Representations,Acta Informatica I. pp. 271–281. /1972/
C.A.R. Hoare Monitors: an Operating System Structuring Concept Comm. of the ACM 17. 10, pp. 549–556 /October 1974/
J.H. Howard Proving Monitors Comm.of the ACM 19,5, pp. 273–279 /1976/
L. Kozma A Transformation of Strongly Correct Concurrent Programs In: Proceedings of Third Hungarian Computer Science Conference, pp. 157–170 /1981/
L. Lamport Proving the Correctness of Multiprocess Programs EIII Transactions on Software Engineering, Vol. SE-3, No. 2., /March 1977/
A. van Lamsweerde and M. Sintzoff Formal Derivation of Strongly Correct Acta Informatica 12, pp. 1–31. /1979/
M.S. Laventhal Synthesis of synchronization code for data abstracti abstractions M.I.T. Laboratory for Computer Science /1978/
S. Owicki An axiomatic proof technique for parallel programs II. shared data abstractions Stanford University /1976/
S. Owicki and D. Gries An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6, pp. 319–340 /1976/
S. Owicki Verifying Concurrent Programs with Shared Data Classes In: Formal Description of Programming Concepts, E.J. Neuhold /e.d./ North-Holland Publishing Company /1978/
M. Shaw, W.A. Wulf, R.L. London Abstraction and Verification in Alphard: Defining and Specifiying Iteration and Generators Comm. of the ACM, 20, 8. pp. 353–364 /Aug. 1977/
J. Spitzen and B. Wegbreit The Verification and Synthesis of Data Structures Acta Informatica 4. pp. 127–144 /1975/
L. Varga Specification of Reliable Software Operációs Rendszerek Téli Iskola MTA Számitástechnikai és Automatizálási Kutató Intézet Tanulmányok 113/1980 309–325
W. Wulf, R. London and M. Shaw "An Introduction to the Construction and Verification of Alphard Programs" IEEE Transactions of Software Eng. SE-2, pp. 253–264 /1976/
W.A. Wulf, R.L. London and M. Shaw Abstraction and Verification in Alphard: A Symbol Table Example In. Proceedings of IFIP TC2 Working Conference, Novosibirsk /1977/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kozma, L. (1982). Proving the correctness of implementations of shared data abstractions. In: Dezani-Ciancaglini, M., Montanari, U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11494-7_16
Download citation
DOI: https://doi.org/10.1007/3-540-11494-7_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11494-9
Online ISBN: 978-3-540-39184-5
eBook Packages: Springer Book Archive