发布求助
文献互助 智能选刊 最新文献

2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)最新文献

筛选
英文 中文
Guided test visualization: Making sense of errors in concurrent programs 引导测试可视化:理解并发程序中的错误
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100141
Saint Wesonga, Eric Mercer, Neha Rungta
{"title":"Guided test visualization: Making sense of errors in concurrent programs","authors":"Saint Wesonga, Eric Mercer, Neha Rungta","doi":"10.1109/ASE.2011.6100141","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100141","url":null,"abstract":"This paper describes a tool to help debug error traces found by the Java Pathfinder model checker in concurrent Java programs. It does this by abstracting out thread interactions and program locations that are not obviously pertinent to the error through control flow or data dependence. The tool then iteratively refines the abstraction by adding thread interactions at critical locations until the error is reachable. The tool visualizes the entire process and enables the user to systematically analyze each abstraction and execution. Such an approach explicitly identifies specific context switch locations and thread interactions needed to debug a concurrent error trace in small to moderate programs that can be managed by the Java Pathfinder Tool.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117213025","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}
引用次数: 2
Statistical debugging with elastic predicates 使用弹性谓词进行统计调试
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100107
Ross Gore, P. Reynolds, D. Kamensky
{"title":"Statistical debugging with elastic predicates","authors":"Ross Gore, P. Reynolds, D. Kamensky","doi":"10.1109/ASE.2011.6100107","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100107","url":null,"abstract":"Traditional debugging and fault localization methods have addressed localization of sources of software failures. While these methods are effective in general, they are not tailored to an important class of software, including simulations and computational models, which employ floating-point computations and continuous stochastic distributions to represent, or support evaluation of, an underlying model. To address this shortcoming, we introduce elastic predicates, a novel approach to predicate-based statistical debugging. Elastic predicates introduce profiling of values assigned to variables within a failing program. These elastic predicates are better predictors of software failure than the static and uniform predicates used in existing techniques such as Cooperative Bug Isolation (CBI). We present experimental results for established fault localization benchmarks and widely used simulations that show improved effectiveness.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"60 36","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046412","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}
引用次数: 26
Enhancing architectural recovery using concerns 使用关注增强架构恢复
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100123
Joshua Garcia, D. Popescu, C. Mattmann, N. Medvidović, Yuanfang Cai
{"title":"Enhancing architectural recovery using concerns","authors":"Joshua Garcia, D. Popescu, C. Mattmann, N. Medvidović, Yuanfang Cai","doi":"10.1109/ASE.2011.6100123","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100123","url":null,"abstract":"Architectures of implemented software systems tend to drift and erode as they are maintained and evolved. To properly understand such systems, their architectures must be recovered from implementation-level artifacts. Many techniques for architectural recovery have been proposed, but their degrees of automation and accuracy remain unsatisfactory. To alleviate these shortcomings, we present a machine learning-based technique for recovering an architectural view containing a system's components and connectors. Our approach differs from other architectural recovery work in that we rely on recovered software concerns to help identify components and connectors. A concern is a software system's role, responsibility, concept, or purpose. We posit that, by recovering concerns, we can improve the correctness of recovered components, increase the automation of connector recovery, and provide more comprehensible representations of architectures.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"518 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127045459","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}
引用次数: 101
Symbolic search-based testing 基于符号搜索的测试
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100119
A. Baars, M. Harman, Y. Hassoun, Kiran Lakhotia, Phil McMinn, P. Tonella, T. Vos
{"title":"Symbolic search-based testing","authors":"A. Baars, M. Harman, Y. Hassoun, Kiran Lakhotia, Phil McMinn, P. Tonella, T. Vos","doi":"10.1109/ASE.2011.6100119","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100119","url":null,"abstract":"We present an algorithm for constructing fitness functions that improve the efficiency of search-based testing when trying to generate branch adequate test data. The algorithm combines symbolic information with dynamic analysis and has two key advantages: It does not require any change in the underlying test data generation technique and it avoids many problems traditionally associated with symbolic execution, in particular the presence of loops. We have evaluated the algorithm on industrial closed source and open source systems using both local and global search-based testing techniques, demonstrating that both are statistically significantly more efficient using our approach. The test for significance was done using a one-sided, paired Wilcoxon signed rank test. On average, the local search requires 23.41% and the global search 7.78% fewer fitness evaluations when using a symbolic execution based fitness function generated by the algorithm.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"25 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125977111","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}
引用次数: 96
Mining test oracles of web search engines 挖掘网络搜索引擎的测试预言机
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100085
Wujie Zheng, Hao Ma, Michael R. Lyu, Tao Xie, Irwin King
{"title":"Mining test oracles of web search engines","authors":"Wujie Zheng, Hao Ma, Michael R. Lyu, Tao Xie, Irwin King","doi":"10.1109/ASE.2011.6100085","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100085","url":null,"abstract":"Web search engines have major impact in people's everyday life. It is of great importance to test the retrieval effectiveness of search engines. However, it is labor-intensive to judge the relevance of search results for a large number of queries, and these relevance judgments may not be reusable since the Web data change all the time. In this work, we propose to mine test oracles of Web search engines from existing search results. The main idea is to mine implicit relationships between queries and search results, e.g., some queries may have fixed top 1 result while some may not, and some Web domains may appear together in top 10 results. We define a set of items of queries and search results, and mine frequent association rules between these items as test oracles. Experiments on major search engines show that our approach mines many high-confidence rules that help understand search engines and detect suspicious search results.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130156759","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}
引用次数: 15
Proximity based weighting of test cases to improve spectrum based fault localization 基于接近度的测试用例加权，改进基于频谱的故障定位
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100088
A. Bandyopadhyay, Sudipto Ghosh
{"title":"Proximity based weighting of test cases to improve spectrum based fault localization","authors":"A. Bandyopadhyay, Sudipto Ghosh","doi":"10.1109/ASE.2011.6100088","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100088","url":null,"abstract":"Spectrum based fault localization techniques such as Tarantula and Ochiai calculate the suspiciousness score of a program statement using the number of failing and passing test cases that execute the statement. These techniques implicitly assume that all test cases are equally important. However, research on test case generation and selection techniques has shown that using certain test cases can lead to more effective fault localization than others. In this paper, we present an approach to improve the effectiveness of spectrum based fault localization by incorporating the relative importance of different test cases in the calculation of suspiciousness scores.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"667 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133398088","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
Model checking distributed systems by combining caching and process checkpointing 通过结合缓存和进程检查点对分布式系统进行建模检查
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100043
Watcharin Leungwattanakit, Cyrille Artho, M. Hagiya, Yoshinori Tanabe, M. Yamamoto
{"title":"Model checking distributed systems by combining caching and process checkpointing","authors":"Watcharin Leungwattanakit, Cyrille Artho, M. Hagiya, Yoshinori Tanabe, M. Yamamoto","doi":"10.1109/ASE.2011.6100043","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100043","url":null,"abstract":"Verification of distributed software systems by model checking is not a straightforward task due to inter-process communication. Many software model checkers only explore the state space of a single multi-threaded process. Recent work proposes a technique that applies a cache to capture communication between the main process and its peers, and allows the model checker to complete state-space exploration. Although previous work handles non-deterministic output in the main process, any peer program is required to produce deterministic output. This paper introduces a process checkpointing tool. The combination of caching and process checkpointing makes it possible to handle non-determinism on both sides of communication. Peer states are saved as checkpoints and restored when the model checker backtracks and produces a request not available in the cache. We also introduce the concept of strategies to control the creation of checkpoints and the overhead caused by the checkpointing tool.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132720952","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}
引用次数: 12
TestEra: A tool for testing Java programs using alloy specifications TestEra:使用合金规范测试Java程序的工具
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100137
Shadi Abdul Khalek, Guowei Yang, Lingming Zhang, D. Marinov, S. Khurshid
{"title":"TestEra: A tool for testing Java programs using alloy specifications","authors":"Shadi Abdul Khalek, Guowei Yang, Lingming Zhang, D. Marinov, S. Khurshid","doi":"10.1109/ASE.2011.6100137","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100137","url":null,"abstract":"This tool paper presents an embodiment of TestEra - a framework developed in previous work for specification-based testing of Java programs. To test a Java method, TestEra uses the method's pre-condition specification to generate test inputs and the post-condition to check correctness of outputs. TestEra supports specifications written in Alloy - a first-order, declarative language based on relations - and uses the SAT-based back-end of the Alloy tool-set for systematic generation of test suites. Each test case is a JUnit test method, which performs three key steps: (1) initialization of pre-state, i.e., creation of inputs to the method under test; (2) invocation of the method; and (3) checking the correctness of post-state, i.e., checking the method output. The tool supports visualization of inputs and outputs as object graphs for graphical illustration of method behavior. TestEra is available for download to be used as a library or as an Eclipse plug-in.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115410569","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}
引用次数: 36
A topic-based approach for narrowing the search space of buggy files from a bug report 一种基于主题的方法，用于缩小bug报告中有bug文件的搜索空间
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100062
A. Nguyen, T. Nguyen, Jafar M. Al-Kofahi, H. V. Nguyen, T. Nguyen
{"title":"A topic-based approach for narrowing the search space of buggy files from a bug report","authors":"A. Nguyen, T. Nguyen, Jafar M. Al-Kofahi, H. V. Nguyen, T. Nguyen","doi":"10.1109/ASE.2011.6100062","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100062","url":null,"abstract":"Locating buggy code is a time-consuming task in software development. Given a new bug report, developers must search through a large number of files in a project to locate buggy code. We propose BugScout, an automated approach to help developers reduce such efforts by narrowing the search space of buggy files when they are assigned to address a bug report. BugScout assumes that the textual contents of a bug report and that of its corresponding source code share some technical aspects of the system which can be used for locating buggy source files given a new bug report. We develop a specialized topic model that represents those technical aspects as topics in the textual contents of bug reports and source files, and correlates bug reports and corresponding buggy files via their shared topics. Our evaluation shows that BugScout can recommend buggy files correctly up to 45% of the cases with a recommended ranked list of 10 files.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116943500","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}
引用次数: 174
Self-adaptive software meets control theory: A preliminary approach supporting reliability requirements 自适应软件满足控制理论:支持可靠性要求的初步方法
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) Pub Date : 2011-11-06 DOI: 10.1109/ASE.2011.6100064
A. Filieri, C. Ghezzi, A. Leva, M. Maggio
{"title":"Self-adaptive software meets control theory: A preliminary approach supporting reliability requirements","authors":"A. Filieri, C. Ghezzi, A. Leva, M. Maggio","doi":"10.1109/ASE.2011.6100064","DOIUrl":"https://doi.org/10.1109/ASE.2011.6100064","url":null,"abstract":"This paper investigates a novel approach to derive self-adaptive software by automatically modifying the model of the application using a control-theoretical approach. Self adaptation is achieved at the model level to assure that the model—which lives alongside the application at run-time— continues to satisfy its reliability requirements, despite changes in the environment that might lead to a violation. We assume that the model is given in terms of a Discrete Time Markov Chain (DTMC). DTMCs can express reliability concerns by modeling possible failures through transitions to failure states. Reliability requirements may be expressed as reachability properties that constrain the probability to reach certain states, denoted as failure states.","PeriodicalId":329697,"journal":{"name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128976469","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}
引用次数: 80
下一页 尾页
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学术官方微信
小红书