Book
Programs with Lists Are Counter Automata.
| Title: | Programs with Lists Are Counter Automata. |
|---|---|
| Authors: | Ball, Thomas, Jones, Robert B., Bouajjani, Ahmed, Bozga, Marius, Habermehl, Peter, Iosif, Radu, Moro, Pierre, Vojnar, Tomáš |
| Source: | Computer Aided Verification (9783540374060); 2006, p517-531, 15p |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Computer Aided Verification (9783540374060) is the property of Springer eBooks and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| DOI: | 10.1007/11817963_47 |
| Database: | Complementary Index |
Availability