Automated Analysis of Data-Dependent Programs with Dynamic Memory
Paper i proceeding, 2009

We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and the edges reflect the pointer structure between the cells of the heap. Each cell contains a set of variables which range over the natural numbers. Our method relies on standard backward reachability analysis, where the main idea is to use a simple set of predicates, called signatures, in order to represent bad sets of heaps. Examples of bad heaps are those which contain either garbage, lists which are not well-formed, or lists which are not sorted. We present the results for the case of programs with a single next-selector, and where variables may be compared for (in)equality. This allows us to verify for instance that a program, like bubble sort or insertion sort, returns a list which is well-formed and sorted, or that the merging of two sorted lists is a new sorted list. We report on the result of running a prototype based on the method on a number of programs.

Författare

Ran Ji

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Parosh Aziz Abdulla

Jonathan Cederberg

Muhsin Atto

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 5799 Lecture Notes in Computer Science 197-212

Ämneskategorier

Datavetenskap (datalogi)

ISBN

978-3-642-04760-2

Mer information

Skapat

2017-10-08