Sciweavers

1894 search results - page 15 / 379
» A TLA Proof System
Sort
View
LICS
2008
IEEE
14 years 4 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
14 years 4 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston
CRYPTO
2011
Springer
180views Cryptology» more  CRYPTO 2011»
12 years 10 months ago
Leakage-Resilient Zero Knowledge
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
Sanjam Garg, Abhishek Jain 0002, Amit Sahai
ECCC
2011
189views ECommerce» more  ECCC 2011»
13 years 5 months ago
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
Oded Goldreich, Or Meir
CSL
2002
Springer
13 years 10 months ago
On the Automatizability of Resolution and Related Propositional Proof Systems
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
Albert Atserias, Maria Luisa Bonet