Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Constrained Monotonic Abstraction: a CEGAR for Parameterized Verification
 

Summary: Constrained Monotonic Abstraction: a CEGAR
for Parameterized Verification
Parosh Aziz Abdulla1
, Yu-Fang Chen2
, Giorgio Delzanno3
, FrŽedŽeric Haziza1
,
Chih-Duo Hong2
, and Ahmed Rezine1
1
Uppsala University, Sweden
2
Academia Sinica, Taiwan
3
Universit`a di Genova, Italy
Abstract. In this paper, we develop a counterexample-guided abstrac-
tion refinement (CEGAR) framework for monotonic abstraction, an ap-
proach that is particularly useful in automatic verification of safety prop-
erties for parameterized systems. The main drawback of verification using
monotonic abstraction is that it sometimes generates spurious counterex-

  

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

 

Collections: Computer Technologies and Information Sciences