A general abstract representation for the study of concurrent programs

Authors:
Sudharsan R. Iyengar;Narayan C. Debnath
Affiliations:
Department of Computer Science, Winona State University, Winona, MN;Department of Computer Science, Winona State University, Winona, MN
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 8
Cited 0

Communicating sequential processes

Communicating sequential processes
Concurrent programming

Concurrent programming
A general-purpose algorithm for analyzing concurrent programs

Communications of the ACM
A new abstraction for the study of module interconnection

CSC '91 Proceedings of the 19th annual conference on Computer Science
Guardians and Actions: Linguistic Support for Robust, Distributed Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Measuring software data dependency complexity

Measuring software data dependency complexity
*MOD A Language for Distributed Programming

IEEE Transactions on Software Engineering
Data Flow Languages

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.