Sciweavers

3552 search results - page 153 / 711
» Proof theory in the abstract
Sort
View
WISTP
2009
Springer
16 years 1 months ago
Performance Issues of Selective Disclosure and Blinded Issuing Protocols on Java Card
Abstract. In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing [1]. The performance is relati...
Hendrik Tews, Bart Jacobs
PPSWR
2005
Springer
15 years 12 months ago
Descriptive Typing Rules for Xcerpt
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
Sacha Berger, Emmanuel Coquery, Wlodzimierz Draben...
IFIP
2004
Springer
15 years 11 months ago
Complementing Computational Protocol Analysis with Formal Specifications
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
RTA
2010
Springer
15 years 10 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
TABLEAUX
2000
Springer
15 years 10 months ago
A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo