Two variables per linear inequality as an abstract domain

  • Authors:

  • Axel Simon;Andy King;Jacob M. Howe

  • Affiliations:

  • Computing Laboratory, University of Kent, Canterbury, UK;Computing Laboratory, University of Kent, Canterbury, UK;Department of Computing, City University, London, UK

  • Venue:
  • LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper explores the spatial domain of sets of inequalities where each inequality contains at most two variables - a domain that is richer than intervals and more tractable than general polyhedra. We present a complete suite of efficient domain operations for linear systems with two variables per inequality with unrestricted coefficients. We exploit a tactic in which a system of inequalities with at most two variables per inequality is decomposed into a series of projections - one for each two dimensional plane. The decomposition enables all domain operations required for abstract interpretation to be expressed in terms of the two dimensional case. The resulting operations are efficient and include a novel planar convex hull algorithm. Empirical evidence suggests that widening can be applied effectively, ensuring tractability.