Slicing Java Generic Programs Using Generic System Dependence Graph  

作　　者：CHEN Lin1,2,XU Baowen1,2 1.State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210093,Jiangsu China 2.Department of Computer Science and Technology,Nanjing University,Nanjing 210093,Jiangsu China 

出　　处：《Wuhan University Journal of Natural Sciences》2009年第4期304-308,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by and the National High Technology Research and Development Program of China (863 Program) (2009AA01Z147);the National Natural Science Foundation of China (90818027, 60633010)

摘　　要：The existing slicing algorithms do not consider parameterized types in generic programs, so they are not suitable for generic programs. To solve this problem, this paper presents a generic system dependence graph for Java generic programs based on the traditional system dependence graph to express dependences for parameterized type information. A novel slicing criterion and slicing algorithm for generic programs is proposed. The slices computed by the algorithm can help to understand relations between concepts and types for generic programs and can express the features of generic programs better.The existing slicing algorithms do not consider parameterized types in generic programs, so they are not suitable for generic programs. To solve this problem, this paper presents a generic system dependence graph for Java generic programs based on the traditional system dependence graph to express dependences for parameterized type information. A novel slicing criterion and slicing algorithm for generic programs is proposed. The slices computed by the algorithm can help to understand relations between concepts and types for generic programs and can express the features of generic programs better.

关 键 词：SLICING system dependence graph GENERICS program analysis 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论] TP368.1[自动化与计算机技术—计算机科学与技术]