arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.4399cs.SE
收藏

一种有效的并发程序跟踪简化二进制技术

An Efficient Binary Technique for Trace Simplifications of Concurrent Programs

Mohamed A. El-Zawawy, Mohammad N. Alanazi

摘要:

并发程序的执行意味着在不同的线程上下文之间频繁切换。这一性质给并发程序的分析和推理带来了困难。跟踪简化是一种旨在通过将并发程序跟踪(执行)转换为语义等价的跟踪来缓解这一问题的技术。结果跟踪通常包括比原始跟踪中更少的上下文切换。本文提出了一种新的静态轨迹简化方法。这种方法是基于一个连接分析,计算每个跟踪点的连接和上下文切换信息。本文还提出了一种新的并发程序的操作语义。语义被用来证明所提出的技术的正确性和效率的连通性分析和轨迹简化。测试所提出的技术的实验结果处理的问题,以前的工作轨迹简化的文件中也示出。实验结果证明了该方法的有效性。

英文摘要:

Execution of concurrent programs implies frequent switching between different thread contexts. This property perplexes analyzing and reasoning about concurrent programs. Trace simplification is a technique that aims at alleviating this problem via transforming a concurrent program trace (execution) into a semantically equivalent one. The resulted trace typically includes less number of context switches than that in the original trace. This paper presents a new static approach for trace simplification. This approach is based on a connectivity analysis that calculates for each trace-point connectivity and context-switching information. The paper also presents a novel operational semantics for concurrent programs. The semantics is used to prove the correctness and efficiency of the proposed techniques for connectivity analysis and trace simplification. The results of experiments testing the proposed technique on problems treated by previous work for trace simplification are also shown in the paper. The results prove the efficiency and effectiveness of the proposed method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