Affiliation:
1. Universitat Passau, Passau, Germany
Abstract
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent programs. This work presents the first context-sensitive approach to slice concurrent programs accurately. It extends the well known structures of the control flow graph and the (interprocedural) program dependence graph for concurrent programs with interference. This new technique does not require serialization or inlining.
Publisher
Association for Computing Machinery (ACM)
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Slicing Shared-Memory Concurrent Programs The Threaded System Dependence Graph Revisited;2023 IEEE International Conference on Software Maintenance and Evolution (ICSME);2023-10-01
2. On Time-sensitive Control Dependencies;ACM Transactions on Programming Languages and Systems;2022-03-31
3. An efficient and precise dynamic slicing for concurrent component-oriented programs;International Journal of Knowledge-based and Intelligent Engineering Systems;2022-02-18
4. S
EADS;ACM Transactions on Software Engineering and Methodology;2021-01-31
5. D2ABS: A Framework for Dynamic Dependence Analysis of Distributed Programs;IEEE Transactions on Software Engineering;2021