4099 search results - page 16 / 820 » A Framework for Interactive Proof |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and veriļ¬er. The ļ...
ECCC
2010
14 years 8 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
113
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
Refereed games are interactive proof systems with two competing provers: one that tries to convince the veriļ¬er to accept and another that tries to convince the veriļ¬er to rej...
ARTS
1999
Springer
15 years 1 months ago
1999
Springer
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...