21 citations · 29 across the 4 of their papers we have counts for
4 papers
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…
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…
Decomposition of Decidable First-Order Logics over Integers and Reals
Florent Bouchy, Alain Finkel, Jérôme Leroux
We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose…
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Alain Finkel, Jérôme Leroux
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant di…