The problem of reachability and verification of programs

  • J. M. Barzdin
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Panzl D.J., Automatic software test drivers, Computer, vol. 11, No. 4, 1978, pp. 44–50.Google Scholar
  4. 4.
    Bird M.R., The equivalence problem for deterministic two-tape automata, J. Comput. and Syst. Scien., vol. 7, 1973, pp. 218–236.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • J. M. Barzdin
    • 1
  1. 1.Computing CentreLatvian State UniversityRigaUSSR

Personalised recommendations