2003•Unpublished venueRequires access

Control-Flow-Based Static Slicing Algorithm of Threaded Programs

Jin Cheng-zhi

Abstract

The present paper deals with a new static slicing algorithm of threaded program based on the program's control-flow information. The main idea of the algorithm is to retain the control-flow information while the threaded program dependency graph is constructed, with which the threaded realized paths can be identified, by doing this we can improve the slice's precision and slicing's efficiency. An example program and its slice are provided in the end.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 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

Key concepts: Program slicing, Slicing, Control flow, Computer science, Control flow graph, Control flow analysis, Algorithm, Dependency graph