2137 search results - page 66 / 428 » Proving Abstract Non-interference |
AAECC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract. Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure in...
ISPEC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...
103
click to vote
ZUM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a new methodology that permits to reuse an existing hardware component that has not been developed within the B framework while maintaining a correct design ...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...