1995
DOI: 10.1007/3-540-60385-9_13
|View full text |Cite
|
Sign up to set email alerts
|

Improved probabilistic verification by hash compaction

Abstract: S. We present and analyze a probabilistic method for verification by explicit state enumeration, which improves on the "hashcompact" method of Wolper and Leroy. The hashcompact method maintains a hash table in which compressed values for states instead of full state descriptors are stored. This method saves space but allows a non-zero probability of omitting states during verification, which may cause verification to miss design errors (i.e. verification may produce "false positives"). Our method improves on W… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

1995
1995
2005
2005

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 67 publications
(36 citation statements)
references
References 11 publications
0
36
0
Order By: Relevance
“…In particular it is compatible with all state reduction techniques present in the Murϕ verifier. We show experiments using our algorithm together with the bit compression [10] and hash compaction [18,19] features of the Murϕ verifier (Sect. 4).…”
Section: Introductionmentioning
confidence: 99%
“…In particular it is compatible with all state reduction techniques present in the Murϕ verifier. We show experiments using our algorithm together with the bit compression [10] and hash compaction [18,19] features of the Murϕ verifier (Sect. 4).…”
Section: Introductionmentioning
confidence: 99%
“…DBF uses a hash table M to store signatures (e.g. see [6]) of recently visited states, a file D to store signatures of all visited states (old states) and splits the BF queue Q of CBF into two queues: Q ck and Q unck. DBF uses the checked queue Q ck to store the states in the currently explored BF level and uses the unchecked queue Q unck to store the states that are candidates to be on the next BF level.…”
Section: State Space Exploration Algorithmsmentioning
confidence: 99%
“…For example, such a file may contain: compression options with which CBF has been started (e.g. bit compression [1], hash compaction [6]); random seeds used in various hashing functions (e.g. in the computation of state signatures [6]), the BF level reached in the BF visit, the number of states visited so far, etc.…”
Section: Course a Serialization Scheme For Algorithms A And B Is Intementioning
confidence: 99%
See 1 more Smart Citation
“…A context closely related to ours is the use of state caching in explicit state model checking (e.g., [17]), which tracks the states generated by an abstract model of a system and does not explore the successors of an already-seen state. State caching is often improved through dead variable elimination.…”
Section: Related Workmentioning
confidence: 99%