1 / 11

Murphi Verification Tool: Efficient State Reduction & Symmetry Equivalence for On-the-Fly Model Checking

Murphi Verification Tool is a software algorithm developed by N. Mallikarjuna Rao, K. Ravi Sankar, Kolli Kiran Kumar offering on-the-fly model checking. It is based on guarded commands and explicit state enumeration for state reduction and symmetry. The tool utilizes reversible rules, repetition constructors symmetry, scalarset, and restricted access for automorphism equivalent state construction. It identifies reversible rules, subsets, and makes the progenitor the state repetition constructors. By employing hashing, hash compaction, and detecting equivalent states, it optimizes state space for efficient verification with low probability of errors.

malik-rodriguez
Télécharger la présentation

Murphi Verification Tool: Efficient State Reduction & Symmetry Equivalence for On-the-Fly Model Checking

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Murphi – Verification Tool By N.Mallikarjuna Rao K.Ravi Sankar Kolli Kiran Kumar

  2. Murphi Algorithm • On-the-fly Model checking Algorithm • Based on guarded commands • Explicit state enumeration

  3. State Reduction • Symmetry • Reversible Rules • Repitition Constructors

  4. Symmetry • Scalarset • Restricted Access • Automorphism

  5. Equivalent State Construction • Symmetry Equivalence Class

  6. State Reduction with Reversible Rules • Identifying the reversible rules • Identifying the subset • Making the proginator as the state

  7. Repetition Constructors • Finding the exact number • Finding the number which is enough • Utilized areas

  8. Hash Compaction • State Space • Hashing • Size of each state • Detecting equivalent states

  9. Hash Compaction • Large table of bits • Problems: more than one state to the same

  10. Probabilistic Verification • Size of each state • Open addressing • Verification with low probability of errors

More Related