Sciweavers

2432 search results - page 121 / 487
» Cryptographic logical relations
Sort
View
113
Voted
AAAI
2007
15 years 3 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
COLING
2002
15 years 14 days ago
Varying Cardinality in Metonymic Extensions to Nouns
Meaning shifting phenomena such as metonymy have recently attracted increasing interest of researchers. Though these phenomena have been addressed by plenty of computational metho...
Helmut Horacek
96
Voted
LICS
2002
IEEE
15 years 5 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
113
Voted
FOSSACS
2009
Springer
15 years 7 months ago
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Konstantinos Chatzikokolakis, Gethin Norman, David...
121
Voted
EUROPKI
2005
Springer
15 years 6 months ago
A Multipurpose Delegation Proxy for WWW Credentials
Credentials like passwords or cryptographic key pairs are a means to prove one’s identity to a web server. A practical problem in this context is the question of how a user can t...
Tobias Straub, Thilo-Alexander Ginkel, Johannes Bu...