Journal of Software:2001.12(2):204-211

(南京大学 计算机软件新技术国家重点实验室,江苏 南京 210093 中国科学技术大学 计算机科学技术系,安徽 合肥 230027)
An Approach of Static Coarse-Grained Slice Based on Simplified System Dependence Graph
LI Bi-xin,WANG Yun-feng,ZHANG Yong-xiang,ZHENG Guo-liang
Chart / table
Similar Articles
Article :Browse 3346   Download 3151
Received:April 21, 1999    Revised:April 21, 1999
> 中文摘要: 基于系统依赖图是计算面向对象程序切片的一个有效方法.但是,系统依赖图的缺点是太复杂,而且在建立系统依赖图的过程中容易出错,一旦出现错误就可能导致切片结果的不准确.通过对系统依赖图进行简化,得到了简化的系统依赖图.它省略了那些表示输入参数和输出参数的结点和概括边.同时,还定义了一种面向对象程序的粗粒度切片概念,讨论了它的性质,分析了它与细粒度切片的关系,并基于简化的系统依赖图计算面向对象程序的粗粒度切片.最后还讨论了切片技术的简单实现.
Abstract:It is an efficient way to use SDG (system dependence graph) in slicing object-oriented program. But SDG is too complicated, so it may produce mistakes during constructing SDG, which will lead to inaccurate result. In this paper, the SSDG (simplified system dependence graph) is presented, which ignores nodes and edges representing parameter-in or parameter-out and summary edges. Meanwhile, the concept of coarse-grained slice for object-oriented program is defined, its properties are discussed, the relationships between coarse-grained slice and fine-grained slice are analyzed, the object-oriented coarse-grained program slice is computed based on simplified system dependence graph, and the implementation is also discussed.
文章编号:     中图分类号:    文献标志码:
基金项目:国家863青年基金资助项目(863-306QN2000-2);江苏省自然科学基金资助项目(BK99038) 国家863青年基金资助项目(863-306QN2000-2);江苏省自然科学基金资助项目(BK99038)
Foundation items:
Reference text:


LI Bi-xin,WANG Yun-feng,ZHANG Yong-xiang,ZHENG Guo-liang.An Approach of Static Coarse-Grained Slice Based on Simplified System Dependence Graph.Journal of Software,2001,12(2):204-211