It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...