4217 search results - page 709 / 844 » Computational indistinguishability logic |
193
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
220
Voted
POPL
2005
ACM
16 years 1 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
78
Voted
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
104
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
116
click to vote
CADE
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...