Exploiting Hub States in Automatic Verification | Zendy

Giuseppe Della Penna | Zendy; Igor Melatti | Zendy; Benedetto Intrigila | Zendy; Enrico Tronci | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Exploiting Hub States in Automatic Verification

Author(s) -

Giuseppe Della Penna,

Igor Melatti,

Benedetto Intrigila,

Enrico Tronci

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29209-8

DOI - 10.1007/11562948_7

Subject(s) - computer science , sketch , computation , protocol (science) , state (computer science) , state space , resource (disambiguation) , algorithm , theoretical computer science , parallel computing , distributed computing , computer network , medicine , statistics , alternative medicine , mathematics , pathology

In this paper we present a new algorithm to counteract state explosion when using Explicit State Space Exploration to verify protocol-like systems. We sketch the implementation of our algorithm within the Caching Mur psi verifier and give experimental results showing its effectiveness. We show experimentally that, when memory is a scarce resource, our algorithm improves on the time performances of Caching Mur psi verification algorithm, saving between 16% and 68% (45% on average) in computation time

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research