- S. Dolev
- Computer ScienceJournal of Aerospace Computing Information and…
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.
CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory
- S. Dolev, Danny Hendler, Adi Suissa
- Computer Science, BusinessACM SIGACT-SIGOPS Symposium on Principles of…
- 18 August 2008
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.
Self-stabilization of dynamic systems assuming only read/write atomicity
- S. Dolev, A. Israeli, S. Moran
- Computer ScienceACM SIGACT-SIGOPS Symposium on Principles of…
- 1 August 1990
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.
Self-Stabilizing Depth-First Search
Google Android: A Comprehensive Security Assessment
- A. Shabtai, Yuval Fledel, Uri Kanonov, Y. Elovici, S. Dolev, Chanan Glezer
- Computer ScienceIEEE Security and Privacy
- 1 March 2010
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 security…
Detecting unknown malicious code by applying classification techniques on OpCode patterns
- A. Shabtai, Robert Moskovitch, Clint Feher, S. Dolev, Y. Elovici
- Computer ScienceSecurity Informatics
- 27 February 2012
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.
Unknown Malcode Detection Using OPCODE Representation
- Robert Moskovitch, Clint Feher, Y. Elovici
- Computer ScienceEuropean Conference on Intelligence and Security…
- 3 December 2008
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.
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 been…
Self-stabilizing clock synchronization in the presence of Byzantine faults
A study of bounded clock synchronization under a more severe fault model than that proposed by Lamport and Melliar-Smith  is initiated, and two randomized self-stabilizing protocols for synchronizing bounded clocks in the presence of Byzantine processor failures are presented.
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.