• Publications
  • Influence
Self Stabilization
  • S. Dolev
  • Computer Science
  • J. Aerosp. Comput. Inf. Commun.
  • 2004
A formal impossibility proof shows that, in order to ensure the correct behavior of the system, less than one-third of the processors may be of the Byzantine type; that is, to design the system as if there were no (yesterday) past history—a system that can be started in any possible state of its state space. Expand
Self-stabilization of dynamic systems assuming only read/write atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented, one of which is a mutual-exclusion prootocol for tree structured systems and the other two are a spanning tree protocol for systems with any connected communication graph. Expand
CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory
CAR-STM, a scheduling-based mechanism for STM Collision Avoidance and Resolution, is presented and incorporated into the University of Rochester's STM (RSTM) and the performance of the new implementation with that of the original RSTM by using STMBench7. Expand
Self-Stabilizing Depth-First Search
A distributed self-stabilizing Depth-First Search (DFS) spanning tree algorithm, whose output is a DFS spanning tree of the communication graph, kept in a distributed fashion. Expand
Google Android: A Comprehensive Security Assessment
This research provides a security assessment of the Android framework-Google's software stack for mobile devices. The authors identify high-risk threats to the framework and suggest several securityExpand
Detecting unknown malicious code by applying classification techniques on OpCode patterns
The imbalance problem is investigated, referring to several real-life scenarios in which malicious files are expected to be about 10% of the total inspected files, and a chronological evaluation showed a clear trend in which the performance improves as the training set is more updated. Expand
Unknown Malcode Detection Using OPCODE Representation
This work presents a full methodology for the detection of unknown malicious code, based on text categorization concepts, and indicates that greater than 99% accuracy can be achieved through the use of a training set that has a malicious file percentage lower than 15%, which is higher than in the previous experience with byte sequence n-gram representation. Expand
SuperStabilizing protocols for dynamic distributed systems
Two aspects of distributed-protocol reliability are the ability to recover from transient faults and the ability to function in a dynamic environment. Approaches for both of these aspects have beenExpand
Routing betweenness centrality
The Routing Betweenness Centrality (RBC) measure is defined that generalizes previously well known Betweenness measures such as the Shortest Path betweenness, Flow Betweenness, and Traffic Load Centrality by considering network flows created by arbitrary loop-free routing strategies. Expand
Buses for Anonymous Message Delivery
This work develops a novel approach to hide the senders and the receivers of messages by developing protocols based on cluster partition of the network, which only require the processors in the communication network to be busy periodically. Expand