Decomposition Slicing Based on Program Dependence Graph

スポンサーリンク

概要

• 論文の詳細を見る

• 1.Introduction Recently, Gallagher and Lyle presented a software maintenance process model that avoids regression testing because the model allows maintainers to change a specific part of a software without side effects21.Their approach is to decompose a program based on program slicing introduced by weiscr a technique that extracts a subset of statementsof a program which influences the values of sonic variables at aparticular program location. To have a slice independent of aparticular program point, Gallagher and Lyle also defined the decomposition slice as the union of: the slices at the outputstatements for a variable, and the slice at the last statementof a program referent to that variable. Then they decomposea program and select a component that groups all necessaryand sufficient statements for a safe program maintenance. However, we found that for sonic programs. their decomposition slicing does not capture all the computations on agiven variable since not all important values of a variable aredirectly outputted or reach the end of a program. The result can he a disagreeable maintenance. Then, to actually captureall the coniitations on a given variable, we define the decomposition slice as the union of the slices at the statements thatdefine a vahie to the variable of iliterest. This definition of decomposition slice also allows the useof the slicing algorithm based on program dependence graphproposed by Ottenstein aud Ottenstein that has a lincarslicing time.

• 一般社団法人情報処理学会の論文
• 1992-09-28

著者

• Ushijima Kazuo

  Kyushu University

• Cheng Jingde

  Saitama Univ. Saitama‐shi Jpn

• ICUMA Nelson

  Kyushu University

• CHENG Jingde

  Kyushu University

関連論文

• Decomposition Slicing Based on Program Dependence Graph

スポンサーリンク