Decision Procedures for Flat Array Properties.
Francesco Alberti, Silvio Ghilardi, Natasha Sharygina · RERO DOC (Universität Bern) · 2014
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.