261 search results - page 43 / 53 » Proof Normalization Modulo |
116
Voted
RTA
2004
Springer
15 years 5 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
92
Voted
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
75
Voted
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
117
Voted
EUROCRYPT
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a defi...
100
click to vote
PODS
1997
ACM
15 years 3 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...