65 search results - page 13 / 13 » birthday 2010 |
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
BIRTHDAY
2010
Springer
13 years 1 months ago
2010
Springer
Abstract. Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. The classical view part...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...