2016 IEEE International Conference on Software Quality, Reliability and Security (QRS)最新文献_第4页

HistLock: Efficient and Sound Hybrid Detection of Hidden Predictive Data Races with Functional Contexts HistLock:具有功能上下文的隐藏预测数据竞争的有效和健全的混合检测

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.12

Jialin Yang, Chunbai Yang, W. Chan

{"title":"HistLock: Efficient and Sound Hybrid Detection of Hidden Predictive Data Races with Functional Contexts","authors":"Jialin Yang, Chunbai Yang, W. Chan","doi":"10.1109/QRS.2016.12","DOIUrl":"https://doi.org/10.1109/QRS.2016.12","url":null,"abstract":"State-of-the-art hybrid data race detectors combine the happens-before relation and the locking discipline to alleviate the imprecision problem incurred by lockset-based detector and the thread interleaving problem incurred by happens-before detectors. However, they incur high runtime overheads. In this paper, we present HistLock, a novel and sound hybrid dynamic race detector, which attains high precision, low slowdown and memory overheads, and thread insensitivity. It formulates a novel context-based strategy to phrase out non-redundant memory access events and check races to conserve both time and memory computation. It ensures each race warning to be the one violating the locking discipline in the original event history. Our experiment compared HistLock to FastTrack, AccuLock, and MultiLock-HB, which were a precise happens-before race detector, an imprecise hybrid race detector, and a precise hybrid race detector, respectively, on 13 benchmark subjects. HistLock was found to be of higher precision, 156% faster and 33% more memory-efficient than MultiLock-HB. It detected 59 more race warnings than AccuLock, attaining higher effectiveness, but ran slower by 43%. In most cases, in a single run, HistLock reported all the races detected by FastTrack in 100 runs.","PeriodicalId":412973,"journal":{"name":"2016 IEEE International Conference on Software Quality, Reliability and Security (QRS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127712351","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}

引用次数: 7

Testing Security Requirements with Non-experts: Approaches and Empirical Investigations 用非专家测试安全需求:方法和实证调查

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.37

B. Peischl, M. Felderer, Armin Beer

引用次数: 7

TLS Cipher Suites Recommendations: A Combinatorial Coverage Measurement Approach TLS密码套件推荐:组合覆盖度量方法

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.18

D. Simos, Kristoffer Kleine, A. Voyiatzis, D. R. Kuhn, R. Kacker

引用次数: 7

User-Perceived Source Code Quality Estimation Based on Static Analysis Metrics 基于静态分析度量的用户感知源代码质量评估

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.22

Michail D. Papamichail, Themistoklis G. Diamantopoulos, A. Symeonidis

引用次数: 27

Test Effectiveness Evaluation of Prioritized Combinatorial Testing: A Case Study 优先组合测试的测试效果评价:一个案例研究

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.17

Eun-Hye Choi, Shunya Kawabata, O. Mizuno, Cyrille Artho, Takashi Kitamura

引用次数: 9

Using a Distributed Representation of Words in Localizing Relevant Files for Bug Reports 在Bug报告的相关文件本地化中使用分布式单词表示

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.30

Yukiya Uneno, O. Mizuno, Eun-Hye Choi

引用次数: 15

MedicationChecker: Development of a Formally Verified Android Application with EventB2SQL MedicationChecker:使用EventB2SQL开发一个正式验证的Android应用程序

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.42

Tim Wahls

引用次数: 3

Test Case Prioritization Using Adaptive Random Sequence with Category-Partition-Based Distance 基于类别分区距离的自适应随机序列测试用例优先级排序

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.49

Xiaofang Zhang, Xiaoyuan Xie, T. Chen

{"title":"Test Case Prioritization Using Adaptive Random Sequence with Category-Partition-Based Distance","authors":"Xiaofang Zhang, Xiaoyuan Xie, T. Chen","doi":"10.1109/QRS.2016.49","DOIUrl":"https://doi.org/10.1109/QRS.2016.49","url":null,"abstract":"Test case prioritization schedules test cases in a certain order aiming to improve the effectiveness of regression testing. Random sequence is a basic and simple prioritization technique, while Adaptive Random Sequence (ARS) makes use of extra information to improve the diversity of random sequence. Some researchers have proposed prioritization techniques using ARS with white-box information, such as code coverage information, or with black-box information, such as string distances of the input data. In this paper, we propose new black-box test case prioritization techniques using ARS, and the diversity of test cases is assessed by category-partition-based distance. Our experimental studies show that these new techniques deliver higher fault-detection effectiveness than random prioritization, especially in the case of smaller ratio of failed test cases. In addition, in the comparison of different distance metrics, techniques with category-partition-based distance generally deliver better fault-detection effectiveness and efficiency, meanwhile in the comparison of different ordering algorithms, our ARS-based ordering algorithms usually have comparable fault-detection effectiveness but much lower computation overhead, and thus are much more cost-effective.","PeriodicalId":412973,"journal":{"name":"2016 IEEE International Conference on Software Quality, Reliability and Security (QRS)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115640896","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}

引用次数: 24

Verifying Distributed Controllers with Local Invariants 用局部不变量验证分布式控制器

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.24

Yiqun Wang, Shengwei An, Xiaoxing Ma, Chun Cao, Chang Xu

{"title":"Verifying Distributed Controllers with Local Invariants","authors":"Yiqun Wang, Shengwei An, Xiaoxing Ma, Chun Cao, Chang Xu","doi":"10.1109/QRS.2016.24","DOIUrl":"https://doi.org/10.1109/QRS.2016.24","url":null,"abstract":"Controllers restrict systems to behave only in good manners. Different from controlling monolithic systems where controllers can be automatically synthesized from specifications, controlling distributed systems often has to use distributed controllers that are manually programmed. To ensure their correctness, manually programmed controllers themselves need to be formally verified. This task can be challenging due to the complexity caused by the autonomy and asynchrony of distributed controllers. The limited scalability of existing model checkers also exacerbates the problem. In this paper we explore the modeling and verification of distributed controllers using Alloy. Besides resorting to the Small Scopes Hypothesis of the Alloy methodology, we also leverage local invariant based modular verification techniques for better scalability. A local invariant characterizes a logical relationship between a local sub-system and its neighbors and abstracts away the concrete interactions. These concrete interactions would otherwise explode the system state space during verification. The approach is first illustrated with the well-understood Two-Phase Commit protocol, and then is applied to the verification of several dynamic software update protocols, which gives an initial evidence of its effectiveness.","PeriodicalId":412973,"journal":{"name":"2016 IEEE International Conference on Software Quality, Reliability and Security (QRS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114735442","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

NOTICE: A Framework for Non-Functional Testing of Compilers 注意:编译器的非功能测试框架

2016 IEEE International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2016-08-01 DOI: 10.1109/QRS.2016.45

M. Boussaa, Olivier Barais, B. Baudry, G. Sunyé

引用次数: 7