| An overview of methods for dependence analysis of concurrent programs |
| Full text |
Pdf
(816 KB)
|
| Source
|
ACM SIGPLAN Notices
archive
Volume 37 , Issue 8 (August 2002)
table of contents
COLUMN: Technical correspondence
table of contents
Pages: 45 - 52
Year of Publication: 2002
ISSN:0362-1340
|
|
Authors
|
|
Zhenqiang Chen
|
Southeast University, Nanjing 210096, China
|
|
Baowen Xu
|
Southeast University, Nanjing 210096, China and Wuhan University, Wuhan 430072, China
|
|
Jianjun Zhao
|
Fukuoka Institute of Technology, Japan
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 57, Citation Count: 5
|
|
|
ABSTRACT
Program dependence analysis is an analysis technique to identify and determine various program dependencies in source codes, which has been widely used in program understanding, debugging, testing, reverse engineering, and maintenance. However, there are still many difficulties to be solved when carrying out dependence analysis for concurrent programs because the execution of statements is unpredictable. This survey describes methods and research directions for dependence analysis of concurrent programs, especially about how to obtain the dependencies between concurrently executed statements, the factors leading to intransitivity among dependencies, and how to deal with the intransitivity problem. By careful comparisons, users can select a proper algorithm for their requirements.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
 |
3
|
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
 |
7
|
|
| |
8
|
|
 |
9
|
Mary Jean Harrold , Brian Malloy , Gregg Rothermel, Efficient construction of program dependence graphs, Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis, p.160-170, June 28-30, 1993, Cambridge, Massachusetts, United States
|
| |
10
|
|
 |
11
|
|
 |
12
|
|
| |
13
|
ISO/IEC 8652:1995(E), Ada Reference Manual-Language and Standard Libraries.
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
 |
17
|
|
| |
18
|
Ohata, F., Nishimatsu, A., Inoue, K. Analyzing Dependence Locality for Efficient Construction of Program Dependence Graph. Information and Software Technology, 2000, 42: 935-946
|
| |
19
|
|
 |
20
|
Saurabh Sinha , Mary Jean Harrold , Gregg Rothermel, System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow, Proceedings of the 21st international conference on Software engineering, p.432-441, May 16-22, 1999, Los Angeles, California, United States
[doi> 10.1145/302405.302675]
|
| |
21
|
Weiser, M. Program Slicing, IEEE Trans. Software Engineering, 1984, 16(5): 498-509.
|
| |
22
|
Xu, B. Reverse Program Flow Dependency Analysis and Applications. Chinese Journal of Computers, 1993, 16(5): 385-392
|
| |
23
|
Yang, H., Xu, B. Design and Implementation of A PSS/ADA Program Slicing System. Chinese J. Computer Research and Development, 1997, 34(3): 217 - 222
|
| |
24
|
J. Zhao, Using Dependence Analysis to Support Software Architecture Understanding, in M. Li (Ed.), "New Technologies on Computer Software," International Academic Publishers, 1997, 135-142.
|
| |
25
|
|
|