Skip to main content

Fast Slicing of Concurrent Programs

  • Conference paper
High Performance Computing – HiPC’99 (HiPC 1999)

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

Included in the following conference series:

Abstract

Debugging complex concurrent programs is a very difficult problem. Slicing techniques can simplify debugging and understanding these programs. However, slicing of concurrent program is compute-intensive asthe required intermediate graph often becomes large. In this context, we generalize the structure of the intermediate graph representation of concurrent programs and this leads us to introduce the notion of Concurrent Control Flow Graph (CCFG). We introduce a parallel algorithm to compute static slices of concurrent programs using CCFG.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tip, F.: A Survey of Program Slicing Techniques. Journal of Programming Languages, 121–189 (September 1995)

    Google Scholar 

  2. Weiser, M.: Program Slicing. IEEE Trans. on Software Engg. 10(4), 352–357

    Google Scholar 

  3. Ottenstein, K., Ottenstein, L.: The Program Dependence Graph in Software Development Environment. In: Proc. of the ACM SIGSOFT/SIGPLAN Softw. Engg. Symp. on Practical Software Development Environments, SIGPLAN Not., vol. 19(5), pp. 177–184 (1984)

    Google Scholar 

  4. Danicic, S., Harman, M., Sivagurunathan, Y.: A Parallel Algorithm for Static Program Slicing, Tech Report School of Computing, Univ. of North London (1995)

    Google Scholar 

  5. Bach, M.J.: The Design Of The Unix Operating System, PHI Ltd., New Delhi (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goswami, D., Mall, R. (1999). Fast Slicing of Concurrent Programs. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46642-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46642-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics