会议专题

Dynamic Slicing Concurrent Java Programs Using Variable Cache Table

This paper presents a new method to slice concurrent Java programs. We introduce multithreaded dependence graph (MtDG) as the intermediate program representation. Our method applies variable cache table (VCT) to analyze the dependencies in programs and then to construct MtDG of the given program, but does not use any trace file to store the execution history. Based on this model, we use the two-pass slicing algorithm to compute accurate dynamic slices of concurrent Java programs.

dynamic slicing concurrent program multithreaded dependence graph, variable cache table

HE Zhixue ZHANG Guangquan RONG Mei

School of Computer Science and Technology Soochow University Suzhou, 215006, China Shenzhen Tourism College Jinan University Shenzhen, 518053, China

国际会议

第二届国际计算机新科技与教育学术会议(Proceedings of the Second International Conference on Computer Science & Education ICCSE2007)

武汉

英文

363-369

2007-07-25(万方平台首次上网日期,不代表论文的发表时间)