Skip to main content
SpringerLink
Log in

Automatic construction of test sets: Theoretical approach

  • Automatic Test Case Generation
  • Conference paper
  • First Online:
Baltic Computer Science (BCS 1991)

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

Included in the following conference series:

Abstract

We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS construction for real time systems are considered.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.S.Alberts. The economics of software quality assurance. In Proc. AFIPS Conf. 1976, pp. 433–442.

    Google Scholar 

  2. A.I. Auzins. On the Construction of complete sample systems. Dokl. Akad. Nauk SSSR, Vol. 288, No. 3, 1984, pp. 564–568 (in Russian).

    Google Scholar 

  3. A.I.Auzins. Decidability of the reachability for the relational push-down automata. Programmirovanie, No. 3, 1984, pp. 3–12 (in Russian).

    Google Scholar 

  4. J.M. Barzdin, J.J. Bicevskis, and A.A. Kalninsh. Construction of complete sample system for program testing. Latv. Gosudarst. Univ. Uch. Zapiski, Vol. 210, 1974, pp. 152–187 (in Russian).

    Google Scholar 

  5. J.M. Barzdin, J.J. Bicevskis, and A.A. Kalninsh. Decidable and undecidable cases of the problem of Construction of the complete sample system. Latv. Gosudarst. Univ. Uch. Zapiski, Vol. 210, 1974, pp. 188–205 (in Russian).

    Google Scholar 

  6. J.M. Barzdin, J.J. Bicevskis, and A.A. Kalninsh. Construction of complete sample system for correctness testing. Lecture Notes in Computer Science, Vol. 32, Springer-Verlag, 1975, pp. 1–12.

    Google Scholar 

  7. J.M. Barzdin and A.A. Kalninsh. Construction of complete sample system for programs using direct access files. Latv. Gosudarst. Univ. Uch. Zapiski, Vol. 233, 1975, pp. 123–154 (in Russian).

    Google Scholar 

  8. J.J.Bicevskis. Automatic construction of sample systems. Programmirovanie, No. 3, 1977, pp. 60–70 (in Russian).

    Google Scholar 

  9. J.M.Barzdin, J.J.Bicevskis, and A.A.Kalninsh. Automatic construction of complete sample systems for program testing. In Proc. IFIP Congress, 1977, North-Holland, 1977, pp. 57–62.

    Google Scholar 

  10. J. Bicevskis, J. Borzovs, U. Straujums, A. Zarins, and E.F. Miller. SMOTL-a system to construct samples for data processing program debugging. IEEE Transactions on Software Engineering, SE-5, No. 1, 1979, pp. 60–66.

    Google Scholar 

  11. E.F.Miller, Jr. Program testing technology in the 1980s. In Tutorial: Software Testing and Validation Techniques, 1978, pp. 399–406.

    Google Scholar 

  12. M.L. Minsky. Finite and infinite machines. Prentice-Hall, Englewood Cliffs, N.Y., 1967.

    Google Scholar 

  13. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. of Research and Development, vol. 3, No. 2, 1959, pp. 114–125.

    Google Scholar 

  14. A.G.Tadevosjan. Decidable cases of the problem of construction of a complete sample system. Kibernetika, No. 6, 1985, pp. 41–44 (in Russian).

    Google Scholar 

  15. K.C. Tai. Program testing complexity and test criteria. IEEE Trans. Software Engineering, SE-6, No. 6, 1980, pp. 531–538.

    Google Scholar 

  16. CCITT Specification and Description Language (SDL), Recomendation Z. 100, 1988.

    Google Scholar 

  17. J.Barzdins, J.Borzovs, A.Kalnins, I.Medvedis. Automatic construction of test sets: practical approach, this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Latvia, Raiņa bulv. 19, 226250, Rīga, Latvia

    Andrejs Auziņš, Jānis Bārzdiņš, Jānis Bičevskis, Kārlis Čerāns & Audris Kalniņš

Authors
  1. Andrejs Auziņš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jānis Bārzdiņš
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jānis Bičevskis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kārlis Čerāns
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Audris Kalniņš
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janis Bārzdinš Dines Bjørner

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Auziņš, A., Bārzdiņš, J., Bičevskis, J., Čerāns, K., Kalniņš, A. (1991). Automatic construction of test sets: Theoretical approach. In: Bārzdinš, J., Bjørner, D. (eds) Baltic Computer Science. BCS 1991. Lecture Notes in Computer Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019362

Download citation

  • DOI: https://doi.org/10.1007/BFb0019362

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54131-8

  • Online ISBN: 978-3-540-47427-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation