Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

We suggest the first strongly subexponential and purely combinatorial algorithm for solving
the mean payoff games problem. It is based on iteratively improving the longest shortest …

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 …

We suggest the first strongly subexponential and purely combinatorial algorithm for mean
payoff games. It is based on solving a new “controlled” version of the shortest paths problem …

We present a practical algorithm for computing exact least solutions of systems of equations
over the rationals with addition, multiplication with positive constants, minimum and …

We present practical algorithms for computing exact least solutions of equation systems over
the reals with addition, multiplication by positive constants, minimum and maximum. The …

The complexity of solving infinite games, including parity, mean payoff, and simple
stochastic, is an important open problem in verification, automata, and complexity theory. In …

Fuzzy answer set programming (FASP) is a generalization of answer set programming
(ASP) in which propositions are allowed to be graded. Little is known about the …

In the present paper we compute numerical invariants of programs by abstract interpretation.
For that we consider the abstract domain of quadratic zones recently introduced by Adjé et …

We consider the problem of computing numerical invariants of programs by abstract
interpretation. Our method eschews two traditional sources of imprecision:(i) the use of …