A general abstract representation for the study of concurrent programs
Sudharsan R. Iyengar, Narayan Chandra Debnath · 1993
In this paper we propose an abstract representation, called Synchronized Generalized Program Graph (SGPG), for concurrent programs. SGPG incorporates the data dependencies, control flow, control dependencies, communication, and synchronization primitives of the concurrent program it represents. The features of SGPG and the process of its construction are outlined. Algorithms for generating the SGPG representation of an imperative concurrent programs are discussed in detail. The producer consumer problem is used as an illustrative example. SGPG can be used for the study and analysis of concurrent programs, research involving the implementation, testing, measurement of cognitive complexity, and for proving correctness of concurrent programs.