Verifying General Safety Properties of Ada Tasking Programs
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
A REPRESENTATION FOR CONCURRENT PROGRAMS, CALLED `TASK INTERACTION GRAPHS'', IS PRESENTED. TASK INTERACTION GRAPHS DIVIDE A PROGRAM INTO MAXIMAL SEQUENTIAL REGIONS CONNECTED BY EDGES REPRESENTING TASK INTER- ACTIONS. THIS REPRESENTATION IS ILLUSTRATED AND IT IS SHOWN HOW IT CAN BE USED TO CREATE CONCURRENCY GRAPH REPRESENTATIONS THAT ARE MUCH SMALLER THAN THOSE CREATED FROM CONTROL FLOW GRAPH REPRESENTATIONS. BOTH TASK INTERACTION GRAPHS AND THEIR CORRESPONDING CONCURRENCY GRAPHS FACILITATE ANALYSIS OF CONCURRENT PROGRAMS. SOME ANALYSES AND OPTIMIZATIONS ON THESE REPRESENTATIONS ARE ALSO DESCRIBED.