Abstract

Debugging complex concurrent programs is a very difficult problem. Slicing techniques can simplify debugging and understanding these programs. However, slicing of concurrent program is compute-intensive asthe required intermediate graph often becomes large. In this context, we generalize the structure of the intermediate graph representation of concurrent programs and this leads us to introduce the notion of Concurrent Control Flow Graph (CCFG). We introduce a parallel algorithm to compute static slices of concurrent programs using CCFG.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.