21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)最新文献_第2页

Sieve: A Tool for Automatically Detecting Variations Across Program Versions 筛:一个自动检测程序版本变化的工具

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.61

M. Ramanathan, A. Grama, S. Jagannathan

{"title":"Sieve: A Tool for Automatically Detecting Variations Across Program Versions","authors":"M. Ramanathan, A. Grama, S. Jagannathan","doi":"10.1109/ASE.2006.61","DOIUrl":"https://doi.org/10.1109/ASE.2006.61","url":null,"abstract":"Software systems often undergo many revisions during their lifetime as new features are added, bugs repaired, abstractions simplified and refactored, and performance improved. When a revision, even a minor one, does occur, the changes it induces must be tested to ensure that invariants assumed in the original version are not violated unintentionally. In order to avoid testing components that are unchanged across revisions, impact analysis is often used to identify code blocks or functions that are affected by a change. In this paper, we present a novel solution to this general problem that uses dynamic programming on instrumented traces of different program binaries to identify longest common subsequences in strings generated by these traces. Our formulation allows us to perform impact analysis and also to detect the smallest set of locations within the functions where the effect of the changes actually manifests itself. Sieve is a tool that incorporates these ideas. Sieve is unobtrusive, requiring no programmer or compiler intervention to guide its behavior. Our experiments on multiple versions of op ensource C programs shows that Sieve is an effective and scalable tool to identify impact sets and can locate regions in the affected functions where the changes manifest. These results lead us to conclude that Sieve can play a beneficial role in program testing and software maintenance","PeriodicalId":403196,"journal":{"name":"21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114816916","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}

引用次数: 44

Effective Generation of Interface Robustness Properties for Static Analysis 静态分析中接口鲁棒性的有效生成

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.35

Mithun P. Acharya, Tanu Sharma, Jun Xu, Tao Xie

引用次数: 10

Using communicative acts in interaction design specifications for automated synthesis of user interfaces 在交互设计规范中使用交流行为来自动合成用户界面

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.71

Jürgen Falb, Thomas Röck, Edin Arnautovic

引用次数: 20

Annotation Inference for Safety Certification of Automatically Generated Code (Extended Abstract) 自动生成代码安全认证的标注推理(扩展摘要)

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.15

E. Denney, B. Fischer

{"title":"Annotation Inference for Safety Certification of Automatically Generated Code (Extended Abstract)","authors":"E. Denney, B. Fischer","doi":"10.1109/ASE.2006.15","DOIUrl":"https://doi.org/10.1109/ASE.2006.15","url":null,"abstract":"Automated code generation is an enabling technology for model-based software development and promises many benefits, including higher quality and reduced turn-around times. However, the key to realizing these benefits is generator correctness: nothing is gained from replacing manual coding errors with automatic coding errors. In this paper, we describe an alternative technique that uses a generic post-generation annotation inference algorithm. We exploit both the highly idiomatic structure of automatically generated code and the restriction to specific safety properties. Since generated code only constitutes a limited subset of all possible programs, the new \"eureka\" insights required in general remain rare in our case. Since safety properties are simpler than full functional correctness, the required annotations are also simpler and more regular. We can thus use patterns to describe all code constructs that require annotations and templates to describe the required annotations. We use techniques similar to aspect-oriented programming to add the annotations to the generated code: the patterns correspond to (static) point-cut descriptors, while the introduced annotations correspond to advice. The annotation inference algorithm can run completely separately from the generator and is generic with respect to the safety property, although we use initialization safety as running example here. It has been implemented and applied to certify initialization safety for code generated by Auto-Bayes and AutoFilter","PeriodicalId":403196,"journal":{"name":"21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121593843","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

LSS: A Tool for Large Scale Scenarios LSS:大规模场景的工具

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.47

R. Hall

{"title":"LSS: A Tool for Large Scale Scenarios","authors":"R. Hall","doi":"10.1109/ASE.2006.47","DOIUrl":"https://doi.org/10.1109/ASE.2006.47","url":null,"abstract":"Today's complex computational and embedded systems compute complex quantities from complex inputs, with behavior dependent upon the (distributed) state of the system and its environment. Describing the intended behavior of such a system is challenging. The most natural and commonly used approach is to give a collection of scenarios, where each scenario is a sequence of inputs and expected outputs. An analyst elicits scenarios from subject matter experts (SMEs) to document functional requirements. Scenarios can be represented in a variety of ways, from informal narratives through (formal) linear event sequences. Formal behavior scenarios are useful in many software engineering tasks, including requirements engineering, specification- and architectural-modeling, and test generation. Uses in modeling include model inference, validation, and measuring resource usage and reliability. Finally, scenarios are useful in discovering and documenting gaps in specifications. Existing scenario-based tools and methodologies break down when scenarios grow large. Elicitation becomes impractical, as it requires the human to specify all the steps. Even assuming one can capture thousands or more of input events, it is problematic for the human to describe the correct expected outputs at each point of interest. Finally, even if one can capture all inputs and outputs, the complexity of such an artifact gives one little confidence that it represents desirable behavior in detail, as the risk of undetected errors grows at least linearly with the size. Finally, the behavior of systems described by large scale scenarios typically requires a large and complex set of them, which creates the added difficulty of assuring oneself of covering a \"representative\" subset of a huge space","PeriodicalId":403196,"journal":{"name":"21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)","volume":"784 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133216920","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}

引用次数: 4

Automatic Identification of Bug-Introducing Changes 自动识别引入bug的更改

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.23

Sunghun Kim, Thomas Zimmermann, Kai Pan, E. James Jr. Whitehead

引用次数: 312

Japanese Workshop on Leveraging Web2.0 Technologies in Software Development Environments (WebSDE) 在软件开发环境中利用Web2.0技术日本研讨会

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.45

Katsuhisa Maruyama, M. Matsushita, Shinichirou Yamamoto

引用次数: 2

Integrating and Scheduling an Open Set of Static Analyses 集成和调度一个开放的静态分析集

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.43

Michael Eichberg, M. Mezini, S. Kloppenburg, K. Ostermann, Benjamin Rank

引用次数: 8

Reverse Engineering of Design Patterns from Java Source Code 从Java源代码的设计模式逆向工程

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.57

N. Shi, R. Olsson

引用次数: 226

Managing the Complexity of Large Free and Open Source Package-Based Software Distributions 管理大型免费和开源软件包软件发行版的复杂性

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06) Pub Date : 2006-09-18 DOI: 10.1109/ASE.2006.49

F. Mancinelli, J. Boender, R. D. Cosmo, Jérôme Vouillon, Berke O. A. Durak, X. Leroy, R. Treinen

{"title":"Managing the Complexity of Large Free and Open Source Package-Based Software Distributions","authors":"F. Mancinelli, J. Boender, R. D. Cosmo, Jérôme Vouillon, Berke O. A. Durak, X. Leroy, R. Treinen","doi":"10.1109/ASE.2006.49","DOIUrl":"https://doi.org/10.1109/ASE.2006.49","url":null,"abstract":"The widespread adoption of free and open source software (FOSS) in many strategic contexts of the information technology society has drawn the attention on the issues regarding how to handle the complexity of assembling and managing a huge number of (packaged) components in a consistent and effective way. FOSS distributions (and in particular GNU/Linux-based ones) have always provided tools for managing the tasks of installing, removing and upgrading the (packaged) components they were made of While these tools provide a (not always effective) way to handle these tasks on the client side, there is still a lack of tools that could help the distribution editors to maintain, on the server side, large and high-quality distributions. In this paper we present our research whose main goal is to fill this gap: we show our approach, the tools we have developed and their application with experimental results. Our contribution provides an effective and automatic way to support distribution editors in handling those issues that were, until now, mostly addressed using ad-hoc tools and manual techniques","PeriodicalId":403196,"journal":{"name":"21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127949090","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}

引用次数: 166