Abstract
We present new decidability results for quantified fragments of theories of arrays. Our decision procedures are parametric in the theories of indexes and elements and orthogonal with respect to known results. We show that transitive closures (’acceleratio’) of relation expressing certain array updates produce formulas inside our fragment; this observation will be used to identify a class of programs handling arrays having decidable reachability problem.
Original language | English |
---|---|
Journal | Journal of Automated Reasoning |
DOIs | |
Publication status | Accepted/In press - Mar 20 2015 |
Keywords
- Arrays
- Decision procedures
- Quantifiers
- SMT
ASJC Scopus subject areas
- Artificial Intelligence
- Software
- Computational Theory and Mathematics