Abstract
Existing pointer analysis algorithms usually adopt a lower-level intermediate representation which can not sufficiently represent the syntactical structure and the semantic of programs. This makes them difficult to apply to program standardization. To solve this problem, a flow-sensitive and context-sensitive pointer analysis algorithm based on control dependence tree is presented in this paper. The control dependence tree is used as the intermediate representation for the source program, and an improved point-to representation is proposed to represent alias information. Based on this, data flow equations are defined to compute the point-to information by traversing the control dependence tree. Test results show that its accuracy is higher than that of Emami's approach, and it can greatly improve the variation removal rate of the program standardization.
| Original language | English |
|---|---|
| Pages (from-to) | 1104-1108 |
| Number of pages | 5 |
| Journal | Tien Tzu Hsueh Pao/Acta Electronica Sinica |
| Volume | 37 |
| Issue number | 5 |
| State | Published - May 2009 |
| Externally published | Yes |
Keywords
- Control dependence tree
- Pointer alias
- Pointer analysis
- Program standardization
Fingerprint
Dive into the research topics of 'Research on pointer analysis algorithm for program standardization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver