Skip to main content
Springer Nature Link
Log in

Application of finite automatons for program testing

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The application of the finite automaton theory to the problem of program testing is discussed. The problem is reduced to testing a finite automaton. Testing of automatons using their state graphs, factor graphs, testing using factor graphs, and methods for factor graphs construction are discussed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Wong, H., Barantsev, A., Burdonov, I., and Kosachev, A., Report on Test Generation Methodology,NORTEL, 1997.

  2. Beizer, B.,Software Testing Techniques, New York: Van Nostrand Reinhold, 1990, 2nd edition.

    Google Scholar 

  3. Burdonov, I., Kosachev, A., Petrenko, A., Cheng, S., and Wong, H., Formal Specification and Verification of SOS Kernel,BNR/NORTEL Design Forum, 1996.

  4. Hoffman, D. and Strooper, P., ClassBench: a Framework for Automated Class Testing,Software Maintenance: Practice and Experience, 1997, vol. 27, no. 5, pp. 573–579.

    Article  Google Scholar 

  5. Murray, L., Carrington, D., MacColl, I., McDonald, J., and Strooper, P., Formal Derivation of Finite State Machines for Class Testing,ZUM'98: The Z Formal Specification Notation, 11th Int. Conf. of Z Users, Bowen, J.P., Fett, A., and Hinchey, M.G., Eds.,Lect. Notes Comput. Sci., Springer, 1998, vol. 1493, pp. 42–59.

    Article  Google Scholar 

  6. Peters, D.K. and Parnas, D.L., Using Test Oracles Generated from Program Documentation,IEEE Trans. Software Eng., 1998, vol. 24, no. 3, pp. 161–173.

    Article  Google Scholar 

  7. Petrenko, A.K., Burdonov, I.B., Drojjina, A.Yu., Kossatchev, A.S., Maximov, A.V., Sazanov, Yu.L., and Sumar, H., Preliminary Test Methodology and Test System Report,NORTEL, 1995.

  8. Turner, C.D. and Robson, D.J., The State-based Testing of Object-Oriented Programs,Proc. IEEE Conf. Software Maintenance, 1993, pp. 302–310.

Download references

Author information

Authors and Affiliations

  1. Institute of System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya 25, 109004, Moscow, Russia

    I. B. Burdonov, A. S. Kossatchev & V. V. Kulyamin

Authors
  1. I. B. Burdonov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Kossatchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. V. Kulyamin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. B. Burdonov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burdonov, I.B., Kossatchev, A.S. & Kulyamin, V.V. Application of finite automatons for program testing. Program Comput Soft 26, 61–73 (2000). https://doi.org/10.1007/BF02759192

Download citation

  • Received:

  • Issue Date:

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

Keywords