1888 search results - page 32 / 378 » Proof theory and computational analysis |
131
click to vote
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
181
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
174
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
138
Voted
ESORICS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our ...
171
click to vote
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...