Two Variables per Linear Inequality as an Abstract Domain

Simon, A. and King, Andy and Howe, J.M. (2002) Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, M., ed. Logic Based Program Synthesis and Transformation. Lecture Notes in Computer Science, 2664 . Springer-Verlag, Berlin, pp. 71-89. ISBN 978-3-540-40438-5. (Full text available)

PDF
Download (376kB)
[img]
Preview
Official URL
http://dx.doi.org/10.1007/3-540-45013-0_7

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.

Item Type: Book section
Additional information: see http://www.springer.de./comp/lncs/index.html
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Andy King
Date Deposited: 24 Nov 2008 17:59
Last Modified: 13 Dec 2013 12:48
Resource URI: http://kar.kent.ac.uk/id/eprint/13681 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year