Pub Date : 2019-10-02DOI: 10.1109/APSEC48747.2019.00022
Thomas Laurent, Paolo Arcaini, F. Ishikawa, Anthony Ventresque
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.
{"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}
Pub Date : 2019-07-12DOI: 10.1109/APSEC48747.2019.00027
Hiroshi Yonai, Yasuhiro Hayase, H. Kitagawa
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：