MDS '13Pub Date : 2013-12-09DOI: 10.1145/2541534.2541594
Yepang Liu, Chang Xu
{"title":"VeriDroid: automating Android application verification","authors":"Yepang Liu, Chang Xu","doi":"10.1145/2541534.2541594","DOIUrl":"https://doi.org/10.1145/2541534.2541594","url":null,"abstract":"Smartphone applications' quality is vital. Many smartphone applications, however, suffer from various defects. One major reason is that developers lack viable techniques to expose potential defects in their applications. This paper presents a tool VeriDroid to help automatically verify Android applications. We built VeriDroid by extending Java PathFinder (JPF), a widely-used verification framework for general Java programs. Our extension addresses two technical challenges. First, Android applications are event-driven and lack explicit calling relationships between event handlers for verification. Second, Android applications closely hinge on different framework libraries, whose implementations are platform-dependent. To address these challenges, we derive event handler scheduling policies from Android documentations, and encode them to guide JPF to realistically execute Android applications. Besides, we model side effects for a critical set of Android APIs such that one can conduct verification precisely. By doing so, our VeriDroid can verify Android applications in a fully automated manner. We implemented a prototype checker on VeriDroid and applied it to detect null-pointer dereference and resource leak defects in Android applications. Our experiments with five large-scale and popularly-downloaded subjects showed that VeriDroid can effectively detect real defects and provide actionable information to facilitate program debugging.","PeriodicalId":318237,"journal":{"name":"MDS '13","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114949647","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}
MDS '13Pub Date : 2013-12-09DOI: 10.1145/2541534.2541592
Bingfeng Xu, Zhiqiu Huang, Jun Hu, Ou Wei, Yu Zhou
{"title":"Minimal cut sequence generation for state/event fault trees","authors":"Bingfeng Xu, Zhiqiu Huang, Jun Hu, Ou Wei, Yu Zhou","doi":"10.1145/2541534.2541592","DOIUrl":"https://doi.org/10.1145/2541534.2541592","url":null,"abstract":"State/Event Fault Trees (SEFTs) have been developed to conduct safety modeling and assessment for safety critical systems. The purpose of minimal cut sequence analyses performed on this kind of model consists in computing the minimal scenarios that lead to system failures. As SEFTs do not provide a well-defined semantics that is essential for minimal cut sequence analysis, this paper proposes a minimal cut sequence analysis method for SEFTs based on interface automata. Firstly, in order to describe triggers and guards of SEFTs simultaneously, guarded interface automaton is proposed by adding guards on the transitions of interface automaton. Secondly, the precise semantics of SEFTs is given based on the guarded interface automata. After that, a minimal cut sequence analysis method is presented based on formal semantic model of SEFTs. Finally, the method in this paper is illustrated by modeling and analyzing the SEFT of a fire protection system. Our method is a new solution for minimal cut sequence analysis of SEFTs.","PeriodicalId":318237,"journal":{"name":"MDS '13","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124746480","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}
MDS '13Pub Date : 2013-12-09DOI: 10.1145/2541534.2541591
Yanyan Jiang, Chang Xu, Xiaoxing Ma
{"title":"DPAC: an infrastructure for dynamic program analysis of concurrency Java programs","authors":"Yanyan Jiang, Chang Xu, Xiaoxing Ma","doi":"10.1145/2541534.2541591","DOIUrl":"https://doi.org/10.1145/2541534.2541591","url":null,"abstract":"Concurrency programs are hard to test or debug due to their non-deterministic nature. Existing dynamic program analysis approaches tried to address this by carefully examine a recorded execution trace. However, developing such analysis tools is complicated, requiring to take care of many tedious implementation details, and comparing and evaluating different analysis approaches are also subject to various biases, due to lack of a common base platform. This motivates us to design DPAC, an infrastructure that support in building dynamic program analysis tools for concurrency Java programs. DPAC takes events and their various processing mechanisms as its underlying model to facilitate monitoring and manipulation of program executions as required by dynamic program analysis. Various analysis tools can be implemented by customizing their required event types and processing mechanisms. We show two concrete case studies how our DPAC helps building existing dynamic program analysis approaches, as well as tuning subtle implementation details for supporting customized function implementation and code transformation.","PeriodicalId":318237,"journal":{"name":"MDS '13","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133346205","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}
MDS '13Pub Date : 2013-12-09DOI: 10.1145/2541534.2541593
K. Y. Yigzaw, J. G. Bellika, Anders Andersen, G. Hartvigsen, C. Fernández-Llatas
{"title":"Towards privacy-preserving computing on distributed electronic health record data","authors":"K. Y. Yigzaw, J. G. Bellika, Anders Andersen, G. Hartvigsen, C. Fernández-Llatas","doi":"10.1145/2541534.2541593","DOIUrl":"https://doi.org/10.1145/2541534.2541593","url":null,"abstract":"The paper reports on work in progress towards construction of a peer-to-peer framework for privacy preserving computing on distributed electronic health data. The framework supports three different types of federated queries. For privacy-preserving computing, we proposed distributed secure multi-party computation (SMC), where each peer is only involved in secure computations with some of the peers. We hypothesize distributed SMC could enable to achieve more efficient and scalable computing solutions. The architecture of the framework is also described.","PeriodicalId":318237,"journal":{"name":"MDS '13","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126132240","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}
MDS '13Pub Date : 2013-12-09DOI: 10.1145/2541534.2541595
Yihan Wu, Gang Huang
{"title":"Model-based high availability configuration framework for cloud","authors":"Yihan Wu, Gang Huang","doi":"10.1145/2541534.2541595","DOIUrl":"https://doi.org/10.1145/2541534.2541595","url":null,"abstract":"Since cloud computing has emerged as a commercial reality, guaranteeing high availability (HA) has become a critical requirement. Many kinds of HA mechanisms have been developed with the rapid expansion of cloud computing. However, selection and configuration are difficult in practice. In the development phase, developers must choose HA mechanisms for cloud computing based on their experience. In the use phase, users must choose and configure the HA mechanisms for their virtual machines (VMs) or services deployed on VMs. In this paper, we proposed a model-based HA configuration framework for the cloud. For the developer, we proposed an open HA mechanism library and an automatic configuration process. For users, we intend to ease the selection of HA mechanisms in the ever-changing cloud environment. We are implementing our approach in our model-based cloud platform, JadeCloud.","PeriodicalId":318237,"journal":{"name":"MDS '13","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130416398","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}
MDS '13Pub Date : 2013-12-09DOI: 10.1145/2541534.2541590
Wenhua Yang, Chang Xu, Linghao Zhang
{"title":"IDEA: improving dependability for self-adaptive applications","authors":"Wenhua Yang, Chang Xu, Linghao Zhang","doi":"10.1145/2541534.2541590","DOIUrl":"https://doi.org/10.1145/2541534.2541590","url":null,"abstract":"Self-adaptive applications are becoming popular since they are able to adapt their behavior based on changes of environments. However, possible faults in these applications may result in runtime failures, which reduce their dependability. We propose a novel approach to improving the dependability of self-adaptive applications. The approach uses a rematching process to make self-adaptive applications consistent with their environments. In the rematching process, consistency failures are automatically detected and fixed at runtime to reduce application failures. The strategy for fixing consistency failures includes backward rematching and forward rematching. Proper strategies can be selected according to rematching ability analysis results for concerned applications. As a result, applications can thus achieve consistency with their environments and failures can be significantly avoided. We developed a tool named IDEA to support this process and the experimental results confirmed the effectiveness of our IDEA.","PeriodicalId":318237,"journal":{"name":"MDS '13","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131643670","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
