Back to Search
Start Over
Logical optimality of groundness analysis
- Source :
-
Theoretical Computer Science . Apr2002, Vol. 277 Issue 1/2, p149. 36p. - Publication Year :
- 2002
-
Abstract
- In the context of the abstract interpretation theory, we study the relations among various abstract domains for groundness analysis of logic programs. We reconstruct the well-known domain <f>Pos</f> as a logical domain in a fully automatic way and we prove that it is the best abstract domain which can be set up from the property of groundness by applying logic operators only. We propose a new notion of optimality which precisely captures the relation between <f>Pos</f> and its natural concrete domain. This notion enables us to discriminate between the various abstract domains for groundness analysis from a computational point of view and to compare their relative precision. Finally, we propose a new domain for groundness analysis which has the advantage of being independent from the specific program and we show its optimality. [Copyright &y& Elsevier]
- Subjects :
- *ABSTRACT data types (Computer science)
*LOGIC programming
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 277
- Issue :
- 1/2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 7793002
- Full Text :
- https://doi.org/10.1016/S0304-3975(00)00316-9