Codish, M. and Heaton, A. and King, Andy (1997) Widening Pos for Efficient and Scalable Groundness Analysis of Logic Programs. Technical report. University of Kent at Canterbury
| Postscript | ||
|
Download (184Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
|
Download (184Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
Abstract
Positive (Pos) and definite (Def) Boolean functions have been successfully applied to infer dependencies between the variables of a logic program. Two new analysis techniques for Boolean functions are presented. The first is an easy to implement, fast and scalable technique for the goal dependent analysis of logic programs. It is based on widening Pos. The second technique is based on using linear constraints to represent formulae in Def. The resulting analysis is both easy to implement and precise. It is more suited to the analysis of constraint programs.
| Item Type: | Monograph (Technical report) |
|---|---|
| Uncontrolled keywords: | abstract interpretation and logic programming |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 02 Aug 2009 21:41 |
| Last Modified: | 24 Apr 2012 13:18 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21423 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
