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
, Giorgio Delzanno2
, and Ahmed Rezine3
1
Uppsala University, Sweden
parosh@it.uu.se
2
Universit`a di Genova, Italy
giorgio@disi.unige.it
3
University of Paris 7, France
rezine.ahmed@liafa.jussieu.fr
Abstract. We propose a verification method for parameterized sys-
tems with global conditions. The method is based on context-sensitive
constraints, a symbolic representation of infinite sets of configurations
defined on top of words over a finite alphabet. We first define context-
sensitive constraints for an exact symbolic backward analysis of para-
meterized 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