Algorithmic Analysis of Array-Accessing Programs

Abstract For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace -complete for programs in which the array-accessing for -loops are not nested, (2) decidable for a restricted class of programs with doubly-nested loops. The second result establishes connections to automata and logics defining languages over data words.

Authors

• Rajeev Alur
• Pavol Cerný
• Scott Weinstein

Keywords

No keywords are indexed for this paper.