2012 34th International Conference on Software Engineering (ICSE)最新文献_第2页

HARPPIE: Hyper algorithmic recipe for productive parallelism intensive endeavors HARPPIE:高效并行密集型工作的超级算法配方

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227037

Pedro Monteiro

引用次数: 1

Reconciling manual and automatic refactoring 协调手动重构和自动重构

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227192

Xi Ge, Quinton L. DuBose, E. Murphy-Hill

引用次数: 117

Search based design of software product lines architectures 基于搜索的软件产品线架构设计

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227050

T. Colanzi

引用次数: 13

ConTexter feedback system 情境反馈系统

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227065

Tristan Wehrmaker, Stefan Gärtner, K. Schneider

引用次数: 14

Behavioral validation of JFSL specifications through model synthesis 通过模型综合对JFSL规范进行行为验证

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227126

C. Ghezzi, Andrea Mocci

引用次数: 2

Stack layout transformation: Towards diversity for securing binary programs 堆栈布局转换:实现二进制程序安全的多样性

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227041

Benjamin D. Rodes

引用次数: 8

SDiC: Context-based retrieval in Eclipse SDiC: Eclipse中基于上下文的检索

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227061

B. Antunes, J. Cordeiro, Paulo Gomes

引用次数: 2

CBCD: Cloned buggy code detector CBCD:克隆错误代码检测器

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227183

Jingyue Li, Michael D. Ernst

{"title":"CBCD: Cloned buggy code detector","authors":"Jingyue Li, Michael D. Ernst","doi":"10.1109/ICSE.2012.6227183","DOIUrl":"https://doi.org/10.1109/ICSE.2012.6227183","url":null,"abstract":"Developers often copy, or clone, code in order to reuse or modify functionality. When they do so, they also clone any bugs in the original code. Or, different developers may independently make the same mistake. As one example of a bug, multiple products in a product line may use a component in a similar wrong way. This paper makes two contributions. First, it presents an empirical study of cloned buggy code. In a large industrial product line, about 4% of the bugs are duplicated across more than one product or file. In three open source projects (the Linux kernel, the Git version control system, and the PostgreSQL database) we found 282, 33, and 33 duplicated bugs, respectively. Second, this paper presents a tool, CBCD, that searches for code that is semantically identical to given buggy code. CBCD tests graph isomorphism over the Program Dependency Graph (PDG) representation and uses four optimizations. We evaluated CBCD by searching for known clones of buggy code segments in the three projects and compared the results with text-based, token-based, and AST-based code clone detectors, namely Simian, CCFinder, Deckard, and CloneDR. The evaluation shows that CBCD is fast when searching for possible clones of the buggy code in a large system, and it is more precise for this purpose than the other code clone detectors.","PeriodicalId":420187,"journal":{"name":"2012 34th International Conference on Software Engineering (ICSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130468323","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}

引用次数: 130

Automating test automation 自动化测试自动化

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227131

Suresh Thummalapenta, S. Sinha, N. Singhania, S. Chandra

{"title":"Automating test automation","authors":"Suresh Thummalapenta, S. Sinha, N. Singhania, S. Chandra","doi":"10.1109/ICSE.2012.6227131","DOIUrl":"https://doi.org/10.1109/ICSE.2012.6227131","url":null,"abstract":"Mention “test case”, and it conjures up the image of a script or a program that exercises a system under test. In industrial practice, however, test cases often start out as steps described in natural language. These are essentially directions a human tester needs to follow to interact with an application, exercising a given scenario. Since tests need to be executed repeatedly, such manual tests then have to go through test automation to create scripts or programs out of them. Test automation can be expensive in programmer time. We describe a technique to automate test automation. The input to our technique is a sequence of steps written in natural language, and the output is a sequence of procedure calls with accompanying parameters that can drive the application without human intervention. The technique is based on looking at the natural language test steps as consisting of segments that describe actions on targets, except that there can be ambiguity in identifying segments, in identifying the action in a segment, as well as in the specification of the target of the action. The technique resolves this ambiguity by backtracking, until it can synthesize a successful sequence of calls. We present an evaluation of our technique on professionally created manual test cases for two open-source web applications as well as a proprietary enterprise application. Our technique could automate over 82% of the steps contained in these test cases with no human intervention, indicating that the technique can reduce the cost of test automation quite effectively.","PeriodicalId":420187,"journal":{"name":"2012 34th International Conference on Software Engineering (ICSE)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974289","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}

引用次数: 86

Symbiotic general-purpose and domain-specific languages 共生的通用语言和领域特定语言

2012 34th International Conference on Software Engineering (ICSE) Pub Date : 2012-06-02 DOI: 10.1109/ICSE.2012.6227102

C. Atkinson, Ralph Gerbig, Bastian Kennel

{"title":"Symbiotic general-purpose and domain-specific languages","authors":"C. Atkinson, Ralph Gerbig, Bastian Kennel","doi":"10.1109/ICSE.2012.6227102","DOIUrl":"https://doi.org/10.1109/ICSE.2012.6227102","url":null,"abstract":"Domain-Specific Modeling Languages (DSMLs) have received great attention in recent years and are expected to play a big role in the future of software engineering as processes become more view-centric. However, they are a “two-edged sword”. While they provide strong support for communication within communities, allowing experts to express themselves using concepts tailored to their exact needs, they are a poor vehicle for communication across communities because of their lack of common, transcending concepts. In contrast, General-Purpose Modeling Languages (GPMLs) have the opposite problem - they are poor at the former but good at the latter. The value of models in software engineering would therefore be significantly boosted if the advantages of DSMLs and GPMLs could be combined and models could be viewed in a domain-specific or general-purpose way depending on the needs of the user. In this paper we present an approach for achieving such a synergy based on the orthogonal classification architecture. In this architecture model elements have two classifiers: a linguistic one representing their “general-purpose” and an ontological one representing their “domain-specific” type. By associating visualization symbols with both classifiers it is possible to support two concrete syntaxes at the same time and allow the domain-specific and general-purpose notation to support each other - that is, to form a symbiotic relationship.","PeriodicalId":420187,"journal":{"name":"2012 34th International Conference on Software Engineering (ICSE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133497126","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}

引用次数: 19