Yuelong Zhu, Meijun Xu, Pengcheng Zhang, Wenrui Li, H. Leung
{"title":"Bayesian Probabilistic Monitor: A New and Efficient Probabilistic Monitoring Approach Based on Bayesian Statistics","authors":"Yuelong Zhu, Meijun Xu, Pengcheng Zhang, Wenrui Li, H. Leung","doi":"10.1109/QSIC.2013.55","DOIUrl":"https://doi.org/10.1109/QSIC.2013.55","url":null,"abstract":"Modern software systems deal with increasing dependability requirements which specify non-functional aspect of a system correct operation. Usually, probabilistic properties are used to formulate dependability requirements like performance, reliability, safety, and availability. Probabilistic monitoring techniques, as an important assurance measure, has drawn more and more interest. Despite currently several approaches has been proposed to monitor probabilistic properties, it still lacks of a general and efficient monitoring approach for monitoring probabilistic properties. This paper puts forward a novel probabilistic monitoring approach based on Bayesian statistics, called Bayesian Probabilistic Monitor (BaProMon). By calculating Bayesian Factor, the approach can check whether the runtime information can provide sufficient evidences to support the null or alternative hypothesis. We give the corresponding algorithms and validate them via simulated-based experiments. The experimental results show that BaProMon can effectively monitor QoS properties. The results also indicate that our approach is superior to other approaches.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127287799","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 Search Strategy Guided by Uncovered Branches for Concolic Testing","authors":"Qixing Dong, Jun Yan, Jian Zhang, Fanping Zeng","doi":"10.1109/QSIC.2013.68","DOIUrl":"https://doi.org/10.1109/QSIC.2013.68","url":null,"abstract":"Test generation plays an important role in software testing. Concolic testing runs concrete executions on programs simultaneously with symbolic executions. It faces the same problem as symbolic execution when generating test inputs, namely the combinatorial explosion of the path space. Most of the existing approaches can search only a fraction of the path space. Therefore, how to cover as many branches as possible with a few test inputs becomes an important research issue. Upon this issue, the paper proposes a heuristic search strategy based on inter-procedural control flow graph. The proposed strategy calculates the approximate mathematic expectation of uncovered branches. Then this expectation guides the search process to select the optimal branch to form a path condition. According to the path condition, the test input that may cover a large number of uncovered branches is generated. Experiments on three classes of test benchmarks show that, compared to the other strategies, the proposed strategy can significantly reduce the number of test inputs for covering reachable branches, and achieve high branch coverage quickly.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116534408","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":"Workflow-Based Modeling of Web Application and Automatically Generating Test Sequences","authors":"Lulu Dong, Hua Li, Sumei Zhang","doi":"10.1109/QSIC.2013.37","DOIUrl":"https://doi.org/10.1109/QSIC.2013.37","url":null,"abstract":"Web applications are main applications in Internet. Before developing Web Application, a CPN (Colored Petri net) model based on workflow is constructed. By this way, the rationality of the workflow can be ensured before developing, rather than the irrationality is found during testing phases. The constructed CPN model is analyzed with CPN tools. Moreover, AGTS tool is implemented to generate test sequences and it is also suitable for all CPN models. To prove the method's efficiency, the make-order business process of logistics management system is used as an example to construct CPN model that is based on workflow, and then verify the correction of the constructed CPN model. At the same time, AGTS tool can automatically generate the test sequences of the constructed CPN model and its usability of this automatic tool is demonstrated.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122684008","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 Study on the Efficiency Aspect of Data Race Detection: A Compiler Optimization Level Perspective","authors":"Changjiang Jia, W. Chan","doi":"10.1109/QSIC.2013.58","DOIUrl":"https://doi.org/10.1109/QSIC.2013.58","url":null,"abstract":"Dynamically detecting data races in multithreaded programs incurs significant slowdown and memory overheads. Many existing techniques have been put forward to improve the performance slowdown through different dimensions such as sampling, detection precision, and data structures to track the happened-before relations among events in execution traces. Compiling the program source code with different compiler optimization options, such as reducing the object code size as the selected optimization objective, may produce different versions of the object code. Does optimizing the object code with a standard optimization option help improve the performance of the precise online race detection? To study this question and a family of related questions, this paper reports a pilot study based on four benchmarks from the PARSEC 3.0 suite compiled with six GCC compiler optimization options. We observe from the empirical data that in terms of performance slowdown, the standard optimization options behave comparably to the optimization options for speed and code size, but behave quite different from the baseline option. Moreover, in terms of memory cost, the standard optimization options incur similar memory costs as the baseline option and the option for speed, and consume less memory than the option for code size.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126154502","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":"Adaptive Combinatorial Testing","authors":"Changhai Nie, H. Leung, K. Cai","doi":"10.1109/QSIC.2013.22","DOIUrl":"https://doi.org/10.1109/QSIC.2013.22","url":null,"abstract":"Combinatorial Testing (CT) has been proven to be effective in detecting and locating the interaction triggered failure in the last 20 years. But CT still suffers from many challenges, such as modeling for CT, sampling mechanisms for test generation, applicability and effectiveness. To overcome these issues of CT, adaptive combinatorial testing (ACT) is proposed in this paper, which improves the traditional CT with a well established adaptive testing method as the counter part of adaptive control and aims to make CT more flexible and practical. ACT can significantly enhance testing quality, software reliability and support testing strategy adjustment dynamically. To support further investigation, a preliminary form of concrete strategy for ACT is given as a heuristic guideline.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114770052","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 Bidirectional Framework for Model Synchronization in Component-Based Software Development","authors":"Luxi Chen, Linpeng Huang, Chen Li, Tao Zan","doi":"10.1109/QSIC.2013.27","DOIUrl":"https://doi.org/10.1109/QSIC.2013.27","url":null,"abstract":"In different stages of component-based software development (CBSD), various model notations have been applied with different concerns. Architecture description languages (ADLs) have been proposed to specify the software architecture from a high-level, while UML is widely accepted in detailed design. However, the software model evolution frequently happens because of the dynamic environment and changeable requirements. For reuse and availability concern, the consistency between different model notations is required. In this paper, we propose a bidirectional framework to ensure the model synchronization in CBSD. We apply our framework between xADL and UML class diagram. The tool - Ground Tram with its generic interface - iGRT establishes bidirectional relationship between these two notations. Based on this property, changes on one notation will be propagated to the other one.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127879836","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}
Yukun Dong, Ying Xing, Dahai Jin, Yunzhan Gong, Kai Liu
{"title":"An Approach to Fully Recognizing Addressable Expression","authors":"Yukun Dong, Ying Xing, Dahai Jin, Yunzhan Gong, Kai Liu","doi":"10.1109/QSIC.2013.64","DOIUrl":"https://doi.org/10.1109/QSIC.2013.64","url":null,"abstract":"On account of the complexity of programs, it is a difficult work to recognize all addressable expressions, which is one of the preconditions of sound static analysis. This paper introduces an approach to recognizing all addressable expressions of C program. Firstly, we induce grammar patterns of C addressable expressions, mapping each kind of them to node of abstract syntax tree (AST), providing the corresponding naming rule and type inference rule. Then, we demonstrate an approach that recognizes C addressable expressions based on AST. In order to validate the adequacy of our approach, five real-world programs are utilized to perform experimental analysis. The result shows that our approach could recognize all kinds of addressable expressions.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820931","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":"Using Feature Model to Support Model-Based Testing of Product Lines: An Industrial Case Study","authors":"Shuai Wang, Shaukat Ali, T. Yue, Marius Liaaen","doi":"10.1109/QSIC.2013.51","DOIUrl":"https://doi.org/10.1109/QSIC.2013.51","url":null,"abstract":"In the context of Model-Based Testing (MBT) of product lines, effort required to develop models can be significantly reduced by applying systematic product line modeling and configuration methodologies. In our previous work, we developed such a methodology to capture variability in configurable UML state machines and aspect state machines. For each product, these state machines are to be configured for generating executable test cases. In this paper, we extended this methodology using Feature Model for Testing (FM_T) and Component Family Model for Behaviors (CFM_B). FM_T captures variable testing functionalities of a product line, whereas CFM_B provides an abstraction layer on top of the configurable state machines. With our current methodology, a test engineer doesn't need to acquire expertise on behavioral modeling and can simply configure models for a product by selecting features in FM_T and configuring provided attributes in CFM_B. The configured models are then given input to our model-based testing tool, TRansformation-based tool for Uml-baSed Testing (TRUST) for executable test case generation. We applied our extended methodology to a product line of video conferencing system developed by Cisco Systems, Norway. Results show that the methodology significantly reduces the complexity of configuration, thereby significantly reducing required effort and cost (e.g., in terms of training). In addition, it does not require test engineers to have expertise in UML modeling, aspect-oriented modeling, and OCL specification and therefore eases the adoption of MBT in industry.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124068864","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":"Improving Service Diagnosis through Invocation Monitoring","authors":"Cuiting Chen, H. Groß, A. Zaidman","doi":"10.1109/QSIC.2013.54","DOIUrl":"https://doi.org/10.1109/QSIC.2013.54","url":null,"abstract":"Service oriented architectures support software runtime evolution through reconfiguration of misbehaving services. Reconfiguration requires that the faulty services can be identified correctly. Spectrum-based fault localization is an automated diagnosis technique that can be applied to faulty service detection. It is based on monitoring service involvement in passed and failed system transactions. Monitoring only the involvement of services sometimes leads to inconclusive diagnoses. In this paper, we propose to extend monitoring to include also the invocation links between the services. We show through simulations and a case study with a real system under which circumstances service monitoring alone inhibits the correct detection of a faulty service, and how and to which extent the inclusion of invocation monitoring can lead to improved service diagnosis.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126274289","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":"Abstraction Based Domain Ontology Extraction for Idea Creation","authors":"D. Jing, Hongji Yang, Yingchun Tian","doi":"10.1109/QSIC.2013.31","DOIUrl":"https://doi.org/10.1109/QSIC.2013.31","url":null,"abstract":"Idea creation is a complicated process in which it requires plenty of knowledge as support for specific domain. Creativity becomes a more and more important feature for idea nowadays when information in various domains is on an explosion. Likewise, it raises the requirement for the amount of domain knowledge as background. Many previous traditional approaches to domain specific idea creation are performed by domain experts based on their personal knowledge storage and manually information research, which are considered to be time consuming, uncreative and out of date prone processes. As a creative knowledge combination activity, idea creation requires a great number of knowledge covers from research to industry in the application domains. The integration of domain ontology and idea creation is a trend in creative computing research area. The introduction of domain ontology based approach into idea creation can bridge the gap between knowledge collection and mental thought, and improve the efficiency and creativity of idea creation. In this paper, we propose an abstraction method to support one of the essential parts in this field - domain ontology extraction. Abstraction techniques are explored, classified, selected and integrated while elements of domain ontology are defined including concepts and relations. Also, a framework and approach is specified for apply the method into domain ontology extraction with designed abstraction rules to support its automation. A case study on idea creation scenario particularly is represented to validate the feasibility and reusability of our proposed method. Furthermore, the mapping rules for transformation from abstracted results to domain ontology are discussed as an initial idea and further work.","PeriodicalId":404921,"journal":{"name":"2013 13th International Conference on Quality Software","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132698160","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}