Theory of linear and integer programming
Theory of linear and integer programming
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
From Automata to Formulas: Convex Integer Polyhedra
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters
LIRA: handling constraints of linear arithmetics over the integers and the reals
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Acceleration in convex data-flow analysis
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The power of hybrid acceleration
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
From automata to semilinear sets: a logical solution for sets L (C, P)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Accelerated data-flow analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
| Hi-index | 0.00 |
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.