Martin, Jon and King, Andy (1997) Inferring Numeric Relationships for Logic Program Transformation. In: Pre-conference proceedings of Logic Program Synthesis and Transformation.
Numeric relationships between program variables can be inferred with affine, interval or polyhedral abstractions but few, if any, analyses have addressed the problem of charactering the relationships that occur in and between recursive data structures. Such relationships are important, for example, in program transformation. This paper contributes an analysis which is precise enough to capture numeric relationships that occur deep within Herbrand terms. The analysis abstracts sets of numerical values by symbolic intervals and derives relationships among these intervals using linear inequality and minima constraints.
|Item Type:||Conference or workshop item (UNSPECIFIED)|
|Uncontrolled keywords:||abstract interpretation, logic programming, transformation|
|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:||Mark Wheadon|
|Date Deposited:||30 Jul 2009 17:38|
|Last Modified:||06 Sep 2011 03:55|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21480 (The current URI for this page, for reference purposes)|
- Depositors only (login required):