52 search results - page 7 / 11 » Explicit State Model Checking with Hopper |
103
Voted
SPIN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this comput...
147
Voted
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
117
Voted
FMICS
2007
Springer
15 years 7 months ago
2007
Springer
Due to the significant progress in automated verification, there are often several techniques for a particular verification problem. In many circumstances different techniques are ...
112
Voted
FMICS
2006
Springer
15 years 7 months ago
2006
Springer
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state spa...
142
Voted
VMCAI
2009
Springer
15 years 10 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...