• DocumentCode
    534239
  • Title

    Program Slicing

  • Author

    Duanzhi, Chen

  • Author_Institution
    Sch. of Comput., Wuhan Univ., Wuhan, China
  • Volume
    1
  • fYear
    2010
  • fDate
    16-18 July 2010
  • Firstpage
    15
  • Lastpage
    18
  • Abstract
    Program slicing provides a new way to software maintenance, program understanding. It can give the programmer the statements only relevant to the computation of a given function. It can transform a large program into a smaller one. A program slicing respected with a point of interest is not only relevant on the variables which are defined or used by the interesting point, but also relevant on the statements and predicates which are effected by these variables and which are effecting these variables too. In this paper, we elaborate on the program slicing technology research and progress. We introduce several different sorts of program slicing, slicing criterion and slicing algorithm. The algorithm based on data flaw equations and the one base dependence graph are discussed. The difference between the intra-procedure slicing and the inter-procedure slicing is described.
  • Keywords
    data flow graphs; program slicing; software fault tolerance; software maintenance; base dependence graph; data flaw equation; interprocedure slicing; intraprocedure slicing; program slicing; program understanding; software maintenance; Computer languages; Debugging; Equations; Mathematical model; Programming; Software; Software engineering; Data Flaw Equations; Program Dependence Graph; Program slicing; System Dependence Graph;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology and Applications (IFITA), 2010 International Forum on
  • Conference_Location
    Kunming
  • Print_ISBN
    978-1-4244-7621-3
  • Electronic_ISBN
    978-1-4244-7622-0
  • Type

    conf

  • DOI
    10.1109/IFITA.2010.58
  • Filename
    5635031