Sciweavers

1204 search results - page 161 / 241
» Hybrid Probabilistic Programs
Sort
View
MSCS
2006
89views more  MSCS 2006»
15 years 2 months ago
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
Ellie D'Hondt, Prakash Panangaden
JLP
2007
98views more  JLP 2007»
15 years 2 months ago
Tempus fugit: How to plug it
Secret or private information may be leaked to an external attacker through the timing behaviour of the system running the untrusted code. After introducing a formalisation of thi...
Alessandra Di Pierro, Chris Hankin, Igor Siveroni,...
APIN
2000
155views more  APIN 2000»
15 years 2 months ago
Defeasible Logic on an Embedded Microcontroller
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
Michael A. Covington
CF
2005
ACM
15 years 4 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
ICALP
2007
Springer
15 years 4 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou