2009 IEEE/ACM International Conference on Automated Software Engineering最新文献

筛选
英文 中文
Improving the Efficiency of Dependency Analysis in Logical Decision Models 提高逻辑决策模型中依赖分析的效率
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.55
Sunny Wong, Yuanfang Cai
{"title":"Improving the Efficiency of Dependency Analysis in Logical Decision Models","authors":"Sunny Wong, Yuanfang Cai","doi":"10.1109/ASE.2009.55","DOIUrl":"https://doi.org/10.1109/ASE.2009.55","url":null,"abstract":"To address the problem that existing software dependency extraction methods do not work on higher-level software artifacts, do not express decisions explicitly, and do not reveal implicit or indirect dependencies, our recent work explored the possibility of formally defining and automatically deriving a pairwise dependence relation from an augmented constraint networks (ACN) that models the assumption relation among design decisions. The current approach is difficult to scale, requiring constraint solving and solution enumeration. We observe that the assumption relation among design decisions for most software systems can be abstractly modeled using a special form of ACN. For these more restrictive, but highly representative models, we present an O(n^3) algorithm to derive the dependency relation without solving the constraints. We evaluate our approach by computing design structure matrices for existing ACNs that model multiple versions of heterogenous real software designs, often reducing the running time from hours to seconds.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123471116","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}
引用次数: 11
AOWP: Web-Specific AOP Framework for PHP AOWP:面向PHP的Web-Specific AOP框架
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.45
Keiji Hokamura, Ryoto Naruse, Masaru Shiozuka, Naoyasu Ubayashi, S. Nakajima, Akihito Iwai
{"title":"AOWP: Web-Specific AOP Framework for PHP","authors":"Keiji Hokamura, Ryoto Naruse, Masaru Shiozuka, Naoyasu Ubayashi, S. Nakajima, Akihito Iwai","doi":"10.1109/ASE.2009.45","DOIUrl":"https://doi.org/10.1109/ASE.2009.45","url":null,"abstract":"Aspect-oriented programming (AOP) is a technique for modularizing crosscutting concerns (CCCs). A variety of CCCs can be found in typical Web applications. Most CCCs are scattered over Web-specific events such as page requests. AOWP, a PHP-based AOP framework, provides Web-specific aspect instantiations for dealing with session management and pointcut & advice mechanisms for capturing Web-specific events. CCCs in Web applications can be clearly modularized by introducing AOWP.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122003364","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
Generating Fixes from Object Behavior Anomalies 从对象行为异常生成修复
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.15
Valentin Dallmeier, A. Zeller, B. Meyer
{"title":"Generating Fixes from Object Behavior Anomalies","authors":"Valentin Dallmeier, A. Zeller, B. Meyer","doi":"10.1109/ASE.2009.15","DOIUrl":"https://doi.org/10.1109/ASE.2009.15","url":null,"abstract":"Advances in recent years have made it possible in some cases to locate a bug (the source of a failure) automatically. But debugging is also about correcting bugs. Can tools do this automatically? The results reported in this paper, from the new PACHIKA tool, suggest that such a goal may be reachable. PACHIKA leverages differences in program behavior to generate program fixes directly. It automatically summarizes executions to object behavior models, determines differences between passing and failing runs, generates possible fixes, and assesses them via the regression test suite. Evaluated on the ASPECTJ bug history, PACHIKA generates a valid fix for 3 out of 18 crashing bugs; each fix pinpoints the bug location and passes the ASPECTJ test suite.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122111828","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}
引用次数: 135
Lost in Translation: Forgetful Semantic Anchoring 迷失在翻译中:遗忘的语义锚定
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.83
D. Balasubramanian, Ethan K. Jackson
{"title":"Lost in Translation: Forgetful Semantic Anchoring","authors":"D. Balasubramanian, Ethan K. Jackson","doi":"10.1109/ASE.2009.83","DOIUrl":"https://doi.org/10.1109/ASE.2009.83","url":null,"abstract":"Assigning behavioral semantics to domain-specific languages (DSLs) opens the door for the application of formal methods, yet is largely an unresolved problem. Previously proposed solutions include semantic anchoring, in which a transformation from the DSL to an external framework that can supply both behavioral semantics and apply formal methods is constructed. The drawback of this approach is that it loses the structural constraints of the original DSL along with the details of the transformation, which can lead to erroneous results when formal methods are applied. We demonstrate this problem of “forgetful” semantic anchoring using existing approaches through a translation from dataflow systems to interface automata. We then describe our modeling tool FORMULA and apply it to the same example, showing how forgetful semantic anchoring can be avoided.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124035368","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
Improving Component Dependency Resolution with Soft Constraints, Validation and Verification 利用软约束、验证和验证改进组件依赖解析
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.28
G. Jenson
{"title":"Improving Component Dependency Resolution with Soft Constraints, Validation and Verification","authors":"G. Jenson","doi":"10.1109/ASE.2009.28","DOIUrl":"https://doi.org/10.1109/ASE.2009.28","url":null,"abstract":"Software components are encapsulated units of execution which express dependencies through explicitly stated requirements and capabilities. These are used within component repositories to resolve sub-systems of deployable components. The main problem with this dependency resolution is not the lack of available solutions but the excess of them. Within current repositories the returned solution may not be optimal for the composers requirements and context. Improving dependency resolved solutions from repositories using soft constraints with validation and verification is the topic of our Ph.D. and discussed within this paper.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129665397","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
Using Spectrum-Based Fault Localization for Test Case Grouping 基于频谱的故障定位测试用例分组
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.78
Martin Weiglhofer, G. Fraser, F. Wotawa
{"title":"Using Spectrum-Based Fault Localization for Test Case Grouping","authors":"Martin Weiglhofer, G. Fraser, F. Wotawa","doi":"10.1109/ASE.2009.78","DOIUrl":"https://doi.org/10.1109/ASE.2009.78","url":null,"abstract":"Model-based test case generation allows one to derive almost arbitrary numbers of test cases from models. If resulting test suites are executed against real implementations, there are often huge numbers of failed test cases. Thus, the analysis of the test execution, i.e. the identification of failures for error reporting, becomes a tedious and time consuming task. In this paper we investigate a technique for grouping test runs that most likely reveal the same failure. This reduces the post analysis time and enables the generation of small regression test suites. The test case grouping is implemented by means of spectrum-based fault localization at the level of the specification. We calculate the grouping by relating the spectra of the test cases. Besides a brief discussion of our approach we present results of applying our approach to the Session Initiation Protocol.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130988873","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
Goal-Based Testing of Semantic Web Services 基于目标的语义Web服务测试
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.74
M. S. Jokhio, Jing Sun, G. Dobbie, Tianming Hu
{"title":"Goal-Based Testing of Semantic Web Services","authors":"M. S. Jokhio, Jing Sun, G. Dobbie, Tianming Hu","doi":"10.1109/ASE.2009.74","DOIUrl":"https://doi.org/10.1109/ASE.2009.74","url":null,"abstract":"Web services, the reusable software components, have brought automation to Internet computing. However, since they are currently described syntactically using XML standards, i.e., SOAP, WSDL and UDDI, the automation of web services tasks, e.g., web service discovery, selection, composition and execution, is still a challenge. In order to make the most of automation in Service Oriented Architecture (SOA), the concept of the semantic web services (SWS), which are described semantically using an ontology language, have been introduced. The research related to testing and quality assurance aspects of web services is not mature~cite{Tsai2008}. This is especially true for semantic web services, since research to-date has mainly focused the automation of WS tasks. Furthermore, some semantic web service frameworks promote the client-oriented SOA, by formally specifying user requirements, called ``goal specification'', and automatically resolve it by appropriate web service detection. Keeping this in mind, we propose a novel approach for testing semantic web services based on user goal specifications. We believe this type of testing would add real value to web service users, unlike tradition web service testing.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131704177","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
State-Space Coverage Estimation 状态空间覆盖估计
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.24
Ali Taleghani, J. Atlee
{"title":"State-Space Coverage Estimation","authors":"Ali Taleghani, J. Atlee","doi":"10.1109/ASE.2009.24","DOIUrl":"https://doi.org/10.1109/ASE.2009.24","url":null,"abstract":"Software model checking is the process of systematically exploring a program's state space to find hard-to-discover errors. Because of the exponential size of the state space, an exhaustive search of the state space is often impossible given the memory resources. In such cases, an estimate of how much of the state space is covered can help the verifier to decide whether to employ additional computational resources or to use more aggressive abstraction techniques. Our work focuses on coverage estimation for explicit-state model checking of software programs. In this paper, we present an estimation algorithm that is based on Monte Carlo techniques that sample the unexplored portion of the reachability graph. We implemented our algorithm in Java Pathfinder and evaluated our approach on a suite of Java programs, simulating out-of-memory errors after a known percentage of a program's state space had been searched. Our empirical studies show that, on average, our algorithm's coverage estimates differ from the actual coverage by less than 10 percentage points, with a standard deviation of about 5 percentage points - regardless of whether the actual state-space coverage is low (3%) or high (95%).","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121792384","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
A Quantum Algorithm for Software Engineering Search 软件工程搜索的量子算法
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.51
R. Hall
{"title":"A Quantum Algorithm for Software Engineering Search","authors":"R. Hall","doi":"10.1109/ASE.2009.51","DOIUrl":"https://doi.org/10.1109/ASE.2009.51","url":null,"abstract":"Quantum computers can solve a few basic problems, such as factoring an integer and searching a database, much faster than classical computers. However, the complexity of software artifacts, and the types of questions software engineers ask about them, pose significant challenges for applying existing quantum approaches to software engineering search (SES) problems. This paper first describes a new quantum search algorithm, IDGS-FA, whose design is motivated by the characteristics of SES problems. Next, it describes how to apply quantum searching to three SES problems: FSM property checking, software test generation, and library-based software synthesis. Next, the paper gives the main ideas in QSAT, a novel toolkit supporting efficient simulation of the algorithms and applications discussed. Finally, it concludes with a substantial simulation-based study of IDGS-FA, showing that it improves both the reliability and speed of other approaches.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124906143","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}
引用次数: 3
Reducing Features to Improve Bug Prediction 减少功能以改进Bug预测
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.76
S. Shivaji, E. James Whitehead Jr., R. Akella, Sunghun Kim
{"title":"Reducing Features to Improve Bug Prediction","authors":"S. Shivaji, E. James Whitehead Jr., R. Akella, Sunghun Kim","doi":"10.1109/ASE.2009.76","DOIUrl":"https://doi.org/10.1109/ASE.2009.76","url":null,"abstract":"Recently, machine learning classifiers have emerged as a way to predict the existence of a bug in a change made to a source code file. The classifier is first trained on software history data, and then used to predict bugs. Two drawbacks of existing classifier-based bug prediction are potentially insufficient accuracy for practical use, and use of a large number of features. These large numbers of features adversely impact scalability and accuracy of the approach. This paper proposes a feature selection technique applicable to classification-based bug prediction. This technique is applied to predict bugs in software changes, and performance of Naive Bayes and Support Vector Machine (SVM) classifiers is characterized.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121274329","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}
引用次数: 106
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学术官方微信
小红书