Abstract
We present a framework for computing dynamic slices of concurrent programs using a form of dependence graph as intermediate representations. We introduce the notion of a Dynamic Program Dependence Graph (DPDG) to represent various intra- and interprocess dependences of concurrent programs. We construct this graph through three hierarchical stages. Besides being intuitive, this approach also enables us to display slices at different levels of abstraction. Wehave considered interprocess communication using both shared memory and message passing mechanisms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Tip, “A survey of program slicing techniques,” Journal of Programming Languages, vol. 3, no. 3, pp. 121–189, September 1995.
D. Binkley and K. B. Gallagher, “Program slicing,” Advances in Computers, Ed. M. Zelkowitz, Academic Press, San Diego, CA, vol. 43, 1996.
M. Weiser, “Program slicing,” IEEE Trans. on Software Engg., vol. 10, no. 4, pp. 352–357, July 1984.
K. Ottenstein and L. Ottenstein, “The program dependence graph in software development environment,” In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, SIG-PLAN Notices, vol. 19, no. 5, pp. 177–184, 1984.
B. Korel and J. Laski, “Dynamic program slicing,” Information Processing Letters, vol. 29, no. 3, pp. 155–163, October 1988.
H. Agrawal and J. Horgan, “Dynamic program slicing,” In Proceedings of the ACM SIGPLAN’ 90 Conf. on Programming Language Design and Implementation, SIG-PLAN Notices, Analysis and Verification, White Plains, New York, vol. 25, no. 6, pp. 246–256, June 1990.
M. J. Bach, The Design Of The Unix Operating System. Prentice Hall India Ltd., New Delhi, 1986.
L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Communications of the ACM, vol. 21, no. 7, pp. 558–565, July 1978.
J. Cheng, “Slicing concurrent programs-a graph theoretical approach,” In Proceedings of the First International Workshop on Automated and Algorithmic Debugging, P. Fritzson Ed., Lecture Notes in Comp. Sc., Springer-Verlag, vol. 749, pp. 223–240, 1993.
J. D. Choi, B. Miller, and R. Netzer, “Techniques for debugging parallel programs with owback analysis,” ACM Trans. on Programming Languages and Systems, vol. 13, no. 4, pp. 491–530, 1991.
E. Duesterwald, R. Gupta, and M. L. Soffa, “Distributed slicing and partial reexecution for distributed programs,” In Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, New Haven Connecticut, LNCS Springer-Verlag, vol. 757, pp. 329–337, August 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goswami, D., Mall, R. (2000). Dynamic Slicing of Concurrent Programs. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-44467-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41429-2
Online ISBN: 978-3-540-44467-1
eBook Packages: Springer Book Archive