Dynamic slicing of concurrent programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1970, Issue , 2000, Pages 15-26

  Goswami, D ^a   Mall, R ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CONCURRENT PROGRAM; DEPENDENCE GRAPHS; DYNAMIC PROGRAMS; DYNAMIC SLICING; INTERMEDIATE REPRESENTATIONS; INTERPROCESS COMMUNICATION; LEVELS OF ABSTRACTION; SHARED MEMORY;

MESSAGE PASSING;

EID: 84928606266     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44467-x_2     Document Type: Article

References (11)

1. F. Tip, “A survey of program slicing techniques,” Journal of Programming Languages, vol. 3, no. 3, pp. 121-189, September 1995
2. D. Binkley and K. B. Gallagher, “Program slicing,” Advances in Computers, Ed. M. Zelkowitz, Academic Press, San Diego, CA, vol. 43, 1996
3. M. Weiser, “Program slicing,” IEEE Trans. On Software Engg., vol. 10, no. 4, pp. 352-357, July 1984
4. 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
5. B. Korel and J. Laski, “Dynamic program slicing,” Information Processing Letters, vol. 29, no. 3, pp. 155-163, October 1988
6. 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
7. M. J. Bach, The Design Of The Unix Operating System. Prentice Hall India Ltd., New Delhi, 1986
8. 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
9. 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
10. 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
11. E. Duesterwald, R. Gupta, and M. L. Soffa, “Distributed slicing and partial reex-ecution 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