Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-30T20:23:15.035Z Has data issue: false hasContentIssue false
  • English
  • Français

Worst-case groundness analysis using definite Boolean functions

Published online by Cambridge University Press:  18 October 2001

SAMIR GENAIM ,
MICHAEL CODISH  and
JACOB M. HOWE
SAMIR GENAIM
Affiliation:
Department of Computer Science, Ben-Gurion University of the Negev, PO Box 653, 84105 Israel (e-mail: [email protected])
MICHAEL CODISH
Affiliation:
Department of Computer Science, Ben-Gurion University of the Negev, PO Box 653, 84105 Israel (e-mail: [email protected])
JACOB M. HOWE
Affiliation:
Computing Laboratory, University of Kent, Canterbury, Kent, UK
Get access Rights & Permissions [Opens in a new window]

Abstract

This note illustrates theoretical worst-case scenarios for groundness analyses obtained through abstract interpretation over the abstract domains of definite (Def) and positive (Pos) Boolean functions. For Def, an example is given for which any Def-based abstract interpretation for groundness analysis follows a chain which is exponential in the number of argument positions as well as in the number of clauses but sub-exponential in the size of the program. For Pos, we strengthen a previous result by illustrating an example for which any Pos-based abstract interpretation for groundness analysis follows a chain which is exponential in the size of the program. It remains an open problem to determine if the worst case for Def is really as bad as that for Pos.

Type
TECHNICAL NOTE
Information
Theory and Practice of Logic Programming , Volume 1 , Issue 5 , September 2001 , pp. 611 - 615
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)