Sciweavers

233 search results - page 23 / 47
» Interactive Proofs For Quantum Computations
Sort
View
FOCS
2008
IEEE
15 years 6 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
15 years 6 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
AI
2000
Springer
14 years 11 months ago
Proving theorems by reuse
We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematic...
Christoph Walther, Thomas Kolbe
BIRTHDAY
2006
Springer
15 years 3 months ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle
WOLLIC
2009
Springer
15 years 6 months ago
Ludics and Its Applications to Natural Language Semantics
Abstract. Proofs in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We shall follow the same idea by proposing that sentenc...
Alain Lecomte, Myriam Quatrini