2008Unpublished venueRequires access

Scenario oriented program slicing

Ju Qian, Baowen Xu

Open publisher page 6 citations

Abstract

Slicing is an important decomposition technique for program understanding. However, traditional slicing methods tend to produce too large slices for human inspection as modern programs are often huge and static program analyses are hard to be precise enough. One possible solution to such problem could be combining other program decomposition techniques together with program slicing. With such inspiration, this paper proposes a scenario oriented program slicing method to slice programs under specified execution scenarios. The scenarios provide a clear and easy understanding functional decomposition for the system, while the new slicing method can help figure out how a computation is implemented in a given scenario by effectively reducing the amount of code that a user needs to inspect.

About this research paper

What this paper is about

Slicing is an important decomposition technique for program understanding. However, traditional slicing methods tend to produce too large slices for human inspection as modern programs are often huge and static program analyses are hard to be precise enough. One possible solution to such problem could be combining other program decomposition techniques together with program slicing. With such inspiration, this paper proposes a scenario oriented program slicing method to slice programs under specified execution scenarios. The scenarios provide a clear and easy understanding functional decomposition for the system, while the new slicing method can help figure out how a computation is implemented in a given scenario by effectively reducing the amount of code that a user needs to inspect.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Slicing is an important decomposition technique for program understanding. However, traditional slicing methods tend to produce too large slices for human inspection as modern programs are often huge and static program analyses are hard to be precise enough. One possible solution to such problem could be combining other program decomposition techniques together with program slicing. With such inspiration, this paper proposes a scenario oriented program slicing method to slice programs under specified execution scenarios. The scenarios provide a clear and easy understanding functional decomposition for the system, while the new slicing method can help figure out how a computation is implemented in a given scenario by effectively reducing the amount of code that a user needs to inspect.

Key concepts: Program slicing, Slicing, Computer science, Decomposition, Program analysis, Programming language, Static analysis, Code (set theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
Scenario oriented program slicing — Research Paper | ScholarLens