Worst-Case Groundness Analysis using Definite Boolean Functions

Samir Genaim, J.M. Howe and Michael Codish   

Theory and Practice of Logic Programming; 1(5) : 611-615, 2001


This note illustrates a theoretical worst-case scenario for groundness analyses obtained through abstract interpretation over the abstract domain of definite Boolean functions. A sequence of programs is given for which any Def-based abstract interpretation for groundness analysis follows an exponential chain.

Available:    bibtex entry   compressed postscript

Michael Codish
The Department of Computer Science
Ben-Gurion University of the Negev
PoB 653, Beer-Sheva, 84105, Israel

© copyright notice