922 search results - page 24 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
CSFW
2005
IEEE
14 years 3 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
LPNMR
2005
Springer
14 years 3 months ago
2005
Springer
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
ISIPTA
2003
IEEE
14 years 3 months ago
2003
IEEE
Dempster’s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speci...
DAM
2002
13 years 9 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
TELSYS
2002
13 years 9 months ago
2002
Formal description techniques, verification methods, and their tool-based automated application meanwhile provide valuable support for the formal analysis of communication protocol...