Verifying Systems with Replicated Components in Mur&b.phiv;

  • Authors:

  • C. Norris Ip;David L. Dill

  • Affiliations:

  • Cadence Berkeley Laboratories, Cadence Design Systems, Inc., USA. ip@cadence.com;Computer Systems Laboratory, Stanford University, USA. dill@cs.stanford.edu

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

An extension to the Mur&b.phiv; verifier is presented to verifysystems with replicated identical components. Although most systems are finite-statein nature, many of them are also designed to be scalable, so that adescription gives a family of systems, each member of which has adifferent number of replicated components. It is thereforedesirable to be able to verify the entire family of systems,independent of the exact number of replicated components.The verification is performed by explicit state enumeration in anabstract state space where states do not record the exact numbers ofcomponents. We provide an extension to the existing Mur&b.phiv; language, bywhich a designer can easily specify a system in its concrete form.Through a new datatype, called RepetitiveID, a designer can suggest the use of this abstraction to verify a family of systems.First of all, Mur&b.phiv; automatically checks the soundness of thisabstraction. Then it automatically translates the systemdescription to an abstract state graph for a system of a fixed size.During the verification of the system of a fixed size, Mur&b.phiv; uses asimple run-time check to determine if the result can be generalized for afamily of systems with sizes larger than the original system, including the system with an unbounded number ofcomponents.