Martin, Jon and King, Andy
Inferring Numeric Relationships for Logic Program Transformation.
In: Pre-conference proceedings of Logic Program Synthesis and Transformation.
(Full text available)
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.
- Depositors only (login required):