发布求助
文献互助 智能选刊 最新文献

2014 21st Asia-Pacific Software Engineering Conference最新文献

筛选
英文 中文
Test Case Prioritization Based on Information Retrieval Concepts 基于信息检索概念的测试用例优先级
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.12
Jung-Hyun Kwon, In-Young Ko, G. Rothermel, Matthew Staats
{"title":"Test Case Prioritization Based on Information Retrieval Concepts","authors":"Jung-Hyun Kwon, In-Young Ko, G. Rothermel, Matthew Staats","doi":"10.1109/APSEC.2014.12","DOIUrl":"https://doi.org/10.1109/APSEC.2014.12","url":null,"abstract":"In regression testing, running all a system's test cases can require a great deal of time and resources. Test case prioritization (TCP) attempts to schedule test cases to achieve goals such as higher coverage or faster fault detection. While code coverage-based approaches are typical in TCP, recent work has explored the use of additional information to improve effectiveness. In this work, we explore the use of Information Retrieval (IR) techniques to improve the effectiveness of TCP, particularly for testing infrequently tested code. Our approach considers the frequency at which elements have been tested, in additional to traditional coverage information, balancing these factors using linear regression modeling. Our empirical study demonstrates that our approach is generally more effective than both random and traditional code coverage-based approaches, with improvements in rate of fault detection of up to 4.7%.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133085577","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}
引用次数: 20
A Symbolic Partial Order Method for Verifying SystemC SystemC验证的符号偏序方法
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.49
Naiju Zeng, Wenhui Zhang
{"title":"A Symbolic Partial Order Method for Verifying SystemC","authors":"Naiju Zeng, Wenhui Zhang","doi":"10.1109/APSEC.2014.49","DOIUrl":"https://doi.org/10.1109/APSEC.2014.49","url":null,"abstract":"SystemC is an IEEE standard system-level language and has been widely adopted in development of embedded systems. Verifying SystemC designs is critical since it can avoid error propagation down to the final implementation. Recent works translate SystemC designs into transition systems and verify them by model checking. However, model checking suffers from the state space explosion problem. This work combines partial order reduction and symbolic model checking to combating state space explosion in verifying SystemC. Some concepts are defined to assisting in partial order reduction according to the characteristics of SystemC transition systems, and partial order reduction algorithms for symbolic model checking are presented based on these concepts. Our approach is implemented on symbolic model checker VERDS and the efficiency is demonstrated by verifying a set of SystemC designs.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115310310","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
A Test Scenario Design Methodology Based on Business Context Modeling and Its Evaluation 基于业务上下文建模的测试场景设计方法及其评价
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.10
Norifumi Nomura, Yasuhiro Kikushima, M. Aoyama
{"title":"A Test Scenario Design Methodology Based on Business Context Modeling and Its Evaluation","authors":"Norifumi Nomura, Yasuhiro Kikushima, M. Aoyama","doi":"10.1109/APSEC.2014.10","DOIUrl":"https://doi.org/10.1109/APSEC.2014.10","url":null,"abstract":"To make a business competitive advantage with the information system, it is necessary to validate the system in order to assure the system performs the business as the users expect. While the business context is becoming diverse, conventional acceptance test only confirms that the system meets the requirements specifications, and hard to assure the quality of use in the business context. This article proposes a methodology to design a set of test scenarios effectively in diverse usage context based on the model of business context. We propose a method to identify and analysis the business context with an extension of Empathy Maps. To model the business context, we propose the BC (Business Context) matrix, which represents the dependency between business process and properties of the business context identified. With the BC matrix, we propose a method to design a set of test scenarios from the perspective of Personas. We applied the proposed methodology to a large-scale human resource management system shared by 29 ministries and agencies of the Japanese government, and evaluated the effectiveness of the methodology.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829766","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
A Proved Approach for Building Correct Instances of UML Associations: Multiplicities Satisfaction 构建UML关联的正确实例的一种经过验证的方法:多样性满意度
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.103
A. Mammar, Régine Laleau
{"title":"A Proved Approach for Building Correct Instances of UML Associations: Multiplicities Satisfaction","authors":"A. Mammar, Régine Laleau","doi":"10.1109/APSEC.2014.103","DOIUrl":"https://doi.org/10.1109/APSEC.2014.103","url":null,"abstract":"In UML modeling, class diagrams permit to capture the entities involved in a system but also the associations they have with each other. These associations are characterized by a multiplicity on each role to state the min-max number of instances of the opposite class that can be linked to each instance of the class associated with the role. Since these multiplicities may be conflicting, it becomes necessary to check the global consistency of a class diagram. Such verification will ensure that it is possible to find an instantiation of the diagram that satisfies all the multiplicities. In this paper, we describe an automatized approach that permits to validate a class diagram by exhibiting a particular instance. Basically, this approach proceeds in two main steps: first, the multiplicities are represented as a mathematical model, then a constraint solver is used to determine whether it has at least one solution. The correctness of the approach, which is supported by an automatic tool, has been carried out using the B formal method.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128964238","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
Runtime Verification by Convergent Formula Progression 收敛公式级数的运行时验证
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.47
Yan Shen, Jianwen Li, Zheng Wang, Ting Su, Bin Fang, G. Pu, Wanwei Liu, Mingsong Chen
{"title":"Runtime Verification by Convergent Formula Progression","authors":"Yan Shen, Jianwen Li, Zheng Wang, Ting Su, Bin Fang, G. Pu, Wanwei Liu, Mingsong Chen","doi":"10.1109/APSEC.2014.47","DOIUrl":"https://doi.org/10.1109/APSEC.2014.47","url":null,"abstract":"Runtime verification is a dynamic verification technique widely used in practice. In this paper we revisit the runtime verification technique with formula progression, which verifies the execution trace step by step by progressing the desired property written in temporal logic. The previous work did not discuss explicitly the bound for the sizes of expanded formulas, while the successive invoking of formula progression is likely to cause divergence. In this paper, we present the convergent formula progression by introducing a novel fix-point reduction technique, and prove it guarantees the sizes of expanded formulas be always convergent. To the best of our knowledge, this is the first work discussing the convergence of formula progression. Furthermore, we implement the new runtime verification framework, and experiments show the efficiency of our proposed strategy.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127906619","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
Reducing False Alarms from an Industrial-Strength Static Analyzer by SVM 基于支持向量机的工业强度静态分析仪误报算法研究
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.81
J. Yoon, Minsik Jin, Yungbum Jung
{"title":"Reducing False Alarms from an Industrial-Strength Static Analyzer by SVM","authors":"J. Yoon, Minsik Jin, Yungbum Jung","doi":"10.1109/APSEC.2014.81","DOIUrl":"https://doi.org/10.1109/APSEC.2014.81","url":null,"abstract":"Static analysis tools are useful to find potential bugs and security vulnerabilities in a source code, however, false alarms from such tools lower their usability. In order to reduce various kinds of false alarms and enhance the performance of the tools, we propose a machine learning based false alarm reduction method. Abstract syntax trees (AST) are used to represent structural characteristics and support vector machine (SVM) is used to learn models and classify new alarms using probability. This probability is used to remove false alarms. To evaluate the proposed method, we performed experiments using a static analysis tool, SPARROW, and Java open source projects. As a result, 37.33% of false alarms were reduced, with only removing 3.16% of true alarms.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127506963","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}
引用次数: 25
Process Cube for Software Defect Resolution 软件缺陷解决的过程立方体
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.45
Monika Gupta, A. Sureka
{"title":"Process Cube for Software Defect Resolution","authors":"Monika Gupta, A. Sureka","doi":"10.1109/APSEC.2014.45","DOIUrl":"https://doi.org/10.1109/APSEC.2014.45","url":null,"abstract":"Online Analytical Processing (OLAP) cube is a multi-dimensional dataset used for analyzing data in a Data Warehouse (DW) for the purpose of extracting actionable intelligence. Process mining consists of analyzing event log data produced from Process Aware Information Systems (PAIS) for the purpose of discovering and improving business processes. Process cube is a concept which falls at the intersection of OLAP cube and process mining. Process cube facilitates process mining from multiple-dimensions and enables comparison of process mining results across various dimensions. We present an application of process cube to software defect resolution process to analyze and compare process data from a multi-dimensional perspective. We present a framework, a novel perspective to mine software repositories using process cube. Each cell of process cube is defined by metrics from multiple process mining perspectives like control flow, time, conformance and organizational perspective. We conduct a case-study on Google Chromium project data in which the software defect resolution process spans three software repositories: Issue Tracking System (ITS), Peer Code Review System (PCR) and Version Control System (VCS). We define process cube with 9 dimensions as issue report timestamp, priority, state, closed status, OS, component, bug type, reporter and owner. We define hierarchies along various dimensions and cluster members to handle sparsity. We apply OLAP cube operations such as slice, dice, roll-up and drill-down, and create materialized sub log for each cell. We demonstrate the solution approach by discovering process map and compare process mining results from Control Flow and Time perspective for Performance and Security issues.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131847482","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}
引用次数: 14
Using Genetic Algorithms to Repair JUnit Test Cases 使用遗传算法修复JUnit测试用例
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.51
Yong Xu, Bo Huang, Guoqing Wu, Mengting Yuan
{"title":"Using Genetic Algorithms to Repair JUnit Test Cases","authors":"Yong Xu, Bo Huang, Guoqing Wu, Mengting Yuan","doi":"10.1109/APSEC.2014.51","DOIUrl":"https://doi.org/10.1109/APSEC.2014.51","url":null,"abstract":"JUnit test repair has been proposed as a way to alleviate the burden of maintaining the broken tests caused by evolving software. Existing techniques for JUnit test repair either focus on repairing failing assertions or fixing test case compilation errors rendered by evolving method declarations. The empirical work suggests that the synthesis of new method calls is often needed when repairing test cases in practice. In this work, we propose Test Fix, an approach to fix broken JUnit test cases by synthesizing new method calls. Test Fix reduces the synthesis to a search problem and uses a genetic algorithm to solve it. Evaluated on real world applications, preliminary experimental results show that Test Fix can repair broken tests with adding or deleting method calls. Evaluations on the performance of JUnit test repair technique using a genetic algorithm against a random search algorithm are also conducted. Experimental results indicate the clear superiority of genetic algorithms over random search algorithm.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132930256","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
Concolic Testing Framework for Industrial Embedded Software 工业嵌入式软件集成测试框架
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.82
Taeksu Kim, Jonghyun Park, Igor Kulida, Y. Jang
{"title":"Concolic Testing Framework for Industrial Embedded Software","authors":"Taeksu Kim, Jonghyun Park, Igor Kulida, Y. Jang","doi":"10.1109/APSEC.2014.82","DOIUrl":"https://doi.org/10.1109/APSEC.2014.82","url":null,"abstract":"Recently, concolic testing has drawn a lot of attention from the research community as a practical solution of overcoming limitations of manual test case generation. CONBOL, a concolic testing framework for large-scale embedded industrial software, has shown effectiveness of discovering real defects even for commercial quality software. In this paper, we extend CONBOL to be applicable to a project written in C++. Front-end of CONBOL is re-implemented based on LLVM and concolic engine is also modified. We design an enhanced DFS search strategy to enlarge search space when there an infinite loop exists in the execution path or control flow is too complex to be traversed. After applying to real world project, we prove that enhanced search strategy is better to increase test coverage. Finally, we investigate reasons of segmentation faults during concolic execution and suggest several heuristics to decrease segmentation faults.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133095726","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
Automatic Classification of UML Class Diagrams from Images 从图像中自动分类UML类图
2014 21st Asia-Pacific Software Engineering Conference Pub Date : 2014-12-01 DOI: 10.1109/APSEC.2014.65
Truong Ho-Quang, M. Chaudron, I. Samuelsson, J. Hjaltason, Bilal Karasneh, Hafeez Osman
{"title":"Automatic Classification of UML Class Diagrams from Images","authors":"Truong Ho-Quang, M. Chaudron, I. Samuelsson, J. Hjaltason, Bilal Karasneh, Hafeez Osman","doi":"10.1109/APSEC.2014.65","DOIUrl":"https://doi.org/10.1109/APSEC.2014.65","url":null,"abstract":"Graphical modelling of various aspects of software and systems is a common part of software development. UML is the de-facto standard for various types of software models. To be able to research UML, academia needs to have a corpus of UML models. For building such a database, an automated system that has the ability to classify UML class diagram images would be very beneficial, since a large portion of UML class diagrams (UML CDs) is available as images on the Internet. In this study, we propose 23 image-features and investigate the use of these features for the purpose of classifying UML CD images. We analyse the performance of the features and assess their contribution based on their Information Gain Attribute Evaluation scores. We study specificity and sensitivity scores of six classification algorithms on a set of 1300 images. We found that 19 out of 23 introduced features can be considered as influential predictors for classifying UML CD images. Through the six algorithms, the prediction rate achieves nearly 96% correctness for UML-CD and 91% of correctness for non-UML CD.","PeriodicalId":380881,"journal":{"name":"2014 21st Asia-Pacific Software Engineering Conference","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133797776","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}
引用次数: 28
首页 上一页 下一页 尾页
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学术官方微信