| A Termination Condition of Unfolding Loop for Generalized Partial Computation |
| |
| 引用本文： | ZHAO Dong fan,FU Yan ning (Department of Computer Science and Technology,Jilin University,Changchun 130012,P.R. China). A Termination Condition of Unfolding Loop for Generalized Partial Computation[J]. 中国邮电高校学报(英文版), 2001, 8(2) |
| |
| 作者姓名： | ZHAO Dong fan FU Yan ning (Department of Computer Science and Technology Jilin University Changchun 130012 P.R. China) |
| |
| 作者单位： | Department of Computer Science and Technology，Jilin University，Changchun 130012，P.R. China |
| |
| 摘 要： | 1 ＩｎｔｒｏｄｕｃｔｉｏｎＧＰＣ[1 ,2 ]ｉｓａｐｒｏｇｒａｍｏｐｔｉｍｉｚａｔｉｏｎｐｒｉｎｃｉｐｌｅａｎｄｔｈｅｏｒｅｍｐｒｏｖｉｎｇ .Ｃｏｎｖｅｎｔｉｏｎａｌｐａｒｔｉａｌｃｏｍｐｕｔａ ｔｉｏｎｍｅｔｈｏｄｓｅｘｐｌｉｃｉｔｌｙｍａｋｅｕｓｅｏｆｏｎｌｙｇｉｖｅｎｐａ ｒａｍｅｔｅｒｖａｌｕｅｓｔｏｐａｒｔｉａｌｌｙｅｖａｌｕａｔｅｄ ｐｒｏｇｒａｍｓ.Ｈｏｗｅｖｅｒ,ＧＰＣｅｘｐｌｉｃｉｔｌｙｕｔｉｌｉｚｅｓｎｏｔｏｎｌｙｇｉｖｅｎｖａｌ ｕｅｓｂｕｔａｌｓｏｔｈｅｆｏｌｌｏｗｉｎｇｉｎｆｏｒ…
|
A Termination Condition of Unfolding Loop for Generalized Partial Computation |
| |
| ZHAO Dong-fan,FU Yan-ning. A Termination Condition of Unfolding Loop for Generalized Partial Computation[J]. The Journal of China Universities of Posts and Telecommunications, 2001, 8(2) |
| |
| Authors: | ZHAO Dong-fan FU Yan-ning |
| |
| Abstract: | The unfolding problem of loop has always been a difficult problem on the partial computation and Generalized Partial Computation( GPC ) of imperative language. This paper makes use of Data Flow Analysis( DFA ) technique to present an efficient termination condition of unfolding loop for partial evaluation or generalized partial evaluation, and this termination condition can solve the problem very well. |
| |
| Keywords: | program analysis DFA program optimization partial computation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
