Monday (Nov 21) Tuesday (Nov 22) Wednesday (Nov 23) Thursday (Nov 24)
08:30 – 09:00 Registration Registration Registration Registration
09:00 – 10:30 LADC papers S1 Keynote SBESC Tiago Matsuo Wafers S1 Wafers S2
10:30 – 11:00 Break Break Break Break
11:00 – 12:00 Student Forum Keynote Prof. Elias Procópio Keynote SBESC Prof. Joanna Olszewska Closing Ceremony
12:00 – 13:00 Lunch Lunch Lunch
13:00 – 15:00 Tutorial Prof. Achour Mostefaoui WSensing LADC papers S3
15:00 – 15:30 Break Break Break
15:30 – 16:30 Fast Abstract Track / Industrial Track Keynote SBESC Prof. M. Wolf Keynote SBESC Prof. Paulo Leitão
16:30 – 18:00 Keynote Prof. Achour Mostefaoui
(17:00 – 18:00)
LADC Papers S2 Meeting
18:00 – 18:30 Opening Ceremony
18:30 – 21:30 Cocktail Conference Dinner (19:30)
Monday (Nov 21)
09:00 – 10:30 Replication
Strengthening Atomic Multicast for Partitioned State Machine Replication
Leandro Pacheco, Fernando Dotti, Fernando Pedone
A Leaderless Hierarchical Atomic Broadcast Algorithm
Lucas Ruchel, Luiz Rodrigues, Rogério Turchetti, Luciana Arantes, Elias Duarte Jr., Edson Tavares de Camargo
11:00 – 12:00 Student Forum
Efficient CRDT Synchronization at Scale using a Causal Multicast over a Virtual Hypercube Overlay
Leonardo Freitas Galesky, Luiz Antonio Rodrigues
An Ontology for Context-aware Middleware for Dependable Medical Systems
Jorsiele Cerqueira
13:00 – 15:00 Tutorial
Agreement in Distributed Systems

In sequential computing, the notion of universality is represented by a Turing machine capable of mechanically computing anything that is computable. Read/write registers, the basic objects of a Turing machine, are thus universal objects in sequential computing. In the context of distributed systems, each process has only a partial knowledge of the many parameters involved in the problem to be solved. From an operational point of view this means that the processes of a distributed computation need to exchange information, and agree in some way or another, in order to cooperate to a common goal. We know, since 1985 and the famous FLP impossibility result, that the consensus problem has no deterministic solution in an asynchronous message-passing distributed system where even one process might fail by crashing (extended to shared-memory systems). This impossibility is not due to the computing power of the individual processes, but rather to the difficulty of coordination between the different processes that compose the distributed system. Coordination and agreement problems are thus at the heart of computability in distributed systems. Said another way, a central issue of distributed computing consists in coping with the uncertainty created by asynchrony and failures. The agreement power of objects is at the heart of computability in distributed systems. Consensus is proved universal in the sense that, any object having a sequential specification has a wait-free implementation using only read/write registers and consensus objects. Moreover, some special instructions, such as CAS, are universal as well. In message-passing systems, one needs to either assume strong timing properties or to design non-deterministic solutions.
Prof. Achour Mostefaoui
15:30 – 17:00 Fast Abstract Track / Industrial Track
On the use of the TMA Framework to promote self-adaptation capabilities in TalkConnect
José D’Abruzzo Pereira, João Davi Ribeiro, João Pires, Pedro Moita, Nuno Laranjeiro, Marco Vieira
Evaluation of Security Techniques in Heterogeneous IoT Devices
Eduardo Mosca, Silvio Ribeiro, Arthur Urbano, Daniel le S. Silva and Rafael L. R. Gomes
Searchable Symmetric Encryption for Private Data Protection in Cloud Environments
Matheus M. Silveira, Daniel le S. Silva, Sandra J. R. Rodriguez, Rafael L. R. Gomes
17:00 – 18:00 Keynote
Consistency in Distributed Systems

Distributed systems are often viewed as more difficult to program than sequential systems because they require to solve many issues related to communication. Shared objects, that can be accessed concurrently by the processes of the system, can be used as a practical abstraction of communication. The implementation of these objects are based on read/write registers and hardware instructions. Searching for correct and efficient implementations of usual objects (queues, stacks, etc.) is far from being trivial when the system is failure prone. Intuitively, a “good” implementation of a concurrent object has to satisfy two kinds of properties: a consistency condition and a progress condition. The consistency condition specifies the safety property that is the meaningfulness of the returned results, and the progress condition specifies the guarantees on the liveness. Linearizability and sequetial consistensy are strong consistency criteria. They ensures that all the operations in a distributed history appear as if they were executed sequentially: each operation appears at a single point in time. Such consistency criteria give the illusion to the processes to access a physically shared object. However, such implementations are often costly in shared memory systems, when not impossible to implement in message-passing systems where strong hypotheses must be respected. In order to gain in efficiency, researchers explored weak consistency criteria, especially for parallel machines in the nineties like PRAM and causal memory that are the best documented. PRAM ensures that each process individually sees a consistent local history, that respects the order in which the other processes performed their own writes on a register (small piece of memory). Eventual consistency ensures that all the processes will eventually reach a common state when they stop writing. Recently, we have seen a resurgence of interest for this topic due to the development of multicore processors, mobile applications (e.g. instant messaging) and cloud computing (large modern distributed systems such as Amazon’s cloud, data centers).
Prof. Achour Mostefaoui
Tuesday (Nov 22)
09:30 – 10:30 Keynote SBESC
Tiago Matsuo
11:00 – 12:00 Keynote
Prof. Elias Procópio
13:00 – 15:00 WSensing
Sk-Greedy: A Heuristic Scheduling Algorithm for Wireless Networks under the SINR Model
Vinicius Garcia, Fábio Engel, Elias P. Duarte Jr.
Combination of Models for Denial-Of-Service Classification over Different Networks
Leonardo Melo, Gustavo de Carvalho Bertoli, Osamu Saotome, Marcelo Domingues, Lourenço Pereira Jr.
VCBP: A Reliable and Real-Time Group Communication Protocol for Vehicular Ad Hoc Networks
Marcela Pereira, Alírio Sá
Cybersecurity: An Overview Focused on Mobile and Portable Networks

