Skip to main content

A Novel Approach for Dynamic Slicing of Distributed Object-Oriented Programs

  • Conference paper

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

Abstract

Program slicing has many applications such as program debugging, testing and maintenance. We propose a new dynamic slicing technique for distributed object-oriented programs. We introduce the notion of Distributed Program Dependence Graph (DPDG). Our dynamic slicing technique uses DPDG as the intermediate program representation and is based on marking and unmarking the edges in the DPDG as and when the dependencies arise and cease during run-time. Our approach eliminates the use of trace files and is more efficient than the existing algorithms.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Weiser, M.: Programmers use slices when debugging. Communications of the ACM 25, 446–452 (1982)

    Article  Google Scholar 

  2. Korel, B., Laski, J.: Dynamic program slicing. Information Processing Letters 29, 155–163 (1988)

    Article  MATH  Google Scholar 

  3. Zhao, J.: Dynamic slicing of object-oriented programs. Technical report, Information Processing Society of Japan (1998)

    Google Scholar 

  4. Mall, R.: Fundamentals of Software Engineering, 2nd edn. Prentice Hall, India (2003)

    Google Scholar 

  5. Goswami, D., Mall, R.: An efficient method for computing dynamic program slices. Information Processing Letters 81, 111–117 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Mund, G.B., Mall, R., Sarkar, S.: An efficient dynamic program slicing technique. Information and Software Technology 44, 123–132 (2002)

    Article  Google Scholar 

  7. Larson, L.D., Harrold, M.J.: Slicing object-oriented software. In: Proceedings of the 18th International Conference on Software Engineering, German (1996)

    Google Scholar 

  8. Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems 12, 26–61 (1990)

    Article  Google Scholar 

  9. Chen, Z., Xu, B.: Slicing concurrent java programs. ACM SIGPLAN Notices 36, 41–47 (2001)

    Article  Google Scholar 

  10. Zhao, J.: Slicing concurrent java programs. In: Proceedings of the 7th IEEE International Workshop on Program Comprehension (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mohapatra, D.P., Mall, R., Kumar, R. (2004). A Novel Approach for Dynamic Slicing of Distributed Object-Oriented Programs. In: Ghosh, R.K., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2004. Lecture Notes in Computer Science, vol 3347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30555-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30555-2_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24075-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics