Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A General Approach to Partial Order Reductions in Symbolic Verification
 

Summary: A General Approach to Partial Order Reductions in
Symbolic Verification
(Extended Abstract)
Parosh Aziz Abdulla \Lambda Bengt Jonsson y Mats Kindahl z
Doron Peled x
Abstract
The purpose of partial­order verification techniques is to avoid exploring
several interleavings of independent transitions. The purpose of symbolic ver­
ification techniques is to perform basic manipulations on sets of states rather
than on individual states. We present a general method for applying partial
order reductions to improve symbolic verification. The method is equally appli­
cable to the verification of finite­state and infinite­state systems. It considers
methods that check safety properties, either by forward reachability analysis
or by backward reachability analysis. We base the method on the concept of
commutativity (in one direction) between predicate transformers. Since the
commutativity relation is not necessarily symmetric, this generalizes those ex­
isting approaches to partial order verification which are based on a symmetric
dependency relation.
We show how our method can be applied to several models of infinite­state
systems: systems communicating over unbounded lossy FIFO channels, and

  

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

 

Collections: Computer Technologies and Information Sciences