An Approach of Coarse-Grained Slice for Concurrent Programs

Slicing for concurrent programs is an important approach to analyze and understand programs, which has been widely used in debugging, testing and maintaining concurrent softwares. This paper discusses communication Petri nets for concurrent Ada tasks, on the basis of which the relation of control dependency caused by task communications is analyzed. Then a concept of coarse-grained slice and its algorithm are presented, which provides an efficient method for understanding large-scale Ada concurrent programs in a higher abstract level.