523 search results - page 86 / 105 » On the Power of Quantum Proofs |
CRYPTO
2005
Springer
15 years 5 months ago
2005
Springer
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
111
click to vote
RTA
2005
Springer
15 years 5 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
129
click to vote
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
113
click to vote
ISSAC
2004
Springer
15 years 5 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...