2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)最新文献_第4页

Statistical Model Checking Meets Property-Based Testing 统计模型检查满足基于属性的测试

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.42

B. Aichernig, Richard Schumi

引用次数: 12

Localizing and Fixing Faults in SQL Predicates 定位和修复SQL谓词中的错误

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.72

Yun Guo

引用次数: 3

Enhancing Trust – Software Vulnerability Analysis Framework 增强信任-软件漏洞分析框架

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.76

Sultan S. Al-Qahtani

引用次数: 0

Reflecting the Adoption of Software Testing Research in Open-Source Projects 反映开源项目中软件测试研究的采用

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.77

Fabian Trautsch

{"title":"Reflecting the Adoption of Software Testing Research in Open-Source Projects","authors":"Fabian Trautsch","doi":"10.1109/ICST.2017.77","DOIUrl":"https://doi.org/10.1109/ICST.2017.77","url":null,"abstract":"In the recent years, a lot of research has been done in the field of software testing. But, there exist few empirical studies which analyze, if results of software testing research are actually practiced in real software projects, why they are (not) practiced, and how this influences the quality of the project. Our proposed research project tries to close this gap by analyzing open-source software projects. We focus our work on a concept, which is well accepted and known in our community for a longer period of time: test levels. Hence, we propose a two step approach to tackle the problem. First, we want to determine if the concept of a unit is still up-to-date and propose alternatives otherwise. Furthermore, we aim to investigate, why developers think that the concept of a unit is (not) current. In the second step we intend to check, based on the unit definition determined in the ?rst step, how many tests on the different levels exist for the investigated projects. Additionally, based on the results, we want to examine, why developers are (not) developing tests for a certain test level and how this influences the software quality of the project. Our initial study showed, that very few projects have unit tests, using the unit definition of the IEEE and ISTQB. Furthermore, it revealed that developers intend to write unit tests, but they fail to do so.","PeriodicalId":112258,"journal":{"name":"2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130236980","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

A Search-Based Testing Approach for XML Injection Vulnerabilities in Web Applications 基于搜索的Web应用中XML注入漏洞测试方法

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.39

S. Jan, Duy Cu Nguyen, Andrea Arcuri, L. Briand

引用次数: 12

Efficient Safety Proofs for Industry-Scale Code Using Abstractions and Bounded Model Checking 使用抽象和有界模型检查的工业规模代码的有效安全证明

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.53

P. Darke, Bharti Chimdyalwar, Avriti Chauhan, R. Venkatesh

{"title":"Efficient Safety Proofs for Industry-Scale Code Using Abstractions and Bounded Model Checking","authors":"P. Darke, Bharti Chimdyalwar, Avriti Chauhan, R. Venkatesh","doi":"10.1109/ICST.2017.53","DOIUrl":"https://doi.org/10.1109/ICST.2017.53","url":null,"abstract":"Loop Abstraction followed by Bounded Model Checking, or LABMC in short, is a promising recent technique for proving safety of large programs. In an experimental setup proposed last year [14], LABMC was combined with slicing and Iterative Context Extension (ICE) with the aim of achieving scalability over industrial code. In this paper, we address two major limitations of that set-up, namely i) the inability of ICE to prune redundant code in a verification context, and ii) the unavailability of a tool that implements the set-up. We propose an improvement over ICE called Iterative Function Level Slicing (IFLS) and incorporate it in our tool called ELABMC, to offer an efficient implementation of [14]. We substantiate our claim with two sets of experiments over industrial applications as well as academic benchmarks. Quantifying the benefits of IFLS over traditional ICE in one, our results report that IFLS leads to 34.9% increase in efficiency, 17.7% improvement in precision, and scales in 14.2% more cases. With the second experiment, we show that ELABMC outperforms state-of-the-art verification techniques in the task of identifying static analysis warnings as false alarms.","PeriodicalId":112258,"journal":{"name":"2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132790222","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}

引用次数: 5

How to Test in Sixteen Languages? Automation Support for Localization Testing 如何用16种语言进行测试?自动化支持本地化测试

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.63

R. Ramler, R. Hoschek

引用次数: 6

Debugging Multithreaded Programs Using Symbolic Analysis 使用符号分析调试多线程程序

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.73

Xiaodong Zhang

引用次数: 1

NIVAnalyzer: A Tool for Automatically Detecting and Verifying Next-Intent Vulnerabilities in Android Apps NIVAnalyzer:用于自动检测和验证Android应用程序中的下一个意图漏洞的工具

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.56

Junjie Tang, Xingmin Cui, Ziming Zhao, Shanqing Guo, Xin-Shun Xu, Chengyu Hu, Tao Ban, Bing Mao

{"title":"NIVAnalyzer: A Tool for Automatically Detecting and Verifying Next-Intent Vulnerabilities in Android Apps","authors":"Junjie Tang, Xingmin Cui, Ziming Zhao, Shanqing Guo, Xin-Shun Xu, Chengyu Hu, Tao Ban, Bing Mao","doi":"10.1109/ICST.2017.56","DOIUrl":"https://doi.org/10.1109/ICST.2017.56","url":null,"abstract":"In the Android system design, any app can start another app's public components to facilitate code reuse by sending an asynchronous message called Intent. In addition, Android also allows an app to have private components that should only be visible to the app itself. However, malicious apps can bypass this system protection and directly invoke private components in vulnerable apps through a class of newly discovered vulnerability, which is called next-intent vulnerability. In this paper, we design an intent flow analysis strategy which accurately tracks the intent in smali code to statically detect next-intent vulnerabilities efficiently and effectively on a large scale. We further propose an automated approach to dynamically verify the discovered vulnerabilities by generating exploit apps. Then we implement a tool named NIVAnalyzer and evaluate it on 20,000 apps downloaded from Google Play. As the result, we successfully confirms 190 vulnerable apps, some of which even have millions of downloads. We also confirmed that an open-source project and a third-party SDK, which are still used by other apps, have next intent vulnerabilities.","PeriodicalId":112258,"journal":{"name":"2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133772353","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}

引用次数: 8

Incremental Deductive Verification for Relational Model Transformations 关系模型转换的增量演绎验证

2017 IEEE International Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2017-03-01 DOI: 10.1109/ICST.2017.41

Zheng Cheng, M. Tisi

{"title":"Incremental Deductive Verification for Relational Model Transformations","authors":"Zheng Cheng, M. Tisi","doi":"10.1109/ICST.2017.41","DOIUrl":"https://doi.org/10.1109/ICST.2017.41","url":null,"abstract":"In contract-based development of model transformations, continuous deductive verification may help the transformation developer in early bug detection. However, because of the execution performance of current verification systems, re-verifying from scratch after a change has been made would introduce impractical delays. We address this problem by proposing an incremental verification approach for the ATL model-transformation language. Our approach is based on decomposing each OCL contract into sub-goals, and caching the sub-goal verification results. At each change we exploit the semantics of relational model transformation to determine whether a cached verification result may be impacted. Consequently, less postconditions/sub-goals need to be re-verified. When a change forces the re-verification of a postcondition, we use the cached verification results of sub-goals to construct a simplified version of the postcondition to verify. We prove the soundness of our approach and show its effectiveness by mutation analysis. Our case study presents an approximate 50% reuse of verification results for postconditions, and 70% reuse of verification results for sub-goals. The user perceives about 56% reduction of verification time for postconditions, and 51% for sub-goals.","PeriodicalId":112258,"journal":{"name":"2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133882119","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