1894 search results - page 205 / 379 » A TLA Proof System |
162
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
158
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register alloc...
158
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...
149
click to vote
CANS
2009
Springer
16 years 1 months ago
2009
Springer
We propose an efficient blind certification protocol with interesting properties. It falls in the Groth-Sahai framework for witness-indistinguishable proofs, thus extended to a ce...
184
click to vote
WFLP
2009
Springer
16 years 1 months ago
2009
Springer
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...