Sciweavers

492 search results - page 41 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
84
Voted
ICALP
2005
Springer
15 years 4 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
CGO
2004
IEEE
15 years 2 months ago
A Compiler Scheme for Reusing Intermediate Computation Results
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
Yonghua Ding, Zhiyuan Li
CHI
2009
ACM
15 years 11 months ago
Finding causes of program output with the Java Whyline
Debugging and diagnostic tools are some of the most important software development tools, but most expect developers choose the right code to inspect. Unfortunately, this rarely o...
Andrew Jensen Ko, Brad A. Myers
FLOPS
2004
Springer
15 years 4 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 3 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or