Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Approximated Context-sensitive Analysis for Parameterized Verification
 

Summary: Approximated Context-sensitive Analysis for
Parameterized Verification
Parosh Aziz Abdulla1
parosh@it.uu.se,
Giorgio Delzanno2
giorgio@disi.unige.it, and
Ahmed Rezine3
rezine.ahmed@liafa.jussieu.fr
1
Uppsala University, Sweden
2
Universit`a di Genova, Italy
3
University of Paris 7, France.
Abstract. We propose a verification method for parameterized systems
with global conditions. The method is based on context-sensitive con-
straints, a symbolic representation of infinite sets of configurations de-
fined on top of words over a finite alphabet. We first define context-
sensitive constraints for an exact symbolic backward analysis of pa-
rameterized systems with global conditions. Since the model is Turing

  

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

 

Collections: Computer Technologies and Information Sciences