Sciweavers

3228 search results - page 320 / 646
» Computationally Sound Proofs
Sort
View
PKC
1999
Springer
125views Cryptology» more  PKC 1999»
15 years 8 months ago
Anonymous Fingerprinting Based on Committed Oblivious Transfer
Abstract. Thwarting unlawful redistribution of information sold electronically is a major problem of information-based electronic commerce. Anonymous fingerprinting has appeared a...
Josep Domingo-Ferrer
RTA
1997
Springer
15 years 8 months ago
Proving Innermost Normalisation Automatically
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
Thomas Arts, Jürgen Giesl
FCT
2007
Springer
15 years 8 months ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
Thomas Colcombet
BIRTHDAY
2006
Springer
15 years 8 months ago
Proving Behavioral Refinements of COL-specifications
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
Michel Bidoit, Rolf Hennicker
BIRTHDAY
2006
Springer
15 years 8 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna