Improving Reachability Analysis of Infinite State Systems by Specialization

نویسندگان

  • Fabio Fioravanti
  • Alberto Pettorossi
  • Maurizio Proietti
  • Valerio Senni
چکیده

We consider infinite state reactive systems specified by using linear constraints over the integers, and we address the problem of verifying safety properties of these systems by applying reachability analysis techniques. We propose a method based on program specialization, which improves the effectiveness of the backward and forward reachability analyses. For backward reachability our method consists in: (i) specializing the reactive system with respect to the initial states, and then (ii) applying to the specialized system a reachability analysis that works backwards from the unsafe states. For forward reachability our method works as for backward reachability, except that the role of the initial states and the unsafe states are interchanged. We have implemented our method using the MAP transformation system and the ALV verification system. Through various experiments performed on several infinite state systems, we have shown that our specialization-based verification technique considerably increases the number of successful verifications without significantly degrading the time performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controlling Polyvariance for Specialization-based Verification

Program specialization has been proposed as a means of improving constraint-based analysis of infinite state reactive systems. In particular, safety properties can be specified by constraint logic programs encoding (backward or forward) reachability algorithms. These programs are then transformed, before their use for checking safety, by specializing them with respect to the initial states (in ...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

Symbolic Computation of Maximal Probabilistic Reachability

We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of the maximal probability of reaching a given set of states, and underlies decision procedures for the automatic verification of probabilistic systems. We extend the framework of symbolic transition systems, which equips...

متن کامل

Evaluation of the reachability subspace of general form polynomial matrix descriptions (PMDs)

We consider the concept of Reachability for systems described by PMDs, generalizing various known results from the theory of generalized state space systems using time domain analysis,which takes into account the finite and infinite pole-zero structure of the associated matrix. We extend also the theory of admissible initial conditions and we introduce the concept of Reachable subspace for PMDs...

متن کامل

Improving the Transient Stability of Power Systems Using STATCOM and Controlling it by Honey Bee Mating Optimization Algorithm

In this study, a new method for designing the damping controller was proposed to improve the transient power system stability in a single machine network connected to an infinite bus. The STATCOM controller problem in a wide area of the system function was considered as an optimization problem with multi-purpose objective function. Also, the Honey Bee Mating Optimization Algorithm was used to d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 119  شماره 

صفحات  -

تاریخ انتشار 2011