523 search results - page 73 / 105 » On the Power of Quantum Proofs |
TACAS
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
COCO
1994
Springer
15 years 3 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
114
click to vote
ICTL
1994
15 years 3 months ago
1994
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
106
click to vote
APLAS
2007
ACM
15 years 3 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....