Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,580,621 papers from all fields of science
Search
Sign In
Create Free Account
Bitstate hashing
Bitstate hashing is a hashing method invented in 1968 by Morris. It is used for state hashing, where each state (e.g. of an automaton) is represented…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Depth-first search
Hash function
SPIN model checker
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Model Checking of the Suzuki-Kasami Distributed Mutual Exclusion Algorithm with SPIN
S. Sakamoto
,
K. Ogata
International Conferences on Dependable Systems…
2018
Corpus ID: 54450542
We report on a case study in which we have model checked some properties for the Suzuki-Kasami distributed mutual exclusion…
Expand
2013
2013
Coverage Estimation in Model Checking with Bitstate Hashing
Satoshi Ikeda
,
M. Jibiki
,
Y. Kuno
IEEE Transactions on Software Engineering
2013
Corpus ID: 18400735
Explicit-state model checking which is conducted by state space search has difficulty in exploring satisfactory state space…
Expand
2012
2012
On the design of special hash functions for multiple hash tables
E. J. Serrano
International Conference on Electrical…
2012
Corpus ID: 9109570
One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of…
Expand
2008
2008
Truly Bitstate-Hashing for SCC-Based Emptiness Checking Algorithms
Yan Rong
2008
Corpus ID: 123204051
The paper proposes an improvement for SCC-based emptiness checking algorithms,which combines the advantages of SCC-based and…
Expand
2006
2006
Combining Couvreur's Algorithm with Bitstate-Hashing for Emptiness Check
Yige Li
,
Kanglin Xie
,
Tao Hao
International Multi-Symposium of Computer and…
2006
Corpus ID: 14224658
Emptiness check is very important in model checking to LTL. In this paper we first present a new emptiness checking algorithm…
Expand
2005
2005
Accelerating External Search with Bitstate Hashing
S. Edelkamp
,
S. Jabbar
2005
Corpus ID: 14273411
In this paper we refine external exploration for explicit state model checking by a fusion of External A* with internal bit state…
Expand
2005
2005
Accelerating External Search with Bitstate Hashing-Extended Abstract -
S. Edelkamp
,
S. Jabbar
2005
Corpus ID: 806756
In this paper we refine external exploration for explicit state model checking by a fusion with internal bitstate hashing…
Expand
2000
2000
Guided Synthesis of Control Programs for a Batch Plant using UPPAAL
T. Hune
,
K. Larsen
,
P. Pettersson
2000
Corpus ID: 14379515
In this paper we address the problem of scheduling and synthesizing distributed control programs for a batch production plant. We…
Expand
1998
1998
New Methods for Sequential Hashing with Supertrace
Jürgen Eckerle
,
Thomas Lais
1998
Corpus ID: 9062442
Partial search methods like bitstate hashing, or supertrace, allow formal verification techniques to be applied to problems which…
Expand
1995
1995
Tales from the Front: Industrial Experience with Formal Validation
M. G. Staskauskas
1995
Corpus ID: 264090676
A gas turbine engine of a gas-coupled type suited for driving a vehicle has auxiliary devices such as an air conditioning…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required