2137 search results - page 129 / 428 » Proving Abstract Non-interference |
98
Voted
RTA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
110
click to vote
ESSOS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present an approach to security requirements engineering, which makes use of special kinds of problem frames that serve to structure, characterize, analyze, and solve ...
113
click to vote
ICANNGA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper proposes an automated quantum circuit synthesis approach, using a genetic algorithm. We consider the circuit as a successive rippling of the so-called gate sec...
123
click to vote
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
110
click to vote
ASIACRYPT
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...