Publication detail

Programs with Lists are Counter Automata

IOSIF, R. HABERMEHL, P. VOJNAR, T. BOUAJJANI, A. BOZGA, M. MORO, P.

Original Title

Programs with Lists are Counter Automata

Type

conference paper

Language

English

Original 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.

Keywords

formal verification, model checking, programs with linked lists, counter automata, bisimulation

Authors

IOSIF, R.; HABERMEHL, P.; VOJNAR, T.; BOUAJJANI, A.; BOZGA, M.; MORO, P.

RIV year

2006

Released

10. 7. 2006

Publisher

Springer Verlag

Location

Berlin

ISBN

978-3-540-37406-0

Book

Computer Aided Verification

Edition

LNCS 4144

Pages from

517

Pages to

531

Pages count

15

BibTex

@inproceedings{BUT34272,
  author="Iosif {Radu} and Peter {Habermehl} and Tomáš {Vojnar} and Ahmed {Bouajjani} and Marius {Bozga} and Pierre {Moro}",
  title="Programs with Lists are Counter Automata",
  booktitle="Computer Aided Verification",
  year="2006",
  series="LNCS 4144",
  pages="517--531",
  publisher="Springer Verlag",
  address="Berlin",
  isbn="978-3-540-37406-0"
}