抽象环境修剪
Abstract Environment Trimming
AI总结:
本文提出受编译器优化启发的变量修剪等技术,在不影响精度的前提下提升逻辑程序共享分析效率,实验显示显著加速且超时模块减半。
摘要:
变量共享是逻辑程序静态分析中的一个基本属性,因为它在推断许多有用的程序属性时,对于确保正确性和提高精度至关重要。这些属性包括模式、确定性、非失败性、成本等。这促使了大量关于开发抽象域以提高共享分析精度和性能的重要工作。这些工作大多围绕集合共享域家族展开,因为它们提供了高精度。然而,这也有代价:它们对广泛现实程序的可扩展性仍然具有挑战性,这阻碍了它们的更广泛采用。在这项工作中,我们不是定义新的共享抽象域,而是专注于开发可纳入分析器的技术,以解决已知影响这些域效率的方面,如变量数量,而不影响精度。这些技术受到编译器优化领域其他技术的启发,如表达式重新关联和变量修剪。我们提出了几种这样的技术,并提供了对来自生产代码和经典基准的超过1100个程序模块的广泛实验评估。这包括Spectector缓存分析器、s(CASP)系统、Ciao系统的库、LPdoc文档器、PLAI分析器本身等。实验结果相当令人鼓舞:我们获得了显著的加速,更重要的是,需要超时的模块数量减少了一半。因此,许多更多的程序可以在合理的时间内被精确分析。
英文摘要:
Variable sharing is a fundamental property in the static analysis of logic programs, since it is instrumental for ensuring correctness and increasing precision while inferring many useful program properties. Such properties include modes, determinacy, non-failure, cost, etc. This has motivated significant work on developing abstract domains to improve the precision and performance of sharing analyses. Much of this work has centered around the family of set-sharing domains, because of the high precision they offer. However, this comes at a price: their scalability to a wide set of realistic programs remains challenging and this hinders their wider adoption. In this work, rather than defining new sharing abstract domains, we focus instead on developing techniques which can be incorporated in the analyzers to address aspects that are known to affect the efficiency of these domains, such as the number of variables, without affecting precision. These techniques are inspired in others used in the context of compiler optimizations, such as expression reassociation and variable trimming. We present several such techniques and provide an extensive experimental evaluation of over 1100 program modules taken from both production code and classical benchmarks. This includes the Spectector cache analyzer, the s(CASP) system, the libraries of the Ciao system, the LPdoc documenter, the PLAI analyzer itself, etc. The experimental results are quite encouraging: we have obtained significant speed-ups, and, more importantly, the number of modules that require a timeout was cut in half. As a result, many more programs can be analyzed precisely in reasonable times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。