NP satisfiability for arrays as powers
From MaRDI portal
Publication:2152659
DOI10.1007/978-3-030-94583-1_15zbMath1498.68127arXiv2109.05363OpenAlexW4205959445MaRDI QIDQ2152659
Publication date: 8 July 2022
Full work available at URL: https://arxiv.org/abs/2109.05363
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Decision procedures for flat array properties
- Deciding Boolean algebra with Presburger arithmetic
- Dominoes and the complexity of subclasses of logical theories
- The computational complexity of logical theories
- Program verification. Fundamental issues in computer science
- Cardinality constraints for arrays (decidability results and applications)
- Decision procedures for extensions of the theory of arrays
- Carathéodory bounds for integer cones
- The first order properties of products of algebraic systems
- Ordered Sets in the Calculus of Data Structures
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- Array Folds Logic
- What Else Is Decidable about Integer Arrays?
- On direct products of theories
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: NP satisfiability for arrays as powers
