• Home
  • Search
  • COVERAGE INFERENCE IN MODEL CHECKING USING SEQUENTIAL MULTIPLE HASHING
  • https://doi.org/10.47893/ijcct.2016.1373Copy DOI Icon

COVERAGE INFERENCE IN MODEL CHECKING USING SEQUENTIAL MULTIPLE HASHING

  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Model checking automatically tests whether a model meets a given specification or not. It is a technique for verifying correctness properties of finite-state systems. One of the major problems in model checking is the state-explosion. To overcome this, a probabilistic approach called Bit-state Hashing is used to reduce the memory requirements. Bit-state hashing uses a data structure called bloom filter to store the corresponding reached states in a hash table. By enlarging a bloom filter, it improves total coverage estimation using a growth curve that approximates increased in reached states. To increase the effectiveness of the existing system, coverage estimation in model checking with sequential multiple bit-state hashing has been proposed. The sequentially repeated bit state hashing technique can outperform all other hashing methods, even for very large problem size.

Similar Papers
  • Book Chapter
  • Citations15

Fast, All-Purpose State Storage

  • Jan 01, 2009
  • Peter C Dillinger +1
  • Book Chapter
  • Citations90

Bloom Filters in Probabilistic Verification

  • Jan 01, 2004
  • Peter C Dillinger +1
  • Conference Article
  • Citations4

Par-BF: A Parallel Partitioned Bloom Filter for Dynamic Data Sets

  • Nov 01, 2014
  • Yi Liu +3
  • PDF
  • Research Article
  • Citations1

A Framework for Integrating the Distributed Hash Table (DHT) with an Enhanced Bloom’s Filter in Manet

  • Jan 01, 2022
  • International Journal of Advanced Computer Science and Applications
  • Renisha P Salim +1
  • Research Article
  • Citations3

Efficient FTL-Aware Data Categorization and Identification Scheme for Flash Memory

  • Aug 12, 2015
  • Journal of Circuits, Systems and Computers
  • Sololia Gudeta Ayele +4
  • PDF
  • Research Article
  • Citations47

Parameterized model checking of rendezvous systems

  • Jun 06, 2017
  • Distributed Computing
  • Benjamin Aminof +4
  • PDF
  • Research Article
  • Citations5

Comparison on Search Failure between Hash Tables and a Functional Bloom Filter

  • Jul 29, 2020
  • Applied Sciences
  • Hayoung Byun +1
  • PDF
  • Research Article
  • Citations19

German tanks and historical records: the estimation of the time coverage of ungauged extreme events

  • May 08, 2017
  • Stochastic Environmental Research and Risk Assessment
  • Ilaria Prosdocimi
  • Research Article
  • Citations8

Model checking lattices: using and reasoning about information orders for abstraction

  • May 01, 1999
  • Logic Journal of IGPL
  • S Hazelhurst
  • Conference Article
  • Citations5

Bloom Filters Based on the B-tree

  • Mar 01, 2009
  • Fumiaki Sato +1
  • Conference Article
  • Citations6

Evaluation of the Structured Bloom Filters Based on Similarity

  • Mar 01, 2011
  • Hiroshi Sakuma +1
  • Research Article
  • Citations10

An Architectural Framework for Accurate Characterization of Network Traffic

  • Jan 01, 2009
  • IEEE Transactions on Parallel and Distributed Systems
  • S.R Kundu +3
  • Conference Article

Topology calibration in data centers

  • Jun 01, 2017
  • Lailong Luo +3
  • Conference Article

Improving Multi-set Query Processing Via a Learned Oracle

  • May 22, 2020
  • Jingwen Cai +4
  • Research Article
  • Citations16

Cuckoo index

  • Sep 01, 2020
  • Proceedings of the VLDB Endowment
  • Andreas Kipf +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.