Representing arithmetic constraints with finite automata: An overview
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)
Recommendations
- An effective decision procedure for linear arithmetic over the integers and reals
- Automata-based representations for arithmetic constraints in automated verification
- On the use of weak automata for deciding linear arithmetic with integer and real variables
- On the construction of automata from linear arithmetic constraints
- Approaching arithmetic theories with finite-state automata
Cited in
(20)- Regular model checking with regular relations
- Bounded model checking of infinite state systems
- Structural Presburger digit vector automata
- An Evaluation of Automata Algorithms for String Analysis
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
- How to Tackle Integer Weighted Automata Positivity
- Automata-based representations for arithmetic constraints in automated verification
- On the construction of automata from linear arithmetic constraints
- On the use of weak automata for deciding linear arithmetic with integer and real variables
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- An effective decision procedure for linear arithmetic over the integers and reals
- Validity Checking for Finite Automata over Linear Arithmetic Constraints
- Efficient Symbolic Representations for Arithmetic Constraints in Verification
- Antichain with SAT and tries
- Ehrenfeucht-Fraïssé goes automatic for real addition
- An introduction to the theory of linear integer arithmetic (invited paper)
- Approaching arithmetic theories with finite-state automata
- Reformulation of global constraints based on constraints checkers
- On the freeze quantifier in Constraint LTL: Decidability and complexity
This page was built for publication: Representing arithmetic constraints with finite automata: An overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809151)