{"title":"FaultFlow: a tool supporting an MDE approach for Timed Failure Logic Analysis","authors":"Jacopo Parri, Samuele Sampietro, E. Vicario","doi":"10.1109/EDCC53658.2021.00011","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00011","url":null,"abstract":"In the application of software intensive systems to business-critical processes, tool-supported connection between the perspectives of Software Engineering and Reliability Engineering may largely help conciliation of the contrasting needs of reliability and complexity. In this paper, we present FaultFlow, a newborn tool enabling a Model-Driven Engineering approach for supporting specification, analysis, and simulation of failure logic in component-based systems. The tool exploits a meta-model combining the representation of system configuration hierarchies together with a decoupled representation of its stochastically-timed failure logic. FaultFlow is available in a as-a-service mode through a Web Application deployed on the cloud as well as in a standalone mode, featuring a well-crafted Java API enabling effective specification of the system hierarchy as well as of intra-component fault-to-failure and inter-component failure-to-fault propagation models, respectively starting from SysML Block Definition Diagrams and stochastic Fault Trees representations. The automated transformation towards Stochastic Time Petri Nets enables integration with external reliability tools for quantitative evaluation through numerical solution or simulation. We illustrate FaultFlow key benefits by experimenting the approach on a case study contextualised in an Internet of Things scenario modelling a Pollution Monitor System within a Smart City.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116664470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Simona Bernardi, Raúl Javierre, J. Merseguer, J. I. Requeno
{"title":"Detectors of Smart Grid Integrity Attacks: an Experimental Assessment","authors":"Simona Bernardi, Raúl Javierre, J. Merseguer, J. I. Requeno","doi":"10.1109/EDCC53658.2021.00018","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00018","url":null,"abstract":"Today cyber-attacks to critical infrastructures can perform outages, economical loss, physical damage to people and the environment, among many others. In particular, the smart grid is one of the main targets. In this paper, we develop and evaluate software detectors for integrity attacks to smart meter readings. The detectors rely upon different techniques and models, such as autoregressive models, clustering, and neural networks. Our evaluation considers different “attack scenarios”, then resembling the plethora of attacks found in last years. Starting from previous works in the literature, we carry out a detailed experimentation and analysis, so to identify which “detectors” best fit for each “attack scenario”. Our results contradict some findings of previous works and also offer a light for choosing the techniques that can address best the attacks to smart meters.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121230740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Empirical Study On Software Metrics and Machine Learning to Identify Untrustworthy Code","authors":"N. Medeiros, N. Ivaki, Pedro Costa, M. Vieira","doi":"10.1109/EDCC53658.2021.00020","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00020","url":null,"abstract":"The increasingly intensive use of software systems in diverse sectors, especially in business, government, healthcare, and critical infrastructures, makes it essential to deliver code that is secure. In this work, we present two sets of experiments aiming at helping developers to improve software security from the early development stages. The first experiment is focused on using software metrics to build prediction models to distinguish vulnerable from non-vulnerable code. The second experiment studies the hypothesis of developing a consensus-based decision-making approach on top of several machine learning-based prediction models, trained using software metrics data to categorize code units with respect to their security. Such categories suggest a priority (ranking) of software code units based on the potential existence of security vulnerabilities. Results show that software metrics do not constitute sufficient evidence of security issues and cannot effectively be used to build a prediction model to distinguish vulnerable from non-vulnerable code. However, with a consensus-based decision-making approach, it is possible to classify code units from a security perspective, which allows developers to decide (considering the criticality of the system under development and the available resources) which parts of the software should be the focal point for the detection and removal of security vulnerabilities.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129531133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Run-time Monitoring and Control for Temporal Fault Prevention in Mixed-criticality Systems","authors":"Daniel Loche, Aléxis Génèrès, M. Lauer, J. Fabre","doi":"10.1109/EDCC53658.2021.00015","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00015","url":null,"abstract":"Multicore parallelism involve inter-tasks interferences leading to execution timing uncertainties. This is important for safety concerns in industrial applications (automotive for instance). Existing solutions limit significantly the use of available computing resources for low-criticality tasks to keep strong timing guarantees on high-criticality tasks. We propose a run-time monitoring and control approach for mixed-criticality systems to prevent temporal faults. Its objective is to guarantee a high-criticality function end-to-end deadline, even when interfered by low-criticality tasks parallel execution. Such approach aims at allowing better computing resource use with an additional guarantee for a given task chain end-to-end response time. We also propose an experimental protocol to characterise this task chain and calibrate the mechanism. Our approach has been implemented on a Linux-based experimental platform.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122245157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SUFI: A Simulation-based Fault Injection Tool for Safety Evaluation of Advanced Driver Assistance Systems Modelled in SUMO","authors":"Mehdi Maleki, B. Sangchoolie","doi":"10.1109/EDCC53658.2021.00014","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00014","url":null,"abstract":"Embedded electronic systems used in vehicles are becoming more exposed and thus vulnerable to different types of faults and cybersecurity attacks. Examples of these systems are advanced driver assistance systems (ADAS) used in vehicles with different levels of automation. Failures in these systems could have severe consequences, such as loss of lives and environmental damages. Therefore, these systems should be thoroughly evaluated during different stages of product development. An effective way of evaluating these systems is through the injection of faults and monitoring their impacts on these systems. In this paper, we present SUFI, a simulation-based fault injector that is capable of injecting faults into ADAS features simulated in SUMO (simulation of urban mobility) and analyse the impact of the injected faults on the entire traffic. Simulation-based fault injection is usually used at early stages of product development, especially when the target hardware is not yet available. Using SUFI we target car-following and lane-changing features of ADAS modelled in SUMO. The results of the fault injection experiments show the effectiveness of SUFI in revealing the weaknesses of these models when targeted by faults and attacks.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120961133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ATOCS: Automatic Configuration of Encryption Schemes for Secure NoSQL Databases","authors":"David Ferreira, J. Paulo, M. Matos","doi":"10.1109/EDCC53658.2021.00017","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00017","url":null,"abstract":"Secure databases have emerged to securely store and process sensitive data at untrusted infrastructures (e.g., Cloud Computing). To be secure and efficient, the encryption schemes used by these systems must be carefully chosen. Indeed, this task requires expertise both in databases and security, and is currently being done manually, which is time-consuming and error-prone and can lead to security violations, poor performance, or both. This paper presents ATOCS, a novel framework that analyses the applications' code and, from the inferred requirements, determines the best combination of encryption schemes and related configurations for the underlying secure NoSQL database. Its design is modular and extensible thus facilitating the support of different applications and database solutions. Our evaluation with real-world applications shows that ATOCS is fast (it takes 44 seconds to analyse more than 12K LoC), accurate, and simplifies the configuration of secure databases.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114701234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tensor-based reliability analysis of complex static fault trees: Regular paper","authors":"D. Szekeres, Kristóf Marussy, I. Majzik","doi":"10.1109/EDCC53658.2021.00012","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00012","url":null,"abstract":"Fault Tree Analysis is widely used in the reliability evaluation of critical systems, such as railway and automotive systems, power grids, and nuclear power plants. While there are efficient algorithms for calculating the probability of failure in static fault trees, Mean Time to First Failure (MTFF) evaluation remains challenging due to state space explosion. Recently, structural and symmetry reduction methods were proposed to counteract this phenomenon. However, systems with a large number of different and highly interconnected components preclude the use of reduction techniques. Their MTFF analysis requires the solution of a system of linear equations whose size is exponential in the number of components in the system. In this paper, we propose a solution leveraging Tensor Trains as a compressed vector and matrix representation. We build upon Binary Decision Diagram-based techniques to avoid explicit state space enumeration and use linear equation solvers developed specifically for Tensor Trains to efficiently solve the arising linear systems. As a result, our novel approach complements the existing reduction-based techniques and makes some previously intractable models possible to analyze. We evaluate our approach on an industrial case study adapted from a railway system, and other openly available benchmark models.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128912197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Why is it so hard to predict computer systems failures?","authors":"Jomar Domingos, R. Barbosa, H. Madeira","doi":"10.1109/EDCC53658.2021.00013","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00013","url":null,"abstract":"Proactive fault management represents a promising path that could significantly enhance computer systems dependability, allowing to deal with failures before their occurrence. Online failure prediction plays a very important role in proactive fault management schema, being the first stage of the process. However, in spite of decades of research on the topic, and the very high relevance of failure prediction, the reality is that we still do not have readily available failure prediction methods and guidelines. This paper presents a reflection on the most relevant challenges faced by failure prediction in computer systems and discusses why it has been so difficult to develop effective methods and tools that can be relied upon to predict failures in real computer systems. Along with the discussion of the technical challenges, the paper identifies promising research paths relying on interdisciplinary approaches combining classic dependability and system monitoring techniques with advanced machine learning that can predict failures but, importantly, also provide an explanation why a failure is imminent.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130548614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Practical Self-Stabilizing Leader Election for Networks of Resource-Constrained IoT Devices","authors":"Michael J. Conard, Ali Ebnenasir","doi":"10.1109/EDCC53658.2021.00025","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00025","url":null,"abstract":"This paper presents a self-stabilizing and tunable leader election algorithm, called PraSLE, designed for real-world testbeds of resource-constrained devices in the Internet of Things (IoT). PraSLE is an extended version of the minimum finding algorithm that functions in a round-based asynchronous fashion. We provide a version of PraSLE for both reliable and unreliable networks. We show that PraSLE elects a unique leader in unreliable networks with probability 1. We also experimentally validate this result and demonstrate that PraSLE outperforms existing methods in terms of average convergence time for ring, line, and mesh topologies up to 40 nodes, and for the clique topology up to 80 nodes. The tunable nature of PraSLE enables engineers to optimize average convergence time, as well as communication and energy costs. PraSLE provides an important resource-efficient Distributed Computing Primitive (DCP) for unreliable networks of low-end IoT devices based on which other DCPs (e.g., Paxos) can be developed for such networks in the domains of IoT and Cyber Physical Systems (CPS).","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125393830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Preventing timing failures in mixed-criticality clouds with dynamic real-time containers","authors":"M. Cinque, Raffaele Della Corte, Roberto Ruggiero","doi":"10.1109/EDCC53658.2021.00010","DOIUrl":"https://doi.org/10.1109/EDCC53658.2021.00010","url":null,"abstract":"Real-time containers can be seen as the convergence of hard real-time operating systems and container-based virtualization technologies that can be used to build mixed-criticality cloud systems. In this paper we investigate the implementation of this concept based on earliest deadline first and server-based scheduling on a Linux kernel with the RTAI real-time patch. With respect to earlier proposals, our solution allows more flexibility with simplified admission checks and better utilization of CPU resources. We compare the solution with the SCHED DEADLINE scheduling class, already available in the Linux kernel, and we show, with experiments on real hardware, that the proposal allows to prevent timing failures to tasks running within real-time containers, despite the presence of disturbances.","PeriodicalId":408271,"journal":{"name":"2021 17th European Dependable Computing Conference (EDCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}