5084 search results - page 358 / 1017 » Proving Possibility Properties |
219
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
180
click to vote
CSFW
2000
IEEE
15 years 10 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
196
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
198
click to vote
POPL
2000
ACM
15 years 10 months ago
2000
ACM
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
187
click to vote
HYBRID
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...