Reliable Hashing without Collision Detection

Reliable Hashing without Collision Detection (1993)

by Pierre Wolper , Denis Leroy

Venue:	IN COMPUTER AIDED VERIFICATION. 5TH INTERNATIONAL CONFERENCE
Citations:	62 - 1 self

User correction supplied by mph

Datum	Value	Source
TITLE	Reliable Hashing without Collision Detection	user correction - Legacy Corrections
AUTHOR NAME	Pierre Wolper	user correction
AUTHOR AFFIL	Universite de Liege, Institut Montefiore, B28, 4000 Liege Sart Tilman, Belgium.	user correction
AUTHOR NAME	Denis Leroy	user correction
AUTHOR AFFIL	Universite de Liege, Institut Montefiore, B28, 4000 Liege Sart Tilman, Belgium.	user correction
ABSTRACT	Thanks to a variety of new techniques, state-space exploration is becoming an increasingly effective method for the verification of concurrent programs. One of these techniques, hashing without collision detection, was proposed by Holzmann as a waytovastly reduce the amount of memory needed to store the explored state space. Unfortunately, this reduction in memory use comes at the price of a high probability of ignoring part of the state space and hence of missing existing errors. In this paper, we carefully analyze this method and show that, by using a modified strategy, it is possible to reduce the risk of error to a negligible amount while maintaining the memory use advantage of Holzmann's technique. Our proposed strategy has been implemented and we describe experiments that confirm the excellent expected results.	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	IN COMPUTER AIDED VERIFICATION. 5TH INTERNATIONAL CONFERENCE	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	59--70	INFERENCE
CITATIONS	18 found	ParsCit 1.0