Skip to main content

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. (KAR id:30793)

PDF (Polyhedral Analysis Using Parametric Objectives. SAS 2012: 41-57) Author's Accepted Manuscript
Language: English
Download this file
(PDF/258kB)
[thumbnail of Polyhedral Analysis Using Parametric Objectives. SAS 2012: 41-57]
Preview
Request a format suitable for use with assistive technology e.g. a screenreader
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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Andy King
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 16 Nov 2021 10:08 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30793 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.