Sciweavers

691 search results - page 110 / 139
» Automatically Proving Linearizability
Sort
View
IANDC
2007
151views more  IANDC 2007»
13 years 10 months ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke
NJC
2006
86views more  NJC 2006»
13 years 10 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
RAS
2006
86views more  RAS 2006»
13 years 10 months ago
Using cellular automata and gradients to control self-reconfiguration
Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected. Such a robot can, through this self-reconfiguration process, c...
Kasper Støy
TOPNOC
2008
13 years 10 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
JNCA
2007
75views more  JNCA 2007»
13 years 10 months ago
Stateful DDoS attacks and targeted filtering
The goal of a DDoS (distributed denial of service) attack is to completely tie up certain resources so that legitimate users are not able to access a service. It has long been an ...
Shigang Chen, Yong Tang, Wenliang Du