skip to main content
10.1145/229000.226311acmconferencesArticle/Chapter ViewAbstractPublication PagesisstaConference Proceedingsconference-collections
Article
Free Access

The path-wise approach to data flow testing with pointer variables

Authors Info & Claims
Published:01 May 1996Publication History

ABSTRACT

This paper describes a new approach to performing data flow testing on programs that use pointer variables and a tool based on this approach. Our technique is based on the observation that, under certain reasonable assumptions, we can determine which dereferenced pointers are aliased whenever control reaches a given program point via a particular path. Furthermore, we can group together paths which behave similarly and represent them by regular expressions. The resulting test requirements demand that the test data execute representatives of particular sets of paths between variable definitions and uses.

References

  1. 1.A. Aho, R. Sethi, and J. Ullman. Compzlers: Princzples, Technzques, and Tools. Addison-Wesley, Reading, Mass., 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.P. G. Frankl. The Use of Data Flow Information for the ,qelectzon and Evaluation of Software Test Data. PhD thesis, Courant Institute of Mathen~atical Sciences, New York University, Oct. 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.P. G. Frankl, S. N. Weiss, and E. J. Weyuker. AS- SET - a system to select and evaluate tests. In Proceedzngs of the iEEE Conference on Software Tools, pages 72-79, Apr. 1985.Google ScholarGoogle Scholar
  4. 4.P. G. Frankl and E. J. Weyuker. An applicable family of data flow testing criteria. IEEE Transactzons on Software Engineering, SE-14(10):1483- 1498, Oct. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.M. j. Harrold and M. L. Sofia. lnterprocedural data flow testing. In Proceedings ACM SIGSOFT Third Sympos,um on Software Testing, Analysis, and Verification, pages 158-167. ACM Press, Dec. 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.P. Herman. A data flow analysis approach to program testing. The A ustrahan Computer Journal, 8(3):92-96, Nov. 1976.Google ScholarGoogle Scholar
  7. 7.J. Horgan and S. London. Data flow coverage and the C language. In Proceedings Fourth Symposium on Software Testing, Analysis, and Verification, pages 87-97. ACM Press, Oct. 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.W. Landi and B. Ryder. A safe approximate algorithm for interprocedural pointer aliasing, in Proceedzngs of the SIGPLAN '92 Conference on Programm~ng Language Deszgn and Implcmcntatzon, pages 235-248. ACM Press, June 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.J. W. Laski and B. Korel. A data flow oriented program testing strategy. IEEE Transactions on Software Engineering, SE-9(3):347-354, May 1983.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.S. Ntafos. On required element testing. iEEE Transactzons on Software Engzneering, SE- 10(6):795-803, Nov. 1984.Google ScholarGoogle Scholar
  11. 11.T. J. Ostrand and E. J. Weyuker. Data flow based test adequacy analysis for languages with pointers. In Proceedzngs Fourth Symposzum on Software Testing, A nalys~s, and Vemficatzon, pages 74-86. ACM Press, Oct. 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.H. Pande, W. Landi, and B. Ryder. Interprocedural def-use associations for C systems with single level pointers. IEEE Transactions on Software Engineering, 20(5):385-403, May 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.T. Parr and R. Quong. ANTLI~: a predicated- LL(k) parser generator. Software Practice and Experience. To appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.S. Rapps and E. J. Weyuker. Selecting software test data using data flow information. IEEE Transactions on Software Engtneerzng, SE-14(4):367-375, Apr. 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.H. Ural and B. Yang A test selection method for protocol testing. IEEE Transactions on Commun,catzons, 39(4), Apr. 1991.Google ScholarGoogle Scholar

Index Terms

  1. The path-wise approach to data flow testing with pointer variables

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            ISSTA '96: Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
            May 1996
            294 pages
            ISBN:0897917871
            DOI:10.1145/229000

            Copyright © 1996 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 May 1996

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate58of213submissions,27%

            Upcoming Conference

            ISSTA '24

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader