2019 26th Asia-Pacific Software Engineering Conference (APSEC)最新文献

筛选
英文 中文
A Mutation-Based Approach for Assessing Weight Coverage of a Path Planner 基于突变的路径规划器权重覆盖评估方法
2019 26th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2019-10-02 DOI: 10.1109/APSEC48747.2019.00022
Thomas Laurent, Paolo Arcaini, F. Ishikawa, Anthony Ventresque
{"title":"A Mutation-Based Approach for Assessing Weight Coverage of a Path Planner","authors":"Thomas Laurent, Paolo Arcaini, F. Ishikawa, Anthony Ventresque","doi":"10.1109/APSEC48747.2019.00022","DOIUrl":"https://doi.org/10.1109/APSEC48747.2019.00022","url":null,"abstract":"Autonomous cars are subjected to several different kind of inputs (other cars, road structure, etc.) and, therefore, testing the car under all possible conditions is impossible. To tackle this problem, scenario-based testing for automated driving defines categories of different scenarios that should be covered. Although this kind of coverage is a necessary condition, it still does not guarantee that any possible behaviour of the autonomous car is tested. In this paper, we consider the path planner of an autonomous car that decides, at each timestep, the short-term path to follow in the next few seconds; such decision is done by using a weighted cost function that considers different aspects (safety, comfort, etc.). In order to assess whether all the possible decisions that can be taken by the path planner are covered by a given test suite T, we propose a mutation-based approach that mutates the weights of the cost function and then checks if at least one scenario of T kills the mutant. Preliminary experiments on a manually designed test suite show that some weights are easier to cover as they consider aspects that more likely occur in a scenario, and that more complicated scenarios (that generate more complex paths) are those that allow to cover more weights.","PeriodicalId":325642,"journal":{"name":"2019 26th Asia-Pacific Software Engineering Conference (APSEC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127622667","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
Mercem: Method Name Recommendation Based on Call Graph Embedding 基于调用图嵌入的方法名称推荐
2019 26th Asia-Pacific Software Engineering Conference (APSEC) Pub Date : 2019-07-12 DOI: 10.1109/APSEC48747.2019.00027
Hiroshi Yonai, Yasuhiro Hayase, H. Kitagawa
{"title":"Mercem: Method Name Recommendation Based on Call Graph Embedding","authors":"Hiroshi Yonai, Yasuhiro Hayase, H. Kitagawa","doi":"10.1109/APSEC48747.2019.00027","DOIUrl":"https://doi.org/10.1109/APSEC48747.2019.00027","url":null,"abstract":"Software developers must provide meaningful but short names to identifiers because they strongly affect the comprehensibility of source code. On the other hand, identifier naming can be a difficult and time-consuming task, even for experienced developers. To support identifier naming, several techniques to recommend candidate names have been proposed. These techniques have challenges on the goodness of suggested candidates and limitations of applicable situations. This paper proposes a new approach to recommend method names by applying graph embedding techniques to the call graph. An experiment confirms that the proposed technique can suggest more appropriate name candidates in difficult situations than the state-of-the-art approach.","PeriodicalId":325642,"journal":{"name":"2019 26th Asia-Pacific Software Engineering Conference (APSEC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127189846","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
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学术官方微信