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

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

筛选
英文 中文
Efficient Formalism-Independent Monitoring of Parametric Properties 参数性质的有效形式独立监测
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.50
Feng Chen, P. Meredith, Dongyun Jin, Grigore Roşu
{"title":"Efficient Formalism-Independent Monitoring of Parametric Properties","authors":"Feng Chen, P. Meredith, Dongyun Jin, Grigore Roşu","doi":"10.1109/ASE.2009.50","DOIUrl":"https://doi.org/10.1109/ASE.2009.50","url":null,"abstract":"Parametric properties provide an effective and natural means to describe object-oriented system behaviors, where the parameters are typed by classes and bound to object instances at runtime. Efficient monitoring of parametric properties, in spite of increasingly growing interest due to applications such as testing and security, imposes a highly non-trivial challenge on monitoring approaches due to the potentially huge number of parameter instances. Existing solutions usually compromise their expressiveness for performance or vice versa. In this paper, we propose a generic, in terms of specification formalism, yet efficient, solution to monitoring parametric specifications. Our approach is based on a general algorithm for slicing parametric traces and makes use of {em static} knowledge about the desired property to optimize monitoring. The needed knowledge is not specific to the underlying formalism and can be easily computed when generating monitoring code from the property. Our approach works with any specification formalism, providing better and extensible expressiveness. Also, a thorough evaluation shows that our technique outperforms other state-of-art techniques optimized for particular logics or properties.","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":"123805241","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}
引用次数: 38
Automatically Recommending Triage Decisions for Pragmatic Reuse Tasks 为实用重用任务自动推荐分类决策
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.65
Reid Holmes, Tristan Ratchford, M. Robillard, R. Walker
{"title":"Automatically Recommending Triage Decisions for Pragmatic Reuse Tasks","authors":"Reid Holmes, Tristan Ratchford, M. Robillard, R. Walker","doi":"10.1109/ASE.2009.65","DOIUrl":"https://doi.org/10.1109/ASE.2009.65","url":null,"abstract":"Planning a complex software modification task imposes a high cognitive burden on developers, who must juggle navigating the software, understanding what they see with respect to their task, and deciding how their task should be performed given what they have discovered. Pragmatic reuse tasks, where source code is reused in a white-box fashion, is an example of a complex and error-prone modification task: the developer must plan out which portions of a system to reuse, extract the code, and integrate it into their own system. In this paper we present a recommendation system that automates some aspects of the planning process undertaken by developers during pragmatic reuse tasks. In a retroactive evaluation, we demonstrate that our technique was able to provide the correct recommendation 64% of the time and was incorrect 25% of the time. Our case study suggests that developer investigative behaviour is positively influenced by the use of the recommendation system.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"56 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":"114968241","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}
引用次数: 17
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time 基于缓存的网络应用模型检验:从线性时间到分支时间
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.43
Cyrille Artho, Watcharin Leungwattanakit, M. Hagiya, Yoshinori Tanabe, M. Yamamoto
{"title":"Cache-Based Model Checking of Networked Applications: From Linear to Branching Time","authors":"Cyrille Artho, Watcharin Leungwattanakit, M. Hagiya, Yoshinori Tanabe, M. Yamamoto","doi":"10.1109/ASE.2009.43","DOIUrl":"https://doi.org/10.1109/ASE.2009.43","url":null,"abstract":"Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such systems. However, a simple state space exploration scheme is not applicable, as backtracking results in repeated communication operations. A cache-based approach solves this problem by hiding redundant communication operations from the environment. In this work, we propose a change from a linear-time to a branching-time cache, allowing us to relax restrictions in previous work regarding communication traces that differ between schedules. We successfully applied the new algorithm to real-life programs where a previous solution is not applicable.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"28 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":"116959855","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}
引用次数: 28
An Automated Passive Testing Approach for the IMS PoC Service IMS PoC服务的自动被动测试方法
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.33
F. Lalanne, S. Maag, Edgardo Montes de Oca, A. Cavalli, Wissam Mallouli, A. Gonguet
{"title":"An Automated Passive Testing Approach for the IMS PoC Service","authors":"F. Lalanne, S. Maag, Edgardo Montes de Oca, A. Cavalli, Wissam Mallouli, A. Gonguet","doi":"10.1109/ASE.2009.33","DOIUrl":"https://doi.org/10.1109/ASE.2009.33","url":null,"abstract":"Although the adoption of the IP Multimedia Subsystem (IMS) keeps growing, IMS applications are often integrated to the system without being formally tested. In this work, we are interested in the IMS Push over Cellular (PoC) service, an OMA standard. We propose a conformance passive testing approach to check that its implementation respects the main standard requirements. This approach is based on a set of formal invariants representing the most relevant expected properties to be tested. Two testing phases are applied: the verification of the invariants against the service specification and their testing on the PoC collected execution traces.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"436 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":"127603747","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
Applications of Simulation and AI Search: Assessing the Relative Merits of Agile vs Traditional Software Development 模拟和人工智能搜索的应用:评估敏捷与传统软件开发的相对优点
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.42
Bryan Lemon, Aaron Riesbeck, T. Menzies, Justin Price, Joseph D'Alessandro, Rikard Carlsson, Tomi Prifiti, Fayola Peters, Huihua Lu, D. Port
{"title":"Applications of Simulation and AI Search: Assessing the Relative Merits of Agile vs Traditional Software Development","authors":"Bryan Lemon, Aaron Riesbeck, T. Menzies, Justin Price, Joseph D'Alessandro, Rikard Carlsson, Tomi Prifiti, Fayola Peters, Huihua Lu, D. Port","doi":"10.1109/ASE.2009.42","DOIUrl":"https://doi.org/10.1109/ASE.2009.42","url":null,"abstract":"This paper augments Boehm-Turner's model of agile and plan-based software development augmented with an AI search algorithm. The AI search finds the key factors that predict for the success of agile or traditional plan-based software developments. According to our simulations and AI search algorithm: (1) in no case did agile methods perform worse than plan-based approaches; (2) in some cases, agile performed best. Hence, we recommend that the default development practice for organizations be an agile method. The simplicity of this style of analysis begs the question: why is so much time wasted on evidence-less debates on software process when a simple combination of simulation plus automatic search can mature the dialog much faster?","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"26 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":"125287078","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
Specification and Control of Interface Responses to User Input in Rich Internet Applications 富互联网应用程序中用户输入界面响应的规范和控制
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.10
Matthias Book, Tobias Brückmann, V. Gruhn, Malte Hülder
{"title":"Specification and Control of Interface Responses to User Input in Rich Internet Applications","authors":"Matthias Book, Tobias Brückmann, V. Gruhn, Malte Hülder","doi":"10.1109/ASE.2009.10","DOIUrl":"https://doi.org/10.1109/ASE.2009.10","url":null,"abstract":"The complexity of data-intensive business processes is typically reflected in the user interfaces of the information systems supporting them. To facilitate ease of use despite the visual and semantic complexity of dialog forms, users should be guided in ways such as highlighting and describing invalid input, showing/hiding or enabling/disabling particular UI widgets. Manual implementation of the rules governing these user interface responses typically requires considerable effort, as they involve business and presentation concerns, and are often dependent on each other. In addition, users expect the interface to respond immediately to any input, which can be especially challenging in web applications. In this paper, we formalize the aspects that must be considered in formulating input evaluation rules, and present a run-time framework that encapsulates the necessary logic, enabling domain experts to specify the business rules instead of requiring developers to implement them.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"7 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":"126365891","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
Cluster-Based I/O-Efficient LTL Model Checking 基于集群的I/ o高效LTL模型检查
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.32
J. Barnat, L. Brim, P. Simecek
{"title":"Cluster-Based I/O-Efficient LTL Model Checking","authors":"J. Barnat, L. Brim, P. Simecek","doi":"10.1109/ASE.2009.32","DOIUrl":"https://doi.org/10.1109/ASE.2009.32","url":null,"abstract":"I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity RAM. On the other hand, parallel algorithms are used to accelerate the computation and their usage may significantly increase the amount of available RAM memory if clusters of computers are involved. Since both the large amount of memory and high speed computation are desired in verification of large-scale industrial systems, extending I/O-efficient model checking to work over a network of computers can bring substantial benefits. In this paper we propose an explicit state cluster-based I/O efficient LTL model checking algorithm that is capable to verify systems with approximately $10^{10}$ states within hours.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"22 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":"127361996","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
Automated Comprehension Tasks in Software Exploration 软件探索中的自动理解任务
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.47
Sandro Boccuzzo, H. Gall
{"title":"Automated Comprehension Tasks in Software Exploration","authors":"Sandro Boccuzzo, H. Gall","doi":"10.1109/ASE.2009.47","DOIUrl":"https://doi.org/10.1109/ASE.2009.47","url":null,"abstract":"Finding issues in software usually requires a serie of comprehension tasks. After every task, an engineer explores the results and decides whether further tasks are required. Software comprehension therefore is a combination of tasks and a supported exploration of the results typically in an adequate visualization. In this paper, we describe how we simplify the combination of existing automated procedures to sequentially solve common software comprehension tasks. Beyond that we improve the understanding of the outcomes with interactive and explorative visualization concepts in a time efficient workflow. We validate the presented concept with basic comprehension tasks in an extended CocoViz tool implementation.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"1 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":"131095566","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
Model-Based Customization and Deployment of Eclipse-Based Tools: Industrial Experiences 基于模型的定制和基于eclipse的工具的部署:工业经验
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.11
P. Grünbacher, Rick Rabiser, Deepak Dhungana, Martin Lehofer
{"title":"Model-Based Customization and Deployment of Eclipse-Based Tools: Industrial Experiences","authors":"P. Grünbacher, Rick Rabiser, Deepak Dhungana, Martin Lehofer","doi":"10.1109/ASE.2009.11","DOIUrl":"https://doi.org/10.1109/ASE.2009.11","url":null,"abstract":"Developers of software engineering tools are facing high expectations regarding capabilities and usability. Users expect tools tailored to their specific needs and integrated in their working environment. This increases tools' complexity and complicates their customization and deployment despite available mechanisms for adaptability and extensibility. A main challenge lies in understanding and managing the dependencies between different technical mechanisms for realizing tool variability. We report on industrial experiences of applying a model-based and tool-supported product line approach for the customization and deployment of two Eclipse-based tools. We illustrate challenges of customizing these tools to different development contexts: In the first case study we developed variability models of a product line tool suite used by an industry partner and utilized these models for tool customization and deployment. In the second case study we applied the same approach to a maintenance and setup tool of our industry partner. Our experiences suggest to design software tools as product lines; to formally describe the tools' variability in models; and to provide end-user capabilities for customizing and deploying the tools.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"74 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":"127123574","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}
引用次数: 39
A Petri Net Based Debugging Environment for QVT Relations 基于Petri网的QVT关系调试环境
2009 IEEE/ACM International Conference on Automated Software Engineering Pub Date : 2009-11-16 DOI: 10.1109/ASE.2009.99
M. Wimmer, G. Kappel, J. Schönböck, A. Kusel, W. Retschitzegger, W. Schwinger
{"title":"A Petri Net Based Debugging Environment for QVT Relations","authors":"M. Wimmer, G. Kappel, J. Schönböck, A. Kusel, W. Retschitzegger, W. Schwinger","doi":"10.1109/ASE.2009.99","DOIUrl":"https://doi.org/10.1109/ASE.2009.99","url":null,"abstract":"In the Model-Driven Architecture (MDA) paradigm the Query/View/Transformation (QVT) standard plays a vital role for model transformations. Especially the high-level declarative QVT Relations language, however, has not yet gained widespread use in practice. This is not least due to missing tool support in general and inadequate debugging support in particular. Transformation engines interpreting QVT Relations operate on a low level of abstraction, hide the operational semantics of a transformation and scatter metamodels, models, QVT code, and trace information across different artifacts. We therefore propose a model-based debugger representing QVT Relations on bases of TROPIC, a model transformation language utilizing a variant of Colored Petri Nets (CPNs). As a prerequisite for convenient debugging, TROPIC provides a homogeneous view on all artifacts of a transformation on basis of a single formalism. Besides that, this formalism also provides a runtime model, thus making the afore hidden operational semantics of the transformation explicit. Using an explicit runtime model allows to employ model-based techniques for debugging, e.g., using the Object Constraint Language (OCL) for simply defining breakpoints and querying the execution state of a transformation.","PeriodicalId":320607,"journal":{"name":"2009 IEEE/ACM International Conference on Automated Software Engineering","volume":"1 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":"132969182","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}
引用次数: 29
首页 上一页 下一页 尾页
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学术官方微信
小红书