ACM Home Page
Please provide us with feedback. Feedback
Interprocedural Def-Use associations in C programs
Full text PdfPdf (1.12 MB)
Source International Symposium on Software Testing and Analysis archive
Proceedings of the symposium on Testing, analysis, and verification table of contents
Victoria, British Columbia, Canada
Pages: 139 - 153  
Year of Publication: 1991
ISBN:0-89791-449-X
Authors
Hemant D. Pande  Siemens Corporate Research Inc., 755 College Rd. East, Princeton, NJ
William Landi  Department of Computer Science, Rutgers University, New Brunswick, New Jersey
Sponsor
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 26,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/120807.120820
What is a DOI?

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
B. G. Cooper. Ambitious data flow analysis of procedural programs. Master's thesis, University of Minnesota, May 1989.
6
7
8
 
9
10
 
11
M. J. Harrold and M. L. Soffa. Computation of interprocedural definition and use dependencies. In Proceedings of the 1990 International Conference on Computer Languages, pages 297-306, 1990.
 
12
L. J. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. In Proceedings of the 1989 International Conference on Parallel Processing, pages 49-56, August 1989.
13
14
 
15
N. Jones and S. Muchnick. Flow analysis and optimization of lisp-like structures, In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, pages 102-131. Prentice Hall, 1979.
 
16
 
17
 
18
W. Landi and B. G. Ryder. Aliasing with and without pointers: A problem taxonomy. Center for Computer Aids for Industrial Productivity Technical Re- 148 port CAIP-TR-125, Rutgers University, September 1990.
19
 
20
W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. Laboratory for computer science research technical report, Rutgers University, August 1991. in preparation.
 
21
22
 
23
Sying-Syang Liu and Abu-Bakr Taha. Interprocedural definition-use dependency analysis for recursive procedures. Technical Report SERC-TR-42-F, Software Engineering Research Center, University of Florida, Gainesville, Florida, March 1990.
 
24
D. Lomet. Data flow analysis in the presence of procedure calls. Journal of Research and Development, 21(6):559-571, November 1977.
25
 
26
Thomas J. Ostrand. Data-flow testing with pointers and function calls. In Proceedings of the Pacific Northwest Software Quality Conference, October 1990.
 
27
H. D. Pande, W. Landi, and B. G. Ryder. Interprocedural reaching definitions in the presence of single level pointers. Siemens corporate research technical report, Siemens, 1991. in preparation.
 
28
 
29
B. G. Ryder. Ismm: Incremental software maintenance manager. In Proceedings of the IEEE Computer Society Conference on Software Maintenance, pages 142-164, October 1989.
30
31
 
32
Mark Weiser. Program slicing. IEEE Transactions on Software Engineering, SE-10(4) :352-357, July 1984.
33

CITED BY  11

Collaborative Colleagues:
Hemant D. Pande: colleagues
William Landi: colleagues