Thomas Gawlitza and Helmut Seidl. Precise Fixpoint Computation Through Strategy Iteration. In Rocco De Nicola, editor, Programming Languages and Systems, volume 4421 of Lecture Notes in Computer Science, pages 300-315, Braga, Portugal, April 2007. Springer.

We present a practical algorithm for computing least solutions of systems of equations over the integers with addition, multiplication with positive constants, maximum and minimum. The algorithm is based on strategy iteration. Its run-time (w.r.t. the uniform cost measure) is independent of the sizes of occurring numbers. We apply our technique to solve systems of interval equations. In particular, we show how arbitrary intersections as well as full interval multiplication in interval equations can be dealt with precisely.

Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com