A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Parameterizing a Groundness Analysis of Logic Programs
[chapter]
2001
Lecture Notes in Computer Science
We present a parametric groundness analysis whose input and output are parameterized by a set of groundness parameters. The result of the analysis can be instantiated for different uses of the program. It can also be used to derive sufficient conditions for safely removing groundness checks for built-in calls in the program. The parametric groundness analysis is obtained by generalizing a non-parametric groundness analysis that uses the abstract domain Con. It is shown to be as precise as the
doi:10.1007/3-540-47764-0_9
fatcat:z3eanlywhrbtpjekh4uliqqjly