54 search results - page 5 / 11 » Checking Secrecy by Means of Partial Order Reduction |
93
Voted
SPIN
2009
Springer
15 years 6 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
FMSD
2002
14 years 11 months ago
2002
Combining verification methods developed separately for software and hardware is motivated by the industry's need for a technology that would make formal verification of reali...
117
click to vote
SPIN
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
106
click to vote
ATVA
2008
Springer
15 years 1 months ago
2008
Springer
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...