A New Scheme for Memory-Efficient Probabilistic Verification

A New Scheme for Memory-Efficient Probabilistic Verification (1996)

Cached

Download Links

[sprout.stanford.edu]

Other Repositories/Bibliography

DBLP

by Ulrich Stern , David L. Dill

Venue:	in IFIP TC6/WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification
Citations:	21 - 6 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A New Scheme for Memory-Efficient Probabilistic Verification	user correction - Legacy Corrections
AUTHOR NAME	Ulrich Stern	user correction - Legacy Corrections
AUTHOR AFFIL	Stanford University; Department of Computer Science, Stanford University, Stanford, CA	user correction - Legacy Corrections
AUTHOR ADDR	94305, USA	user correction - Legacy Corrections
AUTHOR NAME	David L. Dill	user correction - Legacy Corrections
AUTHOR AFFIL	Stanford University; Department of Computer Science, Stanford University, Stanford, CA	user correction - Legacy Corrections
AUTHOR ADDR	94305, USA	user correction - Legacy Corrections
ABSTRACT	In verification by explicit state enumeration, for each reachable state of the protocol being verified the full state descriptor is stored in a state table. Two probabilistic methods -- bitstate hashing and hash compaction -- have been proposed in the literature that store much fewer bits for each state but come at the price of some probability that not all reachable states will be explored during the search, and that the verifier may thus produce false positives. Holzmann introduced bitstate hashing and derived an approximation formula for the average probability that a particular state is not omitted during the search, but this formula does not give a bound on the probability of false positives. In contrast, the analysis for hash compaction, introduced by Wolper and Leroy and improved upon by Stern and Dill, yielded a bound on the probability that not even one state is omitted during the search, thus providing a bound on the probability of false positives. In this paper, we propose a...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	in IFIP TC6/WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	333--348	INFERENCE
CITATIONS	16 found	ParsCit 1.0