A common representation for building program slicing tools

Transcription

1 THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE XML A common representation for building program slicing tools Kouichi TOITA, Shinichiro YAMAMOTO, and Kiyoshi AGUSA Graduate School of Engineering, Nagoya University Furo-cho, Chikusa-ku, Nagoya-shi, Aichi, Japan Facaluty of Information Sience and Technology, Aichi Prefectural University , Ibaragabasama, Kumabari, Nagakute-cho, Aichi-gun, Aichi, , Japan toita@agusa.nuie.nagoya-u.ac.jp, yamamoto@ist.aichi-pu.ac.jp, agusa@nuie.nagoya-u.ac.jp Abstract We can extract some codes that affect the selected variable by using program slicing. Program slicing is useful for software development and maintenance, e.g. debugging, testing, reuse, program understanding, refactoring, and so on. Traditional slicing tools depend on target programming languages. We can slice the programs independently of programming languages, beacuse program slicing is an abstract operation on the graph defined by language semantics. In this research, we propose a common representation for program slicing which is independent of programming languages. This common representation abstract arithmetic, repeat, select statement and so on. We propose and implement a framework for program slicing using proposed representation. When we build a slicing tool using this framework, we need only a tool which translates source programs into proposed representation. We build a slicing tool and evaluate this framework. We show that the cost for building a certain level of slicing tools decreases without this framework. Key words program slicing, dependence analysis, XML 1

