1226 search results - page 15 / 246 » Proofs, Programs and Abstract Complexity |
157
Voted
COCO
1991
Springer
15 years 6 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
145
Voted
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
143
click to vote
CASES
2008
ACM
15 years 5 months ago
2008
ACM
fficient Programming Abstractions for Heterogeneous Multicore Systems on Chip Alastair D. Reid Krisztian Flautner Edmund Grimley-Evans ARM Ltd Yuan Lin University of Michigan The ...
145
Voted
CRYPTO
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
142
click to vote
FMCAD
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...