arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.10233cs.PLcs.SE
收藏

基于无限抽象域的异步系统数据流分析

Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains

Snigdha Athaiya, Raghavan Komondoor, K Narayan Kumar

摘要:

异步消息传递系统经常用于实现分布式机制、协议和进程。本文针对这类系统的精确数据流分析问题。为了获得良好的精度,数据流分析需要以某种方式跳过读取的消息多于路径中迄今为止发送的消息数量的执行路径,因为这样的路径在运行时间是不可行的。现有的数据流分析技术确实省略了这样的不可行路径的子集,但它们具有仅允许有限的抽象分析域的限制。在本文中,我们提出了这些方法的推广,承认无限的抽象分析域,因为这些域通常用于在实践中获得高精度。我们已经实现了我们的方法,并分析了其性能的一组14个基准。在这些基准测试中,我们的工具获得了显着更高的精度相比,基线的方法,不省略任何不可行的路径和另一个基线,省略不可行的路径,但只承认有限的抽象域。

英文摘要:

Asynchronous message-passing systems are employed frequently to implement distributed mechanisms, protocols, and processes. This paper addresses the problem of precise data flow analysis for such systems. To obtain good precision, data flow analysis needs to somehow skip execution paths that read more messages than the number of messages sent so far in the path, as such paths are infeasible at run time. Existing data flow analysis techniques do elide a subset of such infeasible paths, but have the restriction that they admit only finite abstract analysis domains. In this paper we propose a generalization of these approaches to admit infinite abstract analysis domains, as such domains are commonly used in practice to obtain high precision. We have implemented our approach, and have analyzed its performance on a set of 14 benchmarks. On these benchmarks our tool obtains significantly higher precision compared to a baseline approach that does not elide any infeasible paths and to another baseline that elides infeasible paths but admits only finite abstract domains.

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

↑