Skip to main content
Springer Nature Link
Log in

Test Generation for Compilers and Other Formal Text Processors

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

A concept of automated test suites generation for testing compilers and other formal text processors is suggested. An approach based on the generation of tests from models is used.

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. Aho, A., Sethi, R., and Ullman, J., Compilers, Principles, Techniques, and Tools, Reading, Mass.: Addison-Wesley, 1986. Translated under the title Kompilyatory: printsipy, tekhnologii, instrumenty, Moscow: 2001.

    Google Scholar 

  2. Muchnick, S., Advanced Compiler Design and Implementation, Kaufmann, 1997.

  3. Demakov, A.V., Zelenova, S.A., and Zelenov, S.V., Testing Parsers of Texts in Formal Languages, Programmnye sistemy i instrumenty: Tematicheskii sbornik facul'teta VMK, Moscow State Univ., 2001, issue 2, pp. 150–156.

  4. Bourdonov, I.B., Demakov, A.V., Jarov, A.A., Kossatchev, A.S., Kuliamin, V.V., Petrenko, A.K., and Zelenov, S.V., Java Specification Extension for Automated Test Development, Lect. Notes Comput. Sci., 2001, vol. 2244, pp. 301–307.

    Google Scholar 

  5. Bourdonov, I.B., Kossatchev, A.S., Petrenko, A.K., and Galter, D. KVEST: Automated Generation of Test Suites from Formal Specifications, Proc. World Congress of Formal Methods, Toulouse, Lect. Notes Comput. Sci., 1999, vol. 1708, pp. 608–621.

    Google Scholar 

  6. Petrenko, A.K., Specification-Based Testing: Towards Practice, Lect. Notes Comput. Sci., 2001, vol. 2244, pp. 287–300.

    Google Scholar 

  7. Petrenko, A.K. and Vorobiev, A.I. Industrial Experience in Using Formal Methods for Software Development in Nortel Networks, Proc. on Testing Computer Software, Washington, 2000, pp. 103–112.

  8. Information Processing-Open Systems Interconnection- Specification of Abstract Syntax Notation One (ASN.1), International Organization for Standardization and International Electrotechnical Committee, Int. Standard 8824, 1987.

  9. Information Technology-Abstract Syntax Notation One (ASN.1): Specification of Basic Notation, ITU-T Recommendation X.680International Telecommuncation Union, 1995.

  10. Wang, D.C., Appel, A.W., Korn, J.L., and Serra, C.S., The Zephyr Abstract Syntax Description Language. USENIX, Proc. Conf. on Domain-Specific Languages, Santa Barbara, Calif., 1997, pp. 213–227.

  11. Harm, J., Lämmel, R., and Riedewald, G., The Language Development Laboratory (LDL), Selected papers from the 8th Nordic Workshop on Programming Theory (NWPT'96), Oslo, 1997, Research Report 248, pp. 77–86, http://www.cwi.nl/ralf/nwpt96.ps.

  12. Lämmel, R., Grammar Testing, Proc. Fundamental Approaches to Software Engineering (FASE), Genova, 2001, Lect. Notes Comput. Sci., 2001, vol. 2029, pp. 201–216, http://www.cwi.nl/ralf/fase.01.ps.

    Google Scholar 

  13. Dushina, Ju., Benjamin, M., and Geist, D., Semi-Formal Test Generation with Genevieve, DAC, 2001, pp. 617–622.

  14. Farchi, E., Hartman, A., and Pinter, S.S., Using a Modelbased Test Generator to Test for Standard Conformance, IBM Syst. J., 2002, vol. 41, no. 1, pp. 89–110.

    Google Scholar 

  15. Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Using FSM for Software Testing, Programmirovanie, 2000, no. 2, pp. 61–73.

    Google Scholar 

  16. Petrenko, A.K. et al., Testing Compilers on the basis on the Formal Language Model, Preprint of Keldysh Inst. of Appl. Math., Russian Acad. Sci., Moscow, 1992, no. 45.

  17. Verifix, http://i44www.info.uni-karlsruhe.de/verifix.

  18. Hannan, J. and Pfenning, F., Compiler Verification in LF, Proc. 7th Annual IEEE Symp. on Logic in Computer Science, 1992, pp. 407–418, http://www.cs.cmu.edu/fp/papers/ lics92.ps.gz.

  19. Wand, M. and Wang, Zh., Conditional Lambda-Theories and the Verification of Static Properties of Programs, Proc. 5th IEEE Symp. on Logic in Computer Science, 1990, pp. 321–332.

  20. Wand, M., Compiler Correctness for Parallel Languages, Conf. on Functional Programming Languages and Computer Architecture (FPCA), ACM Press, 1995, pp. 120–134.

  21. Assmann, U., Graph Rewrite Systems For Program Optimization, ACM Trans. Programming Languages and Systems (TOPLAS), 2000, vol. 22, no. 4, pp. 583–637, ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-2955.ps.gz.

    Google Scholar 

  22. Jaramillo, C., Gupta, R., and Soffa, M.L., Comparison Checking: An Approach to Avoid Debugging of Optimized Code, ACM SIGSOFT 7th Symp. on Foundations of Software Engineering and European Software Engineering Conference, Toulouse, Springer, Lect. Notes Comput. Sci., 1999, vol. 1687, pp. 268–284, http://www.cs.arizona. edu/gupta/research/Publications/Comp/fse99.ps.

    Google Scholar 

  23. Necula, G., Translation Validation for an Optimizing Compiler, Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Vancouver, 2000, pp. 83–95, http://www-nt.cs.berkeley.edu/home/necula/ public_html/pldi00a.ps.gz.

  24. McNerney, T.S., Verifying the Correctness of Compiler Transformations on Basic Blocks using Abstract Interpretation, Symp. on Partial Evaluation and Semantics-Based Program Manipulation 1991, pp. 106–115, ftp://s2kftp.cs.berkeley.edu/pub/personal/aiken/cs294/papers/verifying-compiler-transformations.ps.Z.

Download references

Author information

Authors and Affiliations

  1. Institute for System Programming, Russian Academy of Sciences, ul. Bol'shaya Kommunisticheskaya 25, Moscow, 109004, Russia sophia@ispras.ru, kos@ispras.ru, petrenko@ispras.ru

    S. V. Zelenov, S. A. Zelenova, A. S. Kossatchev & A. K. Petrenko

Authors
  1. S. V. Zelenov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. A. Zelenova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. S. Kossatchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. K. Petrenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zelenov, S.V., Zelenova, S.A., Kossatchev, A.S. et al. Test Generation for Compilers and Other Formal Text Processors. Programming and Computer Software 29, 104–111 (2003). https://doi.org/10.1023/A:1022904917707

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022904917707

Keywords