Howe, J.M. and King, A.
Implementing groundness analysis with definite Boolean functions.
Lecture Notes in Computer Science, 1782
The domain of definite Boolean functions, Def, can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, previously unexploited computational properties of Def are utilised to develop an efficient and succinct groundness analyser that can be coded in Prolog. In particular, entailment checking is used to prevent unnecessary least upper bound calculations. It is also demonstrated that join can be defined in terms of other operations, thereby eliminating code and removing the need for preprocessing formulae to a normal form. This saves space and time, Furthermore, the join can be adapted to straightforwardly implement the downward closure operator that arises in set sharing analyses. Experimental results indicate that the new Def implementation gives favourable results in comparison with BDD-based groundness analyses.
||Conference Information: Joint European Conference on Theory and Practice of Software (ETAPS 2000)
BERLIN, GERMANY, MAR 25-APR 02, 2000
Inst Communicat & Software Technol TU Berlin; European Assoc Program Languages & Syst; European Assoc Theoret Comp Sci; European Assoc Software Dev Sci
||abstract interpretation; (constraint) logic programs; definite Boolean functions; groundness analysis
||Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
||Faculties > Science Technology and Medical Studies > School of Computing
||14 May 2009 09:08
||25 Jun 2012 14:16
||http://kar.kent.ac.uk/id/eprint/16239 (The current URI for this page, for reference purposes)
- Depositors only (login required):