Deciding Presburger arithmetic by model checking and comparisons with other methods
From MaRDI portal
Recommendations
- A practical approach to model checking duration calculus using Presburger arithmetic
- scientific article; zbMATH DE number 1929303
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Rigid models of Presburger arithmetic
- Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic
- scientific article; zbMATH DE number 1512851
- scientific article; zbMATH DE number 4031630
- Model-theoretic methods of analysis of computer arithmetic
- On the decidability of model-checking for P systems
Cited in
(13)- The convex hull of a regular set of integer vectors is polyhedral and effectively computable
- String theories involving regular membership predicates: from practice to theory and back
- A layered algorithm for quantifier elimination from linear modular constraints
- Bounded model checking of infinite state systems
- Structural Presburger digit vector automata
- Towards more efficient methods for solving regular-expression heavy string constraints
- On the use of non-deterministic automata for Presburger arithmetic
- TaPAS: The Talence Presburger Arithmetic Suite
- Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
- On the path-width of integer linear programming
- Bounds on the automata size for Presburger arithmetic
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- Abstraction-based satisfiability solving of Presburger arithmetic
This page was built for publication: Deciding Presburger arithmetic by model checking and comparisons with other methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427903)