Abstract interpretation meets convex optimization

  • Authors:

  • Thomas Martin Gawlitza;Helmut Seidl;Assalé Adjé;Stéphane Gaubert;Éric Goubault

  • Affiliations:

  • VERIMAG, Grenoble, France and School of Information Technologies, The University of Sydney, Sydney, Australia;Technische Universität München, München, Germany;CEA, LIST and LIX, Ecole Polytechnique (MeASI), France;INRIA Saclay and CMAP, Ecole Polytechnique, F-91128 Palaiseau Cedex, France;CEA, LIST (MeASI), F-91191 Gif-sur-Yvette Cedex, France

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Numerical static program analyses by abstract interpretation, e.g., the problem of inferring bounds for the values of numerical program variables, are faced with the problem that the abstract domains often contain infinite ascending chains. In order to enforce termination within the abstract interpretation framework, a widening/narrowing approach can be applied that trades the guarantee of termination against a potential loss of precision. Alternatively, recently strategy improvement algorithms have been proposed for computing numerical invariants which do not suffer the imprecision incurred by widenings. Before, strategy improvement algorithms have successfully been applied for solving two-players zero-sum games. In this article we discuss and compare max-strategy and min-strategy improvement algorithms for static program analysis. For that, the algorithms are cast within a common general framework of solving systems of fixpoint equations x-=e where the right-hand sides e are maxima of finitely many monotone and concave functions. Then we indicate how the general setting can be instantiated for inferring numerical invariants of programs based on non-linear templates.