Abstract acceleration in linear relation analysis

作者：Gonnord Laure^*; Schrammel Peter

来源：Science of Computer Programming, 2014, 93: 125-153.

DOI：10.1016/j.scico.2013.09.016

• Program analysis
• Abstract interpretation
• Linear relation analysis
• Polyhedra
• Acceleration

Linear relation analysis is a classical abstract interpretation based on an over-approximation of reachable numerical states of a program by convex polyhedra. Since it works with a lattice of infinite height, it makes use of a widening operator to enforce the convergence of fixed point computations. Abstract acceleration is a method that computes the precise abstract effect of loops wherever possible and uses widening in the general case. Thus, it improves both the precision and the efficiency of the analysis. This article gives a comprehensive tutorial on abstract acceleration: its origins in Presburger-based acceleration including new insights w.r.t. the linear accelerability of linear transformations, methods for simple and nested loops, recent extensions, tools and applications, and a detailed discussion of related methods and future perspectives.

• 出版日期2014-11-1