King, A. and Smaus, J.G. and Hill, P. (1999) Quotienting share for dependency analysis. In: 8th European Symposium on Programming, ESOP’99 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS’99, March 22-28, 1999, Amsterdam, Netherlands.
Def, the domain of definite Boolean functions, expresses (sure) dependencies between the program variables of, say, a constraint program. 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 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. Further, we show how by compressing and widening Shore and by rescheduling meet operations, we can construct a dependency analysis that is surprisingly fast and precise, and comes with time- and space- performance guarantees. Unlike some other approaches, our analysis can be coded straightforwardly in Prolog.
|Item Type:||Conference or workshop item (Paper)|
|Additional information:||(c) Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html|
|Uncontrolled keywords:||constraint) logic programs; abstract interpretation; dataflow analysis; dependency analysis; definite Boolean functions; widening|
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing
Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
|Depositing User:||I.T. Ekpo|
|Date Deposited:||14 Apr 2009 16:17|
|Last Modified:||06 Sep 2011 02:11|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/16889 (The current URI for this page, for reference purposes)|
- Depositors only (login required):