期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A New Approach to Pointer Analysis for Assignments 认领 引用
1
作者 黄波 藏斌宇 +1 位作者 李靖 朱传琪 《Journal of Computer Science & Technology》 SCIE EI 2001年第3期242-250,共9页
Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, ... Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are classified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data. 展开更多
关键词 pointer analysis pointer assignment point-to information recursive data structure
暂未订购 下载PDF
Dependence Analysis for C Programs with Combinability of Dataflow Facts under Consideration 认领 引用
2
作者 QIAN Ju XU Baowen +2 位作者 ZHOU Xiaoyu CHEN Lin SHI Liang 《Wuhan University Journal of Natural Sciences》 CAS 2009年第4期321-326,共6页
To avoid the precision loss caused by combining data- flow facts impossible to occur in the same execution path in dependence analysis for C programs, this paper first proposes a flow-sensitive and context-insensitive... To avoid the precision loss caused by combining data- flow facts impossible to occur in the same execution path in dependence analysis for C programs, this paper first proposes a flow-sensitive and context-insensitive points-to analysis algorithm and then presents a new dependence analysis approach based on it. The approach makes more sufficient consideration on the executa- ble path problem and can avoid invalid combination between points-to relations and between points-to relations and reaching definitions. The results of which are therefore more precise than those of the ordinary dependence analysis approaches. 展开更多
关键词 pointer analysis dependence analysis executable path
暂未订购 下载PDF
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