Martin Hoffmann, Christian J. Dietrich, D. Lohmann
{"title":"dOSEK: A Dependable RTOS for Automotive Applications","authors":"Martin Hoffmann, Christian J. Dietrich, D. Lohmann","doi":"10.1109/PRDC.2013.22","DOIUrl":"https://doi.org/10.1109/PRDC.2013.22","url":null,"abstract":"Recent automotive systems exhibit an increased susceptibility against transient hardware faults. As a consequence, dependability measures are mandatory to provide appropriate fault detection or masking properties fulfilling the required safety standards. On the other and, production costs are still a crucial factor in this domain, which leads to hardware consolidation and therefore mixed-criticality systems. An existing dependability approach, supporting such systems, combines triple modular redundancy with encoded operations, but still leaves the operating system as single point of failure. We intend to close this gap by extending the encoded operations throughout the kernel execution, and additionally integrate the analyzed system behavior into the code.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123553520","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":"Dragonfruit: Cloud Provider-Agnostic Trustworthy Cloud Data Storage and Remote Processing","authors":"Eric Rozier, S. Zonouz, David Redberg","doi":"10.1109/PRDC.2013.36","DOIUrl":"https://doi.org/10.1109/PRDC.2013.36","url":null,"abstract":"Trustworthy cloud services require practical secure storage and data processing techniques that enable end-users to upload sensitive data and perform computations remotely without having to first download the data. In this paper, we present Dragon fruit, a cloud provider-agnostic searchable cloud data storage solution, that allows the utilization of several existing cloud providers, and the execution of search queries over encrypted data by customers, using unmodified cloud infrastructures. In particular, Dragon fruit makes use of filename search capabilities that most existing cloud providers support to embed searchable data within the cloud. Dragon fruit supports queries using complex Boolean expressions on structured data formats such as JSON. Our evaluation on a real-world test-bed show that Dragon fruit is able to work with several cloud providers such as Google-Drive and Drop box simultaneously and is able to respond to search requests within a few seconds proving a reasonable performance overhead for practical usage.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129086196","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}
Fedor V. Yarochkin, Yennun Huang, Yung-Li Hu, S. Kuo
{"title":"Mining Large Network Reconnaissance Data","authors":"Fedor V. Yarochkin, Yennun Huang, Yung-Li Hu, S. Kuo","doi":"10.1109/PRDC.2013.38","DOIUrl":"https://doi.org/10.1109/PRDC.2013.38","url":null,"abstract":"This paper examines techniques for a large network infrastructure reconnaissance and dives into a real-world case study of a nation-wide passive network vulnerability assessment. The main goal of this study is to understand methods of a large network risk evaluation and conduct practical experiments using a national network. The main contribution of this paper is a non-intrusive method of a large network infrastructure reconnaissance and an application of acquired data to measure network vulnerability exposures within the analysed network. In this study our assumption is based on an estimation that actual threats come from the actively exploited vulnerabilities. Information on exploit-targeted platforms and vulnerabilities could be easily collected from a large set of malicious websites and automatically turned into signatures. We propose an automated method of building such signatures and use those to analyse the reconnaissance data set to identify ranges of vulnerable systems.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115660483","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}
K. Seetharam, Lance Ong-Siong Co Ting Keh, Ralph Nathan, Daniel J. Sorin
{"title":"Applying Reduced Precision Arithmetic to Detect Errors in Floating Point Multiplication","authors":"K. Seetharam, Lance Ong-Siong Co Ting Keh, Ralph Nathan, Daniel J. Sorin","doi":"10.1109/PRDC.2013.44","DOIUrl":"https://doi.org/10.1109/PRDC.2013.44","url":null,"abstract":"Prior work developed an efficient technique, called reduced precision checking, for detecting errors in floating point addition. In this work, we extend reduced precision checking (RPC) to multiplication. Our results show that RPC can successfully detect errors in floating point multiplication at relatively low cost.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114470992","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":"Derivation of Stochastic Reward Net for Compatibility and Conformance Verification of Component Erroneous Behavior Model","authors":"N. Alzahrani, D. Petriu","doi":"10.1109/PRDC.2013.33","DOIUrl":"https://doi.org/10.1109/PRDC.2013.33","url":null,"abstract":"The compatibility verification between interacting components and the conformance verification of their internal behavior with the corresponding ports protocol behavior are important steps for the early identification of unexpected messages between components. The behavior models used for verification include erroneous behavior along with normal behavior, in order to ensure greater accuracy in reliability and availability analysis. We use our Component Erroneous Behavior Aspect Modeling (CeBAM) approach introduced in previous work, which applies aspect-oriented modeling for adding erroneous behavior to UML state machines representing normal behavior. In this paper we present transformation rules for deriving Stochastic Reward Net (SRN) from CeBAM representations. The first step is to generate SRN for individual component behavior in order to check the conformance between component internal behavior and their ports protocol behavior. Subsequently, we compose the generated SRNs models of the connected components to verify their compatibility. We show how to identify conformance and compatibility issues during the construction and composition of components SRN model by analyzing SRN properties (e.g., deadlocks). We illustrate the proposed verification approach through a case study modeled according to CeBAM.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114567126","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":"On the Error Resiliency of Combinational Logic Cells - Implications for Nano-based Digital Design","authors":"P. Balasubramanian, S. Yamashita","doi":"10.1109/PRDC.2013.21","DOIUrl":"https://doi.org/10.1109/PRDC.2013.21","url":null,"abstract":"With continuous decrease of device geometries in the nanoscale era of digital design, increasing importance is given to the reliability aspect of basic building blocks. In this context, this brief discusses the inherent fault tolerance capability of conventional logic gates before proceeding with the analysis of error immune property of a subset of combinational standard cells present in commercial digital libraries. The analysis has led to the following inferences: (i) Compared to complex-gate implementation, discrete-gate based realization of compound logic functions enables a mean improvement in the error resiliency metric by 68.2%, and (ii) the associated increase in area overhead for discrete-gate realizations as a trade-off for enhanced fault tolerance over complex gate implementations is found to be 51.6% on average.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115809124","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":"FuzzTrees - Failure Analysis with Uncertainties","authors":"Peter Tröger, Franz Becker, Felix Salfner","doi":"10.1109/PRDC.2013.48","DOIUrl":"https://doi.org/10.1109/PRDC.2013.48","url":null,"abstract":"Dependability modeling is a widely established method for analyzing the reliability of complex systems. Nearly all approaches focus on the representation - in success or failure space - of one specific system configuration. This does not reflect the high configurability of systems being common today. Furthermore, in order to perform a quantitative analysis of a model, the reliability engineer also needs to add exact event probabilities that can often only be estimated. Both things together lead to a situation where the final model may persuade the reader of an exactness that does not correspond with reality. We present an extended version of fault trees called Fuzz Trees. They combine fuzzy numbers for event probabilities with the modeling of system variability by new graphical notations. The concept allows the engineer to make uncertainty an explicit part of the dependability model, and to evaluate design alternatives early in the development. We discuss an initial analysis algorithm that allows the comparison of failure probabilities and costs for all possible system configurations being modeled by such a tree.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126469365","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":"Reducing Communication Delay by Finding Sink Location in Low-Duty-Cycle Wireless Sensor Networks","authors":"Yu-Yuan Lin, K. Ssu, Hau-Yu Chiang, Chun-Hao Yang","doi":"10.1109/PRDC.2013.30","DOIUrl":"https://doi.org/10.1109/PRDC.2013.30","url":null,"abstract":"Low-duty-cycle mechanisms can reduce the energy consumption in wireless sensor networks. Many related researches have been made in recent years. In the low-duty-cycle environment, the latency of sending packets from a sink to each node is much longer than traditional WSNs because nodes stay asleep most of the time. In this paper, the Centralized Cluster-based Location Finding (CCLF) algorithm is proposed to reduce the high latency in low-duty-cycle WSNs by finding a suitable position for the sink. The algorithm mainly consisted of three steps: (1) Cluster construction, (2) The fast look-up table (FLU-table) construction, and (3) Sink location decision. The simulation results show that the performance of the CCLF algorithm approaches the performance of the optimal algorithm. Moreover, the CCLF algorithm requires less operation time compared with the optimal algorithm.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132208618","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":"Classification of DNS Queries for Anomaly Detection","authors":"Hongbo Shi, K. Iwasaki","doi":"10.1109/PRDC.2013.27","DOIUrl":"https://doi.org/10.1109/PRDC.2013.27","url":null,"abstract":"We propose a new method that uses a neural network, the Growing Hierarchical Self-Organizing Map (GHSOM), to analyze the DNS query log files. Due to the structure of the DNS query frequency, infected computers are easy to detect. Our experiment shows the different DNS query structure between healthy and infected computers.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125447391","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}
Sonia Meskini, A. B. Nassif, Luiz Fernando Capretz
{"title":"Reliability Prediction of Smartphone Applications through Failure Data Analysis","authors":"Sonia Meskini, A. B. Nassif, Luiz Fernando Capretz","doi":"10.1109/PRDC.2013.24","DOIUrl":"https://doi.org/10.1109/PRDC.2013.24","url":null,"abstract":"Smart phones have become the most used electronic devices. They carry out most of the functionalities of desktops, offering various useful applications that suit the user's needs. Therefore, instead of being an operator, the user has become the main controller of the device and its applications. Therefore, its reliability becomes an emergent requirement. In this paper, we shortly highlight the shortcomings of Software Reliability Growth Models (SRGMs) when applied to Smartphone applications and suggest future directions for reliability prediction in the mobile area.","PeriodicalId":187326,"journal":{"name":"2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130058843","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}