Improved program dependence graph and algorithm for static slicing concurrent programs

Authors:
Jianyu Xiao;Deyun Zhang;Haiquan Chen;Hao Dong
Affiliations:
School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an, China;School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an, China;School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an, China;School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an, China
Venue:
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Year:
2005

Citing 8
Cited 0

On the adequacy of program dependence graphs for representing programs

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static slicing of threaded programs

Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
On optimal slicing of parallel programs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An overview of methods for dependence analysis of concurrent programs

ACM SIGPLAN Notices
Slicing Concurrent Programs - A Graph-Theoretical Approach

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
An Approach to Analyzing Dependency of Concurrent Programs

APAQS '00 Proceedings of the The First Asia-Pacific Conference on Quality Software (APAQS'00)
Slicing Concurrent Java Programs

IWPC '99 Proceedings of the 7th International Workshop on Program Comprehension
Context-sensitive slicing of concurrent programs

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the comparison among existing slicing algorithms and analysis of the fact that Krinke’s algorithm [9] produces imprecise program slice for the program structure which has loops nested with one or more threads, a conclusion is drawn that the reason for the impreciseness is that Krinke’s data structure—threaded program dependence graph—had over coarse definitions of data dependence relations between threads, and the constraint put on the execution path in concurrent program is unduly loose. An improved threaded program dependence graph is proposed which adds a new dependence relation of loop-carried data dependence crossing thread boundaries. An improved slicing algorithm is also proposed which introduces a new concept of regioned execution witness to further constrain the execution path. The pseudo code of the algorithm adding loop-carried data dependence relations crossing thread boundaries is given. The pseudo code of the new slicing algorithm is also given whose complexity has been analyzed. Examples show that the improved slicing algorithm designed on the improved data structure can restrain the impreciseness of Krinke’s.