Abstract: Cyberattacks are constantly ravaging valuable data, wasting time and costly resources, and negatively affecting companies and institutions worldwide. Big, high-profile organizations have suffered the consequences of cyberattacks with a high impact on the organizations, their customers, collaborators, and society. WannaCry and other ransomware software are still a threat that affects computers, encrypts data, and demands ransom payments in cryptocurrency. Another example is sophisticated versions of Distributed Denial-of-Service attacks (DDoS attacks), launched from Internet-connected portable and mobile devices — such as IP cameras, residential gateways, and baby monitors, that cause major Internet platforms and services to be unavailable to many users around the world. These examples highlight the power and potential of cyberattacks potentialized by mobility, revealing a constant improvement and sophistication in attacking strategies. For sure, cybersecurity is not anymore what it used to be; we are in the era of ubiquitous systems, and we expect more than 75 billion devices or smart things to be connected by 2025. How is academia addressing the sophistication of cyberattacks? Can we anticipate the next moves of attackers to protect our information assets? How could academia benefit from the data generated in the network to create security intelligence and prevent attacks? This talk intends to elicit a discussion around these questions and present an overview of correlated research developed by Dr. Nogueira’s research team and future directions in these topics.
Michele Nogueira

Bio: Michele Nogueira is an Associate Professor in the Computer Science Department at the Federal University of Minas Gerais (UFMG), Brazil. She received her doctorate in Computer Science from the University Pierre et Marie Curie – Sorbonne Université, France. She was on sabbatical leave at Carnegie Mellon University, USA (2016-2017). Her research interests include wireless networks, security, and dependability. She has worked on providing resilience to self-organized, cognitive and wireless networks through adaptive and opportunistic approaches. Dr. Nogueira was one of the pioneers in addressing survivability issues in self-organized wireless networks; the work “A Survey of Survivability in Mobile Ad Hoc Networks” is one of her prominent scientific contributions. She has been a recipient of Academic Scholarships from the Brazilian Government in her undergraduate and graduate years; and of international grants such as the ACM SIGCOMM Geodiversity program. She has served as Associate Technical Editor for IEEE Communications Magazine. She serves as chair of the IEEE ComSoc Internet Technical Committee. She is an ACM and IEEE Senior Member.
15:30 – 16:30 Keynote SBESC
Prof. M. Wolf
16:30 – 18:00 Modeling and Analysis
Analysing and Modelling Inaccessibility in Dependable Real-Time Networks
Jeferson Souza, Frank Siqueira
Impact of failures in a MPSoC with shared coprocessors to extend the RISC-V ISA
Jorge Reis, Jarbas Silveira, César Marcon
Compliance Evaluation of Cryptographic Security Requirements on IoT Gateways
Eduardo Felix, Fernando Lins, Obionor Nóbrega, Diego Ribeiro Gomes, Bruno Jesus, Marco Vieira
NHAM: An NFV High Availability Architecture for Building Fault-Tolerant Stateful Virtual Functions and Services
Giovanni Venâncio, Elias Duarte Jr.
Wednesday (Nov 23)
09:00 – 10:30 Wafers S1
Modeling attacker behavior in Cyber-Physical-Systems
Samuel Rodriguez, Juan Betancourt Osorio, German Pardo Gonzalez, Daniel Cuellar, Camilo Gomez, Francesco Mariotti, Leonardo Montecchi, Paolo Lollini
Simplifying Operational Scenario Simulation for CubeSat Mission Analysis Purposes
Pedro Ângelo Vaz de Carvalho, Gustavo Vicari Duarte, Matheus Miranda, André Ivo, Fatima Mattiello-Francisco, Guilherme Venticinque
Application of Concurrent Engineering for G.O.L.D.S Constellation as a Cyber-Physical System-of-Systems
Moisés Souto, Lucas Silva, Andrea Zotovici, Fatima Mattiello-Francisco, Geilson Loureiro
11:00 – 12:00 Keynote SBESC
Prof. M. Joanna Oiszewska
13:00 – 15:00 Security
On the Use of Deep Graph CNN to Detect Vulnerable C Functions
José D’Abruzzo Pereira, Nuno Lourenço, Marco Vieira
A taxonomy on privacy and confidentiality
Benardi Nunes, Andrey Brito
Detecting DoS Attacks in Microservice Applications: Approach and Case Study
Jessica Castro, Nuno Laranjeiro, Marco Vieira
Do dependable systems need good user interfaces?
Andréia Casare, Celmar Guimarães da Silva, Regina Moraes
15:30 – 16:30 Keynote SBESC
Prof. Paulo Leitão
Thursday (Nov 24)
09:00 – 10:30 Wafers S2
Evaluation of SMT solvers in abstraction-based software model checking
Mihály Dobos-Kovács, András Vörös
Design of a Federated Learning System for IT Security: Towards Secure Human Resource Management
Lisa Verlande, Steffi Rudel, Ulrike Lechner