Theory of linear and integer programming
Theory of linear and integer programming
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The definable criterion for definability in Presburger arithmetic and its applications
Theoretical Computer Science
From Automata to Formulas: Convex Integer Polyhedra
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Convex Hull of Arithmetic Automata
SAS '08 Proceedings of the 15th international symposium on Static Analysis
| Hi-index | 0.00 |
We give a logical characterization of semilinear sets L of the form $\mathcal{L}$($\mathcal{C}$,$\mathcal{P}$) that can be checked in double exponential time from an automaton $\mathcal{A}$ accepting L. Sets $\mathcal{C}$ and $\mathcal{P}$ such L=$\mathcal{L}$($\mathcal{C}$,$\mathcal{P}$) are computed during the verification process.