Sciweavers

335 search results - page 56 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 1 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
IEEESCC
2009
IEEE
14 years 2 months ago
Web Service Substitution Based on Preferences Over Non-functional Attributes
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
OOPSLA
2007
Springer
14 years 1 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
PEWASUN
2004
ACM
14 years 1 months ago
A novel solution for achieving anonymity in wireless ad hoc networks
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...
POPL
2006
ACM
14 years 8 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy