Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Automatic Verification of Dynamic Data-Dependent Programs
 

Summary: Automatic Verification of Dynamic
Data-Dependent Programs
Parosh Aziz Abdulla1
, Muhsin Atto1
, Jonathan Cederberg1
, Ran Ji1
.
1
Uppsala University, Sweden.
Abstract. We present a new approach for automatic verification of
data-dependent programs manipulating dynamic heaps. A heap is en-
coded 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 equality or in-

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences