2137 search results - page 321 / 428 » Proving Abstract Non-interference |
109
Voted
GG
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
114
click to vote
HYBRID
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper we present algorithms and tools for fast and efficient reachability analysis, applicable to continuous and hybrid systems. Most of the work on reachability ...
109
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
101
Voted
IFM
2004
Springer
15 years 8 months ago
2004
Springer
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
122
click to vote
ISW
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...