2137 search results - page 267 / 428 » Proving Abstract Non-interference |
127
click to vote
ECOOP
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
131
Voted
TYPES
1993
Springer
15 years 8 months ago
1993
Springer
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...
131
click to vote
ESORICS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
157
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
101
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...