Sciweavers

2687 search results - page 279 / 538
» Formal Analysis of PKCS
Sort
View
JLP
2006
56views more  JLP 2006»
15 years 6 months ago
Linearization of hybrid processes
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
JAR
2007
72views more  JAR 2007»
15 years 6 months ago
Inferring Phylogenetic Trees Using Answer Set Programming
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to u...
Daniel R. Brooks, Esra Erdem, Selim T. Erdogan, Ja...
POPL
2011
ACM
14 years 9 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
SIGIR
2011
ACM
14 years 9 months ago
Find it if you can: a game for modeling different types of web search success using interaction data
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
Mikhail Ageev, Qi Guo, Dmitry Lagun, Eugene Agicht...
CSFW
2012
IEEE
13 years 9 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...