Programs with lists are counter automata

  • Authors:

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

  • Affiliations:

  • LIAFA, Paris University 7, Paris;VERIMAG, Gières;LIAFA, Paris University 7, Paris;VERIMAG, Gières;LIAFA, Paris University 7, Paris;FIT, Brno University of Technology, Brno

  • Venue:
  • CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

We address the verification problem of programs manipulating one-selector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abstract heap graphs where list segments without sharing are collapsed, and counters are used to keep track of the number of elements in these segments. This allows to apply automatic analysis techniques and tools for counter automata in order to verify list programs. We show the effectiveness of our approach, in particular by verifying automatically termination of some sorting programs.