King, A. and Hill, P.M. and Smaus, J.G. (1998) Practical Dependency Analysis through a Share Quotient. Technical report. University of Kent
| Postscript | ||
|
Download (338Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
|
Download (311Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Official URL http://www.cs.kent.ac.uk/pubs/1998/587 |
||
Abstract
Def, the domain of definite Boolean functions, expresses (sure) dependencies between the program variables of, say, a constraint program. The domain Share, on the other hand, captures the (possible) variable sharing between the variables of a logic program. The connection between these domains has been explored in the domain comparison, quotienting and decomposition literature. We develop this link further and show how the meet (as well as the join) of Def can be modelled with efficient (quadratic) operations on Share. We show how the connection leads to an attractive way of constructing a dependency analysis and how widening can make the approach practical.
| Item Type: | Monograph (Technical report) |
|---|---|
| Uncontrolled keywords: | Constraint logic programming, abstract interpretation, dependency analysis, definite Boolean functions, widening |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 22 Aug 2009 12:30 |
| Last Modified: | 25 Jun 2012 10:16 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21660 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
