Convex Hull of Arithmetic Automata

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata.

[1]  Grégoire Sutre,et al.  Acceleration in Convex Data-Flow Analysis , 2007, FSTTCS.

[2]  Jérôme Leroux,et al.  TaPAS: The Talence Presburger Arithmetic Suite , 2009, TACAS.

[3]  Alain Finkel,et al.  The convex hull of a regular set of integer vectors is polyhedral and effectively computable , 2005, Inf. Process. Lett..

[4]  Jérôme Leroux.  The Affine Hull of a Binary Automaton is Computable in Polynomial Time , 2003, INFINITY.

[5]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[6]  Sanjiva Prasad,et al.  FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings , 2007, FSTTCS.

[7]  Bernd Becker,et al.  LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals , 2007, CAV.

[8]  Louis Latour,et al.  From automata to formulas: convex integer polyhedra , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[9]  Jérôme Leroux,et al.  FAST Extended Release , 2006, CAV.

[10]  Jérôme Leroux,et al.  A polynomial time Presburger criterion and synthesis for number decision diagrams , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[11]  Grégoire Sutre,et al.  Accelerated Data-Flow Analysis , 2007, SAS.

[12]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[13]  Denis Lugiez,et al.  From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) , 2004, CIAA.

[14]  Frédéric Herbreteau,et al.  The Power of Hybrid Acceleration , 2006, CAV.

[15]  Pierre Wolper,et al.  On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) , 1998, ICALP.

[16]  Michael Karr,et al.  Affine relationships among variables of a program , 1976, Acta Informatica.

[17]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[18]  Gilberto Filé,et al.  Static Analysis, 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007, Proceedings , 2007, SAS.

[19]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.