Task Interaction Graph: An Intermediate Representation for Concurrency

Authors:
Douglas L. Long;Lori A. Clarke
Affiliations:
-;-
Venue:
Task Interaction Graph: An Intermediate Representation for Concurrency
Year:
1988

Citing 0
Cited 2

Task interaction graphs for concurrency analysis

ICSE '89 Proceedings of the 11th international conference on Software engineering
Concurrency analysis in the presence of procedures using a data-flow framework

TAV4 Proceedings of the symposium on Testing, analysis, and verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

A REPRESENTATION FOR CONCURRENT PROGRAMS, CALLED `TASK INTERACTION GRAPHS'', IS PRESENTED. TASK INTERACTION GRAPHS DIVIDE A PROGRAM INTO MAXIMAL SEQUENTIAL REGIONS, WHICH ARE CONNECTED BY EDGES REPRESENTING TASK INTERACTIONS. THE CONSTRUCTION OF TASK INTERACTION GRAPHS FOR A NUMBER OF COMMON PROGRAMMING LANGUAGE FEATURES, INCLUDING TASKS AND PROCEDURES, IS DESCRIBED AND TECHNIQUES FOR HANDLING SHARED VARIABLES ARE CONSIDERED. FORMAL DESCRIPTIONS OF THE GRAPHS FOR EACH OF THESE FEATURES IS PRESENTED ALONG WITH SEVERAL EXAMPLES. BOTH TASK INTERACTION GRAPHS AND THEIR CORRESPONDING CONCURRENCY GRAPHS FACILITATE ANALYSIS OF CONCURRENT PROGRAMS. SOME ANALYSES AND OPTIMIZATIONS ON THESE REPRESENTA- TIONS ARE ALSO DESCRIBED.