2 1. Weiser [1] High level Intermediate Representation Markup Language HIRML HIRML HIRML HIRML HIRML HIRML HIRML HIRML 2. HIRML HIRML HIRML 3. HIRML 4. C Java HIRML C C++ Java Fortran Pascal HIRML HIRML HIRML HIRML C C++ HIRML HIRML count = 0; sum = 0; for i = 1 to 100 do begin if (i mod 2 = 0) and (i mod 3 <> 0) then count = count + 1; sum = sum + i; end; 2. HIRML HIRML Fig. 1 count = 0; sum = 0; for (i = 1; i <= 100; i++) { if (i % 2 == 0 && i % 3!= 0) { count++; sum += i; 1 Pascal C Pascal and C programs which execute the same process. 2

3 typedef 2. 3 HIRML HIRML XML [2] XML XML XML XML sed grep Perl XML XSLT [3] DOM [4] XML HIRML HIRML 2 HIRML XML forstmt for forstmt body step 4 body step HIRML type for (i = 0; i < 10; i++) { a += i; <forstmt id="c " offset="34" length="41" line="4" > <!-- for --> <expstmt id="c " offset="39" length="5" line="4" > <assign id="c " offset="39" length="5" line="4" > <const id="c " value="0" type="int" /> </assign> </expstmt> <!-- for --> <cmplt id="c " offset="46" length="6" line="4" > <const id="c " value="10" type="int" /> </cmplt> <!-- for body --> <blockstmt id="c " offset="59" length="16" line="4" > <expstmt id="c " offset="64" length="6" line="5" > <addassign id="c " offset="64" length="6" line="5" > <var id="c " name="a" type="int" pointer="0" /> </addassign> </expstmt> </blockstmt> <!-- for step --> <expstmt id="c " offset="54" length="3" line="4" > <postincr id="c " offset="54" length="3" line="4" > </postincr> </expstmt> </forstmt> Fig. 3 long int a; FILE *fp; <vardef id="c " name="a" type="long int" pointer="0" /> <vardef id="c " name="fp" type="file" pointer="1" /> 3 HIRML Variable declarations and corresponding HIRML. const volatile long short signed unsigned auto register public private HIRML type NMTOKENS NMTOKENS const long pointer <pointer> 4 typedef 4 HIRML struct name HIRML elemdef typedef typedef deftype name HIRML HIRML 1. HIRML 2. typedef struct _List { int data; struct _List *next; List; <struct id="c " name="_list" > <elemdef id="c " name="data" type="int" pointer="0" /> <elemdef id="c " name="next" type="struct _List" pointer="1" /> </struct> <typedef id="c " name="list" deftype="struct _List" pointer="0" /> Fig. 2 2 for HIRML A simple For statement and corresponding HIRML. Fig. 4 4 HIRML A declaration of List and corresponding HIRML. 3

4 3. HIRML HIRML HIRML slicing tool HIRML Coins HIR HIRML DGML X 5 3. HIRML 5 HIRML 3. 1 HIRML HIRML 6 HIRML Coins COmpiler INfraStructure [5] HIRML 1. HIRML HIRML Coins High level Intermediate Representation HIR 2. HIR 3. Coins Dependence Graph *.x x2hirml (HIRML) HIRML HIRML slicing tool *.x Program Slicing Framework X Slicing Tool (, ) 5 X Fig. 5 A slicing of Language X. 6 HIRML Fig. 6 An HIRML slicing tool. Markup Language DGML 4. HIRML DGML 3. 2 Coins Coins Java Coins High level Intermediate Representation HIR Low level Intermediate Representation LIR HIR HIR HIR LIR LIR Coins C SPARC Fortran Java X86 Coins HIR LIR 3. 3 HIRML Coins HIR HIRML HIRML HIR HIRML 7 HIR 7 8 HIRML 7 5 HIRML 8 HIRML

5 Fig. 7 a++; a += b; c = a > b? a b; Fig. 8 7 C, C++, Java Representations in C, C++ and Java. a = a + 1; a = a + b; if (a > b) { c = a; else { c = b; 8 Representations after translation DEF(b) b p p x b p p p KILL(b) b b p p x b p p REACH(b) p x p b path p p DEF(b) b b KILL(b) b REACH(b) = P pred(b) {DEF(P ) {REACH(P ) KILL(P ) s t s t s t HIR p p p 2 HIR s t s t REACH(b) b p b b USE(p) p DEFINE(p) p 1. p b DEFINE(p) USE(p) 2. p REACH(b) DEFINE(p) 3. p b 3.1 x USE(p) p s x x s x REACH(b) x XML XML DGML Dependence Graph Markup Language DGML program subp block predblock succblock stmt defvar usevar 9 predblock no succblock no 10 stmt cdstmtid id usevar ddstmtid id

6 block9 block8 iw == 0 iw = 1; nw = nw + 1; block11 <block no="9"> <predblock no="8"/> <succblock no="11"/> 9 DGML Fig. 9 The representation of predecessor block and successor block in DGML. block1 block8 iw == 0 block9 iw = 0; nl = 0; nw = 0; nc = 0; c = fgetc(stdin); iw = 1; nw = nw + 1; <block no="1"> <stmt id="c "> <defvar id="c " name="nw"/> <block no="8"> <stmt cdstmtid="c c " id="c "> <usevar ddstmtid="c c c " id="c " name="iw"/> <block no="9"> <stmt cdstmtid="c " id="c "> <defvar id="c " name="iw"/> <stmt cdstmtid="c " id="c "> <defvar id="c " name="nw"/> <usevar ddstmtid="c " id="c " name="nw"/> 10 DGML Fig. 10 The representation of control dependence and data dependence in DGML. HIRML DGML n v 6 1. n s f HIRML 2. s f f b DGML 3. s f v s S c 4. S c s 4.1 s u s d S c S o 4.2 s s c S c S o 4.3 s S c 5. f S S S o S r 6. S r HIRML offset length HIRML HIRML HIRML HIRML 4. 2 C HIRML C HIRML c2hirml2. 2 CASE Sapid Sophisticated APIs for CASE tooldevelopment [6] Sapid C Software DataBase SDB SDB Access Routine AR c2hirml C SDB AR HIRML c2hirml C C [7] Wisconsin Program-Slicing Tool [8] [9] Unravel [10] Unravel Unravel Unravel lex yacc C c2hirml STEP-C Slicing TEst Program for C STEP-C C if, switch, for, while, dowhile Coins 6

7 if, switch, for, while, do-while 4. 3 Java HIRML Java HIRML j2hirml CASE Japid [11] Japid Java Sapid SDB Sapid AR SDB j2hirml Java SDB HIRML j2hirml Java 1500 HIRML Java 1. try catch Java j2hirml HIRML HIRML HIRML HIRML C Java HIRML C HIRML Java HIRML C Coins Java Java Coins C Coins Java Java JavaScript JSP Web HIRML Coins [1] Weiser, M. Program Slicing, IEEE Transactions on Software Engineering, Vol.10, No.4, pp , 1984 [2] World Wide Web Consortium (W3C) Extensible Markup Language (XML) 1.0 (Second Edition), http// [3] WWW Consortium (W3C) XSL Transformations (XSLT) Version 1.0, http// [4] WWW Consortium (W3C) Document Object Model, http// [5] Coins, http// [6],, CASE Sapid,, Vol.39, No.6, pp , 1998 [7] S.Horwitz and T.Reps The use of program dependence graphs in software engineering, Proc.14th International Conference on Software Engineering, pp , Melbourne, Australia, 1992 [8] The Wisconsin Program-Slicing Tool, http// tool/ [9] J. R. Lyle and D. R. Wallace Using the unravel program slicing tool to evaluate high integrity software, In Proceedings of 10th International Software Quality Week, USA, May 1997 [10] The Unravel Program Slicing Tool, http//hissa.nist.gov/unravel/ [11] Y. Hachisu, S. Yamamoto and K. Agusa A CASE Tool Platform for Object Oriented Language, IEICE Trans. on Information and Systems, Vol.E82-D, No.5, pp , 1999 [12] 1995 [13]