1914 search results - page 165 / 383 » Verification by Abstract Interpretation |
101
Voted
FUIN
2006
15 years 24 days ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
131
Voted
IPL
2008
15 years 24 days ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
104
click to vote
CAV
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
100
click to vote
STTT
2010
14 years 7 months ago
2010
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
110
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....