Abstract

This paper presents task synchronization reachability graph(TSRG) for analyzing concurrent Ada programs. Based on TSRG, we can precisely determine synchronization activities in programs and construct a new type of program dependence graph, TSRG-based Program Dependence Graph(RPDG), which is more precise than previous program dependence graphs and solves the intransitivity problem of dependence relation in concurrent programs in some extent. Various applications of RPDG including program understanding, debugging, maintenance, optimization, measurement are discussed.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call