88 citations · 281 across the 25 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2008
Convex Hull of Arithmetic Automata
Jérôme Leroux
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent th…
cs.DS2008★ 21 cited
Accelerated Data-Flow Analysis
Jérôme Leroux, Gregoire Sutre
Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states…
cs.DS2006★ 3 cited
Least Significant Digit First Presburger Automata
Jérôme Leroux
Since 1969 \cite{C-MST69,S-SMJ77}, we know that any Presburger-definable set \cite{P-PCM29} (a set of integer vectors satisfying a formula in the first-order additive theory of the…