Sciweavers

5084 search results - page 196 / 1017
» Proving Possibility Properties
Sort
View
PKC
2010
Springer
183views Cryptology» more  PKC 2010»
15 years 10 months ago
Unlinkability of Sanitizable Signatures
Sanitizable signatures allow a designated party, called the sanitizer, to modify parts of signed data such that the immutable parts can still be verified with respect to the origi...
Christina Brzuska, Marc Fischlin, Anja Lehmann, Do...
ICDT
1995
ACM
101views Database» more  ICDT 1995»
15 years 10 months ago
Approximation in Databases
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
Leonid Libkin
FAC
2008
97views more  FAC 2008»
15 years 6 months ago
A functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
Julien Schmaltz, Dominique Borrione
TOPLAS
2002
98views more  TOPLAS 2002»
15 years 6 months ago
Data abstraction and information hiding
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
K. Rustan M. Leino, Greg Nelson
FSTTCS
2010
Springer
15 years 4 months ago
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
Nicholas Radcliffe, Rakesh M. Verma