Skip to main content

The Use of Program Profiling in Software Testing

  • Conference paper
Informatik ’97 Informatik als Innovationsmotor

Part of the book series: Informatik aktuell ((INFORMAT))

Abstract

This paper describes new techniques to help with testing and debugging, using information obtained from path profiling. A path profiler instruments a program so that each run of the program generates a path spectrum for the execution—a distribution of acyclic path fragments that were executed during that run. Our techniques are based on the idea of comparing path spectra from different runs of the program. When different runs produce different spectra, the spectral differences can be used to identify paths in the program along which control diverges in the two runs. By choosing input datasets to hold all factors constant except one, the divergence can be attributed to this factor. The point of divergence itself may not be the cause of the underlying problem, but provides a starting place for a programmer to begin his exploration.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bala, V., “Low overhead path profiling,” Tech. Rep., Hewlett-Packard Labs (1996).

    Google Scholar 

  2. Ball, T. and Larus, J., “Efficient path profiling,” in Proc. of MICRO-29, (Dec. 1996).

    Google Scholar 

  3. Clarke, L.A., Podgurski, A., Richardson, D.J., and Zeil, S.J., “A comparison of data flow path selection criteria,” pp. 244–251 inProc. of the Eighth Int. Conf on Softw. Eng., IEEE Comp. Soc. Press, Wash., DC (1985).

    Google Scholar 

  4. Horwitz, S., Reps, T., and Binkley, D., “Interprocedural slicing using dependence graphs,”ACM Trans. Program. Lang. Syst. 12(1) pp. 26 – 60 (Jan. 1990).

    Article  Google Scholar 

  5. Johnson, S.C, “Postloading for fun and profit,”pp. 325–330 in Proc. of the Winter 1990 USENIX Conf., (Jan. 1990).

    Google Scholar 

  6. Larus, J.R. and Schnarr, E., “EEL: Machine-independent executable editing,”Proc. of the ACM SIGPLAN 95 Conf. on Programming Language Design and Implementation, (LaJolla, CA, June 18-21, 1995),ACM SIGPLANNotices 30(6) pp. 291 – 300 (June 1995).

    Article  Google Scholar 

  7. Ottenstein, K.J. and Ottenstein, L.M., “The program dependence graph in a software development environment, ”Proc. of the ACM SIGSOFT/SIGPLAN Softw. Eng. Symp. on Practical Software Development Environments, (Pittsburgh, PA, Apr. 23-25, 1984),ACM SIGPLAN Notices 19(5) pp. 177–184 (May 1984).

    Article  Google Scholar 

  8. Rapps, S. and Weyuker, E.J., “Selecting software test data using data flow information,”IEEE Trans. on Softw. Eng. SE-11(4) pp.367-375(Apr. 1985).

    Google Scholar 

  9. Reps, T., Horwitz, S., Sagiv, M., and Rosay, G., “Speeding up slicing,”SIGSOFT 94:Proc. of the Second ACM SIGSOFT Symp. on the Found. of Softw. Eng., (New Orleans, LA, Dec. 7–9,1994),ACM SIGSOFT Softw. Eng. Notes 19(5) pp.11–20(Dec. 1994).

    Article  Google Scholar 

  10. Reps, T., Ball, T., Das, M., and Larus, J., “The use of program profiling for software maintenance with applications to the Year 2000 Problem,” in Proc. of ESEC/FSE ’97: Sixth European Softw. Eng. Conf. and Fifth ACM SIGSOFT Symp. on the Found. of Softw. Eng., (Zurich, Switzerland, Sept. 22–25,1997),Lec. Notes inComp. Sci., Springer-Verlag, New York, NY (1997).

    Google Scholar 

  11. Roper, M ., Software Testing, McGraw-Hill, New York, NY (1994)

    Google Scholar 

  12. Sedgewick, R .,Algorithms, Addison-Wesley, Reading, MA (1983).

    MATH  Google Scholar 

  13. Srivastava, A. and Eustace, A., “ATOM: A system for building customized program analysis tools,” Proc. of the ACM SIGPLAN 94 Conf. on Programming Language Design and Implementation, (Orlando, FL, June 22-24, 1994), ACM SIGPLAN Notices 29(6) pp. 196–205 (June 1994).

    Article  Google Scholar 

  14. Weiser, M., “Program slicing,“ IEEE Trans. on Softw. Eng. SE-10(4) pp.352 – 357 (July 1984).

    Google Scholar 

  15. Woodward, M.R., Hedley, D., and Hennell, M.A., “Experience with path analysis and testing of programs,“ IEEE Trans. on Softw. Eng. SE-6(3)pp. 278–286 (May1980).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reps, T. (1997). The Use of Program Profiling in Software Testing. In: Jarke, M., Pasedach, K., Pohl, K. (eds) Informatik ’97 Informatik als Innovationsmotor. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60831-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63066-1

  • Online ISBN: 978-3-642-60831-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics