A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Inferring argument size relationships with CLP( $$\mathcal{R}$$ )
[chapter]
1997
Lecture Notes in Computer Science
Argument size relationships are useful in termination analysis which, in turn, is important in program synthesis and goal-replacement transformations. We show how a precise analysis for inter-argument size relationships, formulated in terms of abstract interpretation, can be implemented straightforwardly in a language with constraint support like CLP(R) or SICStus version 3. The analysis is based on polyhedral approximations and uses a simple relaxation technique to calculate least upper bounds
doi:10.1007/3-540-62718-9_12
fatcat:czkewlaunbcw7k23bhp7ycesoy