2009•Microelectronics & ComputerRequires access

Dependence Marking Dynamic Slicing Algorithm for Concurrent Programs

Tang Xiao-chun

Abstract

The technique uses a Concurrent Object-oriented Program Dependence Graph (COOPDG) as the intermediate program representation,then mark and unmark the edges in the COOPDG appropriately as and when the dependencies arise and cease during run-time.The approach can reduce the updated time of the COOPDG during run-time,and reduce the response time of obtaining the slice.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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: Computer science, Program slicing, Slicing, Representation (politics), Algorithm, Graph, Execution time, Parallel computing