Codish, M. and Heaton, A. and King, Andy
Widening Pos for Efficient and Scalable Groundness Analysis of Logic Programs.
University of Kent at Canterbury
(Full text available)
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.
- Depositors only (login required):