Formal methods are considered to be highly expensive. Therefore, they are currently applied almost only in high risk software development. In this paper, we show that formal techniques can be also efficiently used in standard large-scale applications. We focus on the generation of specifications which state the termination condition of for loops in Java code (expressed as so called Java Modelin...

In this paper we give necessary design principles to be used, when constructing secure Feistel ciphers. We introduce a new concept, practical security against linear and di erential attacks on Feistel ciphers. We give examples of such Feistel ciphers (practically) resistant to di erential attacks, linear attacks and other attacks.

This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures graphs. We present a novel parallel algorithm that is efficient both theory and practice. Our achieves work complexity matching best sequential while also having low depth (parallel running time), significantly improves upon only existing (Sariyüce et al. , PVLDB 2018). The key...

With the emergence of technologies designed to support social activities online, it is beneficial to explore their potential in novel application areas. These studies, in the research tradition of Bowers et al. (1996), can be used to evaluate and develop technologies while providing the opportunity to study the social practices that develop around their use. We examine the use of online seminar...

Virtual synchrony is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is a key criterion for the success of such implementations. This is because large distributed systems can be highly available as long as they do not depend on the full operational status of every syste...

A self-stabilizing simulation of a single-writer multi-reader atomic register is presented. The simulation works in asynchronous message-passing systems, and allows processes to crash, as long as at least a majority of them remain working. A key element in the simulation is a new combinatorial construction of a bounded labeling scheme that can accommodate arbitrary labels, i.e., including those...