Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reasoning about infinite computations
Information and Computation
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
On syntactic congruences for &ohgr;-languages
Theoretical Computer Science - Special issue: formal language theory
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Temporal deductive databases and infinite objects
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Mixed real-integer linear quantifier elimination
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Efficient minimization of deterministic weak &ohgr;-automata
Information Processing Letters
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Finite Automata Encoding Geometric Figures
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Counting the Solutions of Presburger Equations without Enumerating Them
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
A Comparison of Presburger Engines for EFSM Reachability
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract)
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Observations on determinization of Büchi automata
Theoretical Computer Science - Implementation and application of automata
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Proof Synthesis and Reflection for Linear Arithmetic
Journal of Automated Reasoning
Convex Hull of Arithmetic Automata
SAS '08 Proceedings of the 15th international symposium on Static Analysis
T(O)RMC: A Tool for (ω)-Regular Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Computing Convex Hulls by Automata Iteration
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Don't care words with an application to the automata-based approach for real addition
Formal Methods in System Design
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A generalization of Cobham's theorem to automata over real numbers
Theoretical Computer Science
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Generalization of Semenov's Theorem to Automata over Real Numbers
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Closed-loop learning of visual control policies
Journal of Artificial Intelligence Research
LIRA: handling constraints of linear arithmetics over the integers and the reals
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Mechanizing the powerset construction for restricted classes of ω-automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Ehrenfeucht--Fraïssé goes automatic for real addition
Information and Computation
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Don't care words with an application to the automata-based approach for real addition
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
Verifying mixed real-integer quantifier elimination
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Observations on determinization of büchi automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Automata-Based symbolic representations of polyhedra
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A generalization of Cobham's theorem to automata over real numbers
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This article considers finite-automata-based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some difficult and delicate to implement algorithms. The contribution of this article is to show, using topological arguments, that only a restricted class of automata on infinite words are necessary for handling real and integer linear arithmetic. This allows the use of substantially simpler algorithms, which have been successfully implemented.