On the complexity of the quantified bit-vector arithmetic with binary encoding
From MaRDI portal
Publication:1708270
DOI10.1016/j.ipl.2018.02.018zbMath1476.68111arXiv1612.01263OpenAlexW2796456315MaRDI QIDQ1708270
Publication date: 5 April 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.01263
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Model-checking hierarchical structures
- Complexity of fixed-size bit-vector logics
- Under-approximating loops in C programs for fast counterexample detection
- Ranking function synthesis for bit-vector relations
- Efficiently solving quantified bit-vector formulas
- Theory of computation.
- Constraint-Based Invariant Inference over Predicate Abstraction
- Alternation
- More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding
- From program verification to program synthesis
- Axiomatizations for Propositional and Modal Team Logic