Integrating semi-naive fixpoint iteration from deductive data bases [3,2,4] as well as continuations into worklist-based solvers, wer derive a new application independent local fixpoint algorithm for distributive constraint systems. Seemingly different defficient algorithms for abstract interpretation like those for linear ocnstant propagation for imperative languages [17] as well as for control-flow analysis for functional languages [13] turn out to be instances of our scheme. Besides this systematizing contribution we also derive a new efficient algorithm for abstract OLDT-resolution as considered in [15,16,25] for prolog.
展开▼
