Polyhedral Analysis using Parametric Objectives

Howe, Jacob M. and King, Andy (2012) Polyhedral Analysis using Parametric Objectives. In: Min'e, Antoine and Schmidt, David A., eds. Static Analysis Symposium. Lecture Notes in Computer Science, 7460 . Springer, pp. 41-57. ISBN 978-3-642-33124-4. (Full text available)

PDF (Polyhedral Analysis Using Parametric Objectives. SAS 2012: 41-57) - Accepted Version
Download (233kB) Preview
[img]
Preview
Official URL
http://www.cs.kent.ac.uk/pubs/2012/3223

Abstract

The abstract domain of polyhedra lies at the heart of many program analysis techniques. However, its operations can be expensive, precluding their application to polyhedra that involve many variables. This paper describes a new approach to computing polyhedral domain operations. The core of this approach is an algorithm to calculate variable elimination (projection) based on parametric linear programming. The algorithm enumerates only non-redundant inequalities of the projection space, hence permits anytime approximation of the output.

Item Type: Book section
Additional information: ARCoSS subline
Uncontrolled keywords: abstract interpretation, linear constraints, projection
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 21 Sep 2012 09:49
Last Modified: 12 Dec 2013 12:18
Resource URI: http://kar.kent.ac.uk/id/eprint/30793 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year