Sciweavers

103 search results - page 5 / 21
» Algebraic Methods for Interactive Proof Systems
Sort
View
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 1 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ECCC
2010
98views more  ECCC 2010»
13 years 6 months ago
Verifying Computations with Streaming Interactive Proofs
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...
Graham Cormode, Justin Thaler, Ke Yi
LICS
1994
IEEE
13 years 11 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
EMSOFT
2007
Springer
14 years 1 months ago
The algebra of connectors: structuring interaction in BIP
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
Simon Bliudze, Joseph Sifakis
LPAR
2007
Springer
14 years 1 months ago
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
Richard Bonichon, David Delahaye, Damien Doligez