Programs with lists are counter automata

  • Authors:

  • Ahmed Bouajjani;Marius Bozga;Peter Habermehl;Radu Iosif;Pierre Moro;Tomáš Vojnar

  • Affiliations:

  • LIAFA, University Paris Diderot--Paris 7, Paris Cedex 13, France 75251;VERIMAG, Gières, France 38610;LIAFA, University Paris Diderot--Paris 7, Paris Cedex 13, France 75251;VERIMAG, Gières, France 38610;LIAFA, University Paris Diderot--Paris 7, Paris Cedex 13, France 75251;FIT, Brno University of Technology, Brno, Czech Republic 61266

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of verifying programs manipulating one-selector linked data structures. We propose and study in detail an application of counter automata as an accurate abstract model for this problem. We let control states of the counter automata correspond to abstract heap graphs where list segments without sharing are collapsed, and use counters to keep track of the number of elements in these segments. As a significant theoretical result, we show that the obtained counter automata are bisimilar to the original programs. Moreover, from a practical point of view, our translation allows one to apply efficient automatic analysis techniques and tools developed for counter automata (integer programs) in order to verify both safety as well as termination of list-manipulating programs. As another theoretical contribution, we prove that if the control of the generated counter automata does not contain nested loops (i.e., these automata are flat), both safety and termination are decidable for the original programs. Subsequently, we generalise our counter-automata-based model to keep track of ordering properties over lists storing ordered data. Finally, we show effectiveness of our approach by verifying automatically safety as well as termination of several sorting programs.