Abstract
A new method for verification of programs is proposed. The main idea is to reduce assertions about programs to the problem of reachability. It is shown in [1] that the reachability problem is algorithmically solvable for a wide class of programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barzdin J., Bicevskis J. and Kalninsh A., Automatic construction of complete sample system for program testing. In: Information Processing 77, (B. Gilchrist, Ed.), pp. 57–62, North-Holland Publishing Co., 1977.
Bicevskis J., Borzovs J., Straujums U., Zarins A. and Miller E.F., SMOTL — A system to construct samples for data processing program debugging, IEEE Trans. Software Engineering, vol. SE-5, No. 1, 1979, pp. 60–66.
Panzl D.J., Automatic software test drivers, Computer, vol. 11, No. 4, 1978, pp. 44–50.
Bird M.R., The equivalence problem for deterministic two-tape automata, J. Comput. and Syst. Scien., vol. 7, 1973, pp. 218–236.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barzdin, J.M. (1979). The problem of reachability and verification of programs. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive