For finite tree automata with coefficients in a field R, a polynomial time algorithm is given for deciding ambiguity-equivalence provided R-operations and R-tests for 0 can be performed in constant time.Expand

It is sketched how classical monadic second-order logic by Presburger predicates can be extended also to answer questions like, e.g., whether the total price of the jazz music downloaded so far exceeds a user's budget.Expand

This work gives a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs and describes a generalization that determines all polynomial relations up to degree d in time.Expand

We apply linear algebra techniques to precise interprocedural dataflow analysis. Specifically, we describe analyses that determine for each program point identities that are valid among the program… Expand

This work presents intra-and interprocedural algorithms for inferring for every programpoint u affine relations between program variables valid atu and indicates how the analysis can be extended to deal with equalityguards, even in an interprocesural setting.Expand

It is shown that modulo the theory ACU of an associative-commutative symbol with unit, as well as its variants like the theory XOR and the theory AG of Abelian groups, unsatisfiability is NP-complete.Expand

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.Expand