Presentation 1993/9/21
Program Slicing using a path dependence flow graph
Kuniaki Naoi, Naohisa Takahashi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper presents a unified framework for detecting various kinds of program slices.Here,the path dependence flow graph(PDFG) presented earlier is interpreted in parallel based on a generalized dataflow computing model.This paper defines eight kinds of slices as combinations of three binary-value attributes, and three execution rules corresponding to these attributes.All slice calculations can be attained by executing PDFG nodes with execution rules corresponding to slice attributes.This is because the data,path and control dependencies of a program are represented as arcs in PDFG.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) program analysis / dataflow computation model / dependence graph / imperative program / parallel execution / program slice
Paper # SS93-25
Date of Issue

Conference Information
Committee SS
Conference Date 1993/9/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Software Science (SS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Program Slicing using a path dependence flow graph
Sub Title (in English)
Keyword(1) program analysis
Keyword(2) dataflow computation model
Keyword(3) dependence graph
Keyword(4) imperative program
Keyword(5) parallel execution
Keyword(6) program slice
1st Author's Name Kuniaki Naoi
1st Author's Affiliation NTT Software Laboratories()
2nd Author's Name Naohisa Takahashi
2nd Author's Affiliation NTT Software Laboratories
Date 1993/9/21
Paper # SS93-25
Volume (vol) vol.93
Number (no) 244
Page pp.pp.-
#Pages 8
Date of Issue