Exploiting hub states in automatic verification

  • Authors:
  • Giuseppe Della Penna;Igor Melatti;Benedetto Intrigila;Enrico Tronci

  • Affiliations:
  • Dip. di Informatica, Università di L’Aquila, L’Aquila, Italy;Dip. di Informatica, Università di L’Aquila, L’Aquila, Italy;Dip. di Matematica, Università di Roma “Tor Vergata”, Roma, Italy;Dip. di Informatica, Universitá di Roma “La Sapienza”, Roma, Italy

  • Venue:
  • ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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ϕ 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ϕ verification algorithm, saving between 16% and 68% (45% on average) in computation time.