2016 12th European Dependable Computing Conference (EDCC)最新文献

筛选
英文 中文
Experimental Assessment of NoSQL Databases Dependability NoSQL数据库可靠性的实验评估
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.30
L. Ventura, Nuno Antunes
{"title":"Experimental Assessment of NoSQL Databases Dependability","authors":"L. Ventura, Nuno Antunes","doi":"10.1109/EDCC.2016.30","DOIUrl":"https://doi.org/10.1109/EDCC.2016.30","url":null,"abstract":"NoSQL databases are the response to the sheer volume of data being generated, stored, and analysed by modern users and applications. They are extremely scalable horizontally and store data with less rigid structures than the relational ones. NoSQL databases are known to compromise consistency in favour of availability, partition tolerance, and performance. Several studies evaluated the performance of these databases, but the users also need to understand how they behave in the presence of faults and quantify the impact of those faults. This paper presents an experimental evaluation of NoSQL databases' dependability using fault injection, which compares three widely used NoSQL engines based on how they perform in the presence of operator faults. The results show clearly that many times the integrity of the data is affected, even in the presence of simple faults. It is also shown how different databases handle the workloads and the faults differently, evidencing that users must carefully select the solution to use in their systems.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131195766","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}
引用次数: 5
Dwarf: Shortening Downtime of Reboot-Based Kernel Updates Dwarf:缩短基于重启的内核更新的停机时间
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.35
Ken Terada, H. Yamada
{"title":"Dwarf: Shortening Downtime of Reboot-Based Kernel Updates","authors":"Ken Terada, H. Yamada","doi":"10.1109/EDCC.2016.35","DOIUrl":"https://doi.org/10.1109/EDCC.2016.35","url":null,"abstract":"Kernel updates are a part of daily life in contemporary computer systems. They usually require an OS reboot that involves the restart of not only the kernel but also all of the running applications, causing downtime that can disrupt software services. This downtime issue has been tackled by numerous approaches. Although dynamic translation of the running kernel image, which is the representative approach, can conduct kernel updates at runtime, its applicable updates are inherently limited. This paper describes Dwarf, which shortens downtime during kernel updates and covers more types of updates. Dwarf is designed to reboot the kernel for its updates but make the downtime as short as possible, requiring no preparation of additional machines and shared disks. Dwarf launches the newer kernel in the background on the same physical machine and forces the kernel to inherit the running states of the older kernel. We implemented a prototype of Dwarf on Xen 4.5.0, Linux 4.1.6, and Linux 2.6.39. Also, we conducted experiments using realworld applications, such as MySQL and memcached, and the results demonstrate that Dwarf's downtime is up to 8× shorter than that of the normal OS reboot.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115021410","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}
引用次数: 4
Ultrafast Error Correction Codes for Double Error Detection/Correction 用于双重错误检测/纠正的超快纠错码
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.28
L. J. Saiz, P. Gil, J. Ruiz, J. Gracia, D. Gil, J. Baraza-Calvo
{"title":"Ultrafast Error Correction Codes for Double Error Detection/Correction","authors":"L. J. Saiz, P. Gil, J. Ruiz, J. Gracia, D. Gil, J. Baraza-Calvo","doi":"10.1109/EDCC.2016.28","DOIUrl":"https://doi.org/10.1109/EDCC.2016.28","url":null,"abstract":"Register protection against soft errors remains a major concern for deep sub-micron systems due to technology scaling. Error Correction Codes (ECCs) improve protection at the price of data redundancy. Reducing such redundancy is of upmost importance for memories, although it is less important in registers. A major requirement for register protection is to keep codes' encoding and decoding latencies as short as possible. Ultrafast Single Error Correction codes are an interesting option for this purpose. They allow very low encoding/decoding delays, but at the cost of a high redundancy. This paper proposes a new method to develop Ultrafast codes, adding new error coverages. Different Ultrafast codes have been designed, simulated and compared to other codes. Using Ultrafast codes, double error detection or, alternatively, double adjacent error correction can be achieved using 2-gate-delay encoding and 4-gate-delay decoding circuits. One of the major advantages of Ultrafast codes is that these delays do not depend on the register length.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128322103","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}
引用次数: 8
Virtual Worlds for Testing Robot Navigation: A Study on the Difficulty Level 机器人导航测试的虚拟世界:难度等级研究
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.14
Thierry Sotiropoulos, Jérémie Guiochet, F. Ingrand, H. Waeselynck
{"title":"Virtual Worlds for Testing Robot Navigation: A Study on the Difficulty Level","authors":"Thierry Sotiropoulos, Jérémie Guiochet, F. Ingrand, H. Waeselynck","doi":"10.1109/EDCC.2016.14","DOIUrl":"https://doi.org/10.1109/EDCC.2016.14","url":null,"abstract":"The ability to navigate in diverse and previously unknown environments is a critical service of autonomous robots. We propose a test framework based on MORSE (Modular Open Robots Simulation Engine), and using the generation of virtual 3D worlds to challenge the navigation service. We elaborate on the notion of the difficulty of the generated worlds, which we characterize in terms of mission achievement, mission duration and trajectory curves. We experimentally study our ability to control the difficulty level by means of the generation parameters. We also assess the indeterminism of the navigation and how it evolves depending on the difficulty level. The experimental outcomes provide insights toward the definition of test strategies to further stress the navigation service.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126217","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}
引用次数: 17
A System-Level Architecture for Fine-Grained Privacy Control in Location-Based Services 基于位置服务的细粒度隐私控制的系统级体系结构
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.24
A. Moro, B. Garbinato
{"title":"A System-Level Architecture for Fine-Grained Privacy Control in Location-Based Services","authors":"A. Moro, B. Garbinato","doi":"10.1109/EDCC.2016.24","DOIUrl":"https://doi.org/10.1109/EDCC.2016.24","url":null,"abstract":"We introduce a system-level architecture providing fine-grained control over user privacy, in the context of location-based services accessed via mobile devices. In contrast with most mobile platforms today, users only have coarse-grained control over their privacy, either accepting to unconditionally stream their locations in order to use a service, or renouncing the service altogether. However, not all location-based services do require the same level of location accuracy and the same level of privacy renouncement. With this architecture, the user can adapt the tradeoff between location privacy and location accuracy. To achieve this, our architecture relies on three main elements: a trusted module extending the underlying mobile platform, a secure protocol between that module and untrusted applications offering location-based services, and a tree capturing user's zones of interest and organizing them in various accuracy levels. Untrusted mobile applications no longer receive user locations directly: the trusted module intercepts them to compute user's zones of interest and create the tree. The user can then decide what level of accuracy will be disclosed to what application. We evaluate this architecture from a privacy preserving point of view by comparing well-known blurring mechanisms and our tree.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128031924","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}
引用次数: 2
Multidimensional Log Analysis 多维日志分析
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.18
M. Kubacki, J. Sosnowski
{"title":"Multidimensional Log Analysis","authors":"M. Kubacki, J. Sosnowski","doi":"10.1109/EDCC.2016.18","DOIUrl":"https://doi.org/10.1109/EDCC.2016.18","url":null,"abstract":"Various event and performance logs are available in computer systems. They are considered as useful data source characterizing system operational profiles and possible anomalies. In the literature different classes of logs are usually analyzed separately and targeted at some specific problems. We have developed analysis schemes and tools which facilitate studying these logs in a holistic way taking into account various observation perspectives and cross relations as well as different analysis goals. This approach has been verified for some computer systems of the University and industry.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123256286","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}
引用次数: 9
Coverage Metrics and Detection of Injection Vulnerabilities: An Experimental Study 覆盖度量和注入漏洞检测:一项实验研究
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.32
Ana Paula Sayuri Matsunaga, Nuno Antunes, Regina L. O. Moraes
{"title":"Coverage Metrics and Detection of Injection Vulnerabilities: An Experimental Study","authors":"Ana Paula Sayuri Matsunaga, Nuno Antunes, Regina L. O. Moraes","doi":"10.1109/EDCC.2016.32","DOIUrl":"https://doi.org/10.1109/EDCC.2016.32","url":null,"abstract":"Coverage is frequently considered a metric of the quality of the tests and, consequently, of the software dependability. Although one tends to assume a similar relation in the context of vulnerability detection, such assumption is yet to be shown in practice. Although the effectiveness of vulnerability detection tools is limited and largely dependent on the context, developers usually select and use a single tool and implicitly trust on its results. In this practical experience report we study the relation between coverage measurements and the quality of the results of detection tests for injection vulnerabilities, in particular SQL Injection, considering two state of the art tools and multiple testing configurations. Such relation is of utmost importance for developers to understand how good vulnerability detectors are and to compare alternative tools. Results show that code coverage is indeed an effective mean to estimate the quality of vulnerability detection tests and is useful to compare different sets of tests. However, they also show that domain specific metrics are much more effective than generic ones.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125366638","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}
引用次数: 1
Finding Resilience-Friendly Compiler Optimizations Using Meta-Heuristic Search Techniques 使用元启发式搜索技术寻找弹性友好的编译器优化
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.26
Nithya Narayanamurthy, K. Pattabiraman, M. Ripeanu
{"title":"Finding Resilience-Friendly Compiler Optimizations Using Meta-Heuristic Search Techniques","authors":"Nithya Narayanamurthy, K. Pattabiraman, M. Ripeanu","doi":"10.1109/EDCC.2016.26","DOIUrl":"https://doi.org/10.1109/EDCC.2016.26","url":null,"abstract":"With the projected future increase in hardware error rates, application software needs to be resilient to hardware faults. An important factor affecting an application's error resilience and vulnerability is the set of optimizations used when compiling it. We propose an automated technique based on genetic algorithms to find the application-specific set of compiler optimizations that can boost performance without degrading the application's error resilience. We find that the resulting optimized code has significantly better error resilience than when being compiled with the standard optimization levels (i.e., O1, O2, O3), while attaining comparable performance improvements, thus leading to lower overall vulnerabilities.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"9 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117285860","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}
引用次数: 21
Prediction of the Testing Effort for the Safety Certification of Open-Source Software: A Case Study on a Real-Time Operating System 开源软件安全认证测试工作量预测——以实时操作系统为例
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.22
Domenico Cotroneo, Domenico Di Leo, R. Natella, R. Pietrantuono
{"title":"Prediction of the Testing Effort for the Safety Certification of Open-Source Software: A Case Study on a Real-Time Operating System","authors":"Domenico Cotroneo, Domenico Di Leo, R. Natella, R. Pietrantuono","doi":"10.1109/EDCC.2016.22","DOIUrl":"https://doi.org/10.1109/EDCC.2016.22","url":null,"abstract":"The reuse of Open Source Software (OSS) for safety-critical systems is seen with interest by industries, such as automotive, medical, and aerospace, as it enables shorter time-to-market and lower development costs. However, safety certification demands to supply evidence about OSS quality, and a gap analysis is needed to assess if the cost to produce certification evidence is worthwhile. This paper presents an empirical study on an open-source RTOS (RTEMS). The study investigates the relationship between software complexity and the effort to achieve a high test coverage, which is one of the most impacting activity for certification. The objective is to figure out if, and to what extent, it is possible to predict such effort preventively, by looking at software complexity metrics. This would enable a preliminary screening and benchmarking of OSS items, supporting strategic decision making. The study shows that combining metrics with classifiers can achieve a good prediction accuracy.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126228508","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}
引用次数: 7
Adaptive Deployment Infrastructure for Android Applications Android应用程序的自适应部署基础设施
2016 12th European Dependable Computing Conference (EDCC) Pub Date : 2016-09-01 DOI: 10.1109/EDCC.2016.25
Junior Cupe Casquina, J. D. A. S. Eleutério, C. M. F. Rubira
{"title":"Adaptive Deployment Infrastructure for Android Applications","authors":"Junior Cupe Casquina, J. D. A. S. Eleutério, C. M. F. Rubira","doi":"10.1109/EDCC.2016.25","DOIUrl":"https://doi.org/10.1109/EDCC.2016.25","url":null,"abstract":"Due to the popularization of mobile devices, the number of mobile applications has increased in recent years. Mobile devices are constantly evolving on computing capabilities, requiring the ability of mobile applications to deal with variations in services availability and computing resources. However, most of these applications are deployed using static configurations, making difficult to tolerate failures during their execution. In this context, we propose an adaptive deployment infrastructure to deal with this problem. Our solution proposes an autonomic loop that manages the current configuration model of a service application using dynamic feature model associated with the deployed architectural model. During runtime, according to the dynamic feature selection, the deployed architectural model can be modified in order to provide a new deployment solution. A mobile application was implemented using our solution, and after changes in services availability, it proved to be able to tolerate failures by dynamically changing its deployed configuration.","PeriodicalId":166039,"journal":{"name":"2016 12th European Dependable Computing Conference (EDCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131456454","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}
引用次数: 10
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信