Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,974,654 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
2010
2010
Formal Aspects of Computing Model checking with bounded context switching
G. Holzmann
,
M. Florian
2010
Corpus ID: 13426685
We discuss the implementation of a bounded context switching algorithm in the Spin model checker. The algorithm allows us to find…
Expand
2009
2009
Truly Bitstate-Hashing for SCC-Based Emptiness Checking Algorithms: Truly Bitstate-Hashing for SCC-Based Emptiness Checking Algorithms
Rongjie Yan
,
Wenliang Zhang
,
Zhisong Tang
2009
Corpus ID: 62731582
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
2005
2005
Accelerating External Search with Bitstate Hashing
S. Edelkamp
,
Shahid 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
,
Shahid 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
Review
1995
Review
1995
Tales from the Front: Industrial Experience with Formal Validation (preliminary Version)
M. G. Staskauskas
1995
Corpus ID: 9936551
We have developed a formal validation tool that has been used in several projects that are developing software for AT&T's 5ESS TM…
Expand