2013 20th Asia-Pacific Software Engineering Conference (APSEC)最新文献

筛选
英文 中文
TETRABox - A Generic White-Box Testing Framework for Model Transformations 一个用于模型转换的通用白盒测试框架
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.21
J. Schönböck, G. Kappel, M. Wimmer, A. Kusel, W. Retschitzegger, W. Schwinger
{"title":"TETRABox - A Generic White-Box Testing Framework for Model Transformations","authors":"J. Schönböck, G. Kappel, M. Wimmer, A. Kusel, W. Retschitzegger, W. Schwinger","doi":"10.1109/APSEC.2013.21","DOIUrl":"https://doi.org/10.1109/APSEC.2013.21","url":null,"abstract":"Model transformations play a vital role in Model-Driven Engineering. Due to their increasing complexity, proper means for ensuring their quality are needed. Although numerous approaches for testing of model transformations have been proposed, their focus is rather on formal verification than on execution-based testing. Additionally, existing approaches do not consider the actual transformation definition, rarely provide hints for debugging in case of an error and are specific to a certain transformation language. Therefore we propose TETRA Box as a generic framework for execution-based white-box testing of transformation languages. For this, we base on symbolic execution of model transformations. Additionally, by employing our Pattern-based Modeling Language for Model Transformations (PaMoMo), we are able to provide dedicated failure traces that are aligned to the actual transformation definition as a hint for debugging.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"64 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":"133120520","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}
引用次数: 13
Distributed Online Test Generation for Model-Based Testing 基于模型测试的分布式在线测试生成
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.43
T. Kanstrén, Tuomas Kekkonen
{"title":"Distributed Online Test Generation for Model-Based Testing","authors":"T. Kanstrén, Tuomas Kekkonen","doi":"10.1109/APSEC.2013.43","DOIUrl":"https://doi.org/10.1109/APSEC.2013.43","url":null,"abstract":"In online model-based testing, test execution is interleaved with test generation. Test cases should be generated and executed with minimal delay, while still achieving targeted coverage criteria quickly. Extensive model analysis in such case is not possible as any delays in choosing the next step will immediately impact the response times of test execution. The algorithms thus need to be as fast as possible, where a limiting factor is the available computing power. Experts working on the test models used for the generation often need to be able to quickly edit the models, generate test cases, and use the feedback to further evolve the models. Reserving large-scale computing resources while editing the model is unnecessary, but performing the analysis on them for test generation can improve the execution response time significantly. In this paper, we present an approach and algorithm for distributing the online test generation analysis part concurrently over the network, while enabling the expert to work on the models and execute the test cases locally at the same time.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"14 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":"129204113","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
Connecting Interaction Models and Application Logic for Model-Driven Generation of Web-Based Graphical User Interfaces 连接基于web的图形用户界面模型驱动生成的交互模型和应用逻辑
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.38
R. Popp, H. Kaindl, David Raneburger
{"title":"Connecting Interaction Models and Application Logic for Model-Driven Generation of Web-Based Graphical User Interfaces","authors":"R. Popp, H. Kaindl, David Raneburger","doi":"10.1109/APSEC.2013.38","DOIUrl":"https://doi.org/10.1109/APSEC.2013.38","url":null,"abstract":"In the research on automated (design-time) generation of graphical user interfaces (GUIs), the focus is on how such a generation works and on the resulting GUI's appearance. However, the integration of the software part implementing the resulting GUI with an application logic does not appear to be in a well-defined software architecture. We propose an integration in the well-known Model-View-Controller (MVC) architecture, with its decoupling of different concerns and the resulting software properties. We show that most of its components can be automatically generated from Discourse-based Communication Models. We also show how these models connect to an application logic. In this way, we present an implemented and tested approach to connecting a high-level interaction model and the Web-based GUI software generated from it with an application logic and its implementation in the context of model-driven GUI generation.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"29 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":"128841783","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
A Value Weighting Method for Pair-wise Testing 成对检验的一种值加权法
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.24
S. Fujimoto, Hideharu Kojima, Tatsuhiro Tsuchiya
{"title":"A Value Weighting Method for Pair-wise Testing","authors":"S. Fujimoto, Hideharu Kojima, Tatsuhiro Tsuchiya","doi":"10.1109/APSEC.2013.24","DOIUrl":"https://doi.org/10.1109/APSEC.2013.24","url":null,"abstract":"In this paper, we propose a weighting method for pair-wise testing. Pair-wise testing is a software testing strategy that tests every pair of parameter values at least once. Weighting allows the tester to specify desired frequency of occurrence in a test suite for each parameter value. Pair-wise testing is a widely used strategy because of its effectiveness in finding faults in software. Weighting makes this strategy more effective by allowing the tester to have more control over the resulting test suite. However, there is not much research on weighting. To our knowledge, all existing weighting methods treat weights as a second class requirement and cannot generate a test suite that sufficiently respects the given weights. The proposed method aims to overcome the problem. By taking into consideration the parameter value distribution in the current test suite and the ideal one specified by the given weights, the method generates each test case so that the resulting test suite can reflect the weights as accurately as possible. We implement the method in our testing tool and show some results to demonstrate how accurately test suites generated by this tool satisfy given weights.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"45 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":"129413852","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}
引用次数: 6
Identifying More Equivalent Mutants via Code Similarity 通过代码相似度识别更多等效突变体
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.34
Marinos Kintis, N. Malevris
{"title":"Identifying More Equivalent Mutants via Code Similarity","authors":"Marinos Kintis, N. Malevris","doi":"10.1109/APSEC.2013.34","DOIUrl":"https://doi.org/10.1109/APSEC.2013.34","url":null,"abstract":"Equivalent mutants are one of the major costs of mutation testing. The undecidable nature of this problem makes a fully automated solution unattainable and necessitates the manual analysis of live mutants. This paper introduces the concept of mirrored mutants, ones that affect similar code fragments. It is argued that mirrored mutants exhibit analogous behavior with respect to their equivalence. Thus, if one of them is equivalent, then the other mirrored mutants should be too. An empirical study, conducted on real world programs, investigates this argument, focusing on both intra-method and inter-method mirrored mutants. The obtained results suggest that mirrored mutants indeed exhibit this kind of behavior and thus can be utilized to ameliorate the adverse effects of the equivalent mutant problem.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"12 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":"122400771","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}
引用次数: 19
Suggesting Extract Class Refactoring Opportunities by Measuring Strength of Method Interactions 建议通过度量方法交互的强度来提取类重构的机会
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.123
G. Pappalardo, E. Tramontana
{"title":"Suggesting Extract Class Refactoring Opportunities by Measuring Strength of Method Interactions","authors":"G. Pappalardo, E. Tramontana","doi":"10.1109/APSEC.2013.123","DOIUrl":"https://doi.org/10.1109/APSEC.2013.123","url":null,"abstract":"For improving the modularity of a large software system, metrics can be valuable to help finding refactoring opportunities for classes. We define a novel metric that is intended to suggest how closely connected are the elements of a class. The metric characterises the strength of the coupling between methods of a class, based on invocations and the size of the parameters involved, as well as attribute accesses. The assessment of the strength of interactions turns out to be valuable in providing an indication on the possible changes that classes need to become more modular and prone to be reused. According to the computed metric and the assessment of system-wide relationships between classes, we are able to suggest Extract Class refactoring opportunities. The capability of the proposed approach to evaluate object-oriented systems is demonstrated by analysing a large software system.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"39 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":"128255302","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}
引用次数: 32
Automating Inference of OCL Business Rules from User Scenarios 从用户场景中自动推断OCL业务规则
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.31
Duc-Hanh Dang, Jordi Cabot
{"title":"Automating Inference of OCL Business Rules from User Scenarios","authors":"Duc-Hanh Dang, Jordi Cabot","doi":"10.1109/APSEC.2013.31","DOIUrl":"https://doi.org/10.1109/APSEC.2013.31","url":null,"abstract":"User Scenarios have been advocated as an effective means to capture requirements by describing the system-to-be at the instance or example level. This instance-level information is then used to infer a possible software specification consistent with the provided valid and invalid scenarios. So far existing approaches have often focused on the generation of static models but have omitted the inference of business rules that could complement the static models and improve the precision of the software specification. In this sense this paper provides a first set of invariant inference patterns that are applied on valid and invalid snapshots in order to generate OCL~(Object Constraint Language) integrity constraints that the system should always satisfy. We strengthen the confidence of inferred results based on the user's feedback of generated examples and counterexamples for the considered constraint. The approach is realized with a prolog-based tool that could support the designer to effectively define OCL integrity constraints in a semi-automatic way.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"14 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":"115244595","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
On Security Issues in Web Applications through Cross Site Scripting (XSS) 通过跨站点脚本(XSS)探讨Web应用程序中的安全问题
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.85
Vikas K. Malviya, S. Saurav, Atul Gupta
{"title":"On Security Issues in Web Applications through Cross Site Scripting (XSS)","authors":"Vikas K. Malviya, S. Saurav, Atul Gupta","doi":"10.1109/APSEC.2013.85","DOIUrl":"https://doi.org/10.1109/APSEC.2013.85","url":null,"abstract":"Web applications have become a very popular means of developing software. This is because of many advantages of web applications like no need of installation on each client machine, centralized data, reduction in business cost etc. With the increase in this trend web applications are becoming vulnerable for attacks. Cross site scripting (XSS) is the major threat for web application as it is the most basic attack on web application. It provides the surface for other types of attacks like Cross Site Request Forgery, Session Hijacking etc. There are three types of XSS attacks i.e. non-persistent (or reflected) XSS, persistent (or stored) XSS and DOM-based vulnerabilities. There is one more type that is not as common as those three types, induced XSS. In this work we aim to study and consolidate the understanding of XSS and their origin, manifestation, kinds of dangers and mitigation efforts for XSS. Different approaches proposed by researchers are presented here and an analysis of these approaches is performed. Finally the conclusion is drawn at the end of the work.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"155 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":"121521965","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
System Quality Improvement Including Software and Infrastructure Based on Software Metrics Approach 基于软件度量方法的系统质量改进包括软件和基础设施
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.13
N. Hanakawa, M. Obana
{"title":"System Quality Improvement Including Software and Infrastructure Based on Software Metrics Approach","authors":"N. Hanakawa, M. Obana","doi":"10.1109/APSEC.2013.13","DOIUrl":"https://doi.org/10.1109/APSEC.2013.13","url":null,"abstract":"We propose a basic metric for design sheets of infrastructure in order to improve infrastructure quality. The metric is called as LOI (Line Of Item). LOI is a simple metric of infrastructure for measuring scale and quality of infrastructure, as same as LOC (Line Of Code) of software. In addition, a class diagram of design sheets is provided in UML software design technique. LOI and the class diagram are applied to a real large-scale project. As a result, the whole of structure of the design sheets was clear, and, the scale of the infrastructure was able to be measured. In addition, the 40 system faults caused by the design sheets are analyzed. Correlation coefficient between LOI and the system faults was 0.483, it is weak correlation. Moreover, we confirmed that omission of design sheets such as blank columns may cause system faults, and copy actions of sub-design sheets may lead system faults.","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"45 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":"114434375","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}
引用次数: 0
A New Scheduling Strategy for Risk Mitigation 一种新的风险缓解调度策略
2013 20th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2013-12-02 DOI: 10.1109/APSEC.2013.76
Peng Zhou, H. Leung
{"title":"A New Scheduling Strategy for Risk Mitigation","authors":"Peng Zhou, H. Leung","doi":"10.1109/APSEC.2013.76","DOIUrl":"https://doi.org/10.1109/APSEC.2013.76","url":null,"abstract":"Risk mitigation is essential for risk management because it aims to reduce or eliminate risks. A good risk mitigation strategy aims to make the best use of resources and reduces the project risk as much as possible. A meaningful strategy should at least have a higher performance than a \"Random strategy\". In this paper, we (1) propose a new scheduling strategy, \"Greedy strategy\", for risk mitigation, (2) compare the performance of Greedy strategy with existing scheduling strategies, and (3) compare the performance of all identified scheduling strategies (Greedy strategy and existing strategies) with the Random strategy. The results show that the proposed strategy has a better performance than existing strategies, and all existing strategies and Greedy strategy have a better performance than \"Random strategy\".","PeriodicalId":187451,"journal":{"name":"2013 20th Asia-Pacific Software Engineering Conference (APSEC)","volume":"462 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":"122167613","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}
引用次数: 0
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书