Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems

@inproceedings{Fecht1997PropagatingDA,
  title={Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems},
  author={Christian Fecht and Helmut Seidl},
  booktitle={Nord. J. Comput.},
  year={1997}
}
Integrating semi-naive fixpoint iteration from deductive data bases [3,2,4] as well as continuations into worklist-based solvers, we derive a new application independent local fixpoint algorithm for distributive constraint systems. Seemingly different efficient algorithms for abstract interpretation like those for linear constant 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… 
A Differential Fixpoint Evaluation Framework for Non-distributive Systems
TLDR
This work devise a differential fixpoint computation method and develop a new worklist algorithm based on it that can save computation and worklist scheduling is important also in differential evaluations.
Explicit Versus Symbolic Algorithms for Solving ALFP Constraints
Lattice based Least Fixed Point Logic
TLDR
A logic is presented that allows interpretations over any complete lattice satisfying Ascending Chain Condition, called Lattice based Least Fixed Point Logic (LLFP), that guarantees that there always is a unique least solution for a given problem.
Interprocedural Analysis Based on PDAs
TLDR
This framework is based on a small-step operational semantics where both the concrete and the abstract operational semantics are formalized by means of (input-free) pushdown automata and clarifies the relative precision of forward versus backward accumulation in presence of more or less complex intraprocedural control-ow graphs.
Experiments with Succinct Solvers
The Succinct Solver of Nielson and Seidl is based on the Alternation-free Least Fixed Point Logic and it is implemented in SML using a combination of recursion, continuations, prefix trees and
A Scalable Inclusion Constraint Solver Using Unification
TLDR
A parameterized framework with which users can take advantage of unification over analysis variables to implement efficient or precise analyses, or even both, and applies heuristics on benchmarks to achieve not only efficient but also precise analysis.
Verifying a Local Generic Solver in Coq
TLDR
The local generic fixpoint solver RLD which can be applied to constraint systems x ⊇ fx, x ∈ V, over some lattice D where the right-hand sides fx are given as arbitrary functions implemented in some specification language is considered.
A Succinct Solver for ALFP
TLDR
A solver algorithm which allows to efficiently compute the stable model of a very expressive fragment of predicate logic, due to the disciplined use of continuations and memoisation, and which frequently performs better than the worst-case complexity estimates.
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm infers
Interprocedurally Valid Relations in Affine Prog rams
TLDR
An abstraction of programs which preserves affine assignments exactly while conservatively dealing wi th other assignments and ignoring conditions at branches is considered and an interprocedural analysis of such abstracted pro grams is presented.
...
...

References

SHOWING 1-10 OF 43 REFERENCES
Infinitary control flow analysis: a collecting semantics for closure analysis
TLDR
This paper shows how to define a collecting semantics for control flow analysis and proves the semantic soundness of the collecting semantics and that all totally deterministic instantiations have a least solution.
Interprocedural Analysis Based on PDAs
TLDR
This framework is based on a small-step operational semantics where both the concrete and the abstract operational semantics are formalized by means of (input-free) pushdown automata and clarifies the relative precision of forward versus backward accumulation in presence of more or less complex intraprocedural control-ow graphs.
A type system equivalent to flow analysis
TLDR
This paper proves that Amadio and Cardelli's type system with subtyping and recursive types accepts the same programs as a certain safety analysis, and obtains an inference algorithm for the type system, thereby solving an open problem.
Abstract Interpretation of Prolog Based on OLDT Resolution
TLDR
This paper is a systematic study of OLDT resolution for abstract interpretation from the semantic framework to an efficient fixpoint algorithm and its experimental evaluation, which sheds new light on the usefulness and the impact of granularity in abstract interpretation of logic programs.
A Universal Top-Down Fixpoint Algorithm
TLDR
A universal top-down fixpoint algorithm based on the weak assumption that the transformation is defined by an effective procedure that computes the value of the parameter value in the least fixpoint of the transformation has the property of focusing on the subset of elements necessary to compute the result.
Precise interprocedural dataflow analysis via graph reachability
The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem. The
Set-based analysis of ML programs
TLDR
This paper develops an approximate “set-based” operational semantics for the language, which formalizes the intuition of treating program variables as sets and develops an O(n3) algorithm for computing the set based approximation of a program.
Compile-Time Derivation of Variable Dependency Using Abstract Interpretation
Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation
TLDR
Two new optimization techniques are proposed and applied to the original algorithm of Reference 1: dependency on clause prefixes and caching of operations and show that even extremely basic domains can benefit from the optimizations.
Closure analysis in constraint form
TLDR
The core of the proof technique is to define closure analysis using a constraint system, which is equivalent to the closure analysis of Bondorf, which in turn is based on Sestoft's.
...
...