Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Monotonic Abstraction for Programs with Dynamic Memory Heaps
 

Summary: Monotonic Abstraction for Programs with
Dynamic Memory Heaps
Parosh Aziz Abdulla1
, Ahmed Bouajjani2
, Jonathan Cederberg1
,
FrŽedŽeric Haziza1
and Ahmed Rezine1,2
.
1
Uppsala University, Sweden and 2
LIAFA, University of Paris 7, France.
Abstract. We propose a new approach for automatic verification of
programs with dynamic heap manipulation. The method is based on
symbolic (backward) reachability analysis using upward-closed sets of
heaps w.r.t. an appropriate preorder on graphs. These sets are repre-
sented by a finite set of minimal graph patterns corresponding to a set
of bad configurations. We define an abstract semantics for the programs
which is monotonic w.r.t. the preorder. Moreover, we prove that our
analysis always terminates by showing that the preorder is a well-quasi

  

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

 

Collections: Computer Technologies and Information Sciences