ESEC/FSE 2013最新文献

Feature model extraction from large collections of informal product descriptions 从大量非正式产品描述中提取特征模型

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2491455

J. Davril, Edouard Delfosse, N. Hariri, M. Acher, J. Cleland-Huang, P. Heymans

引用次数: 150

Towards open architecture system 走向开放式体系结构

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2492407

Bahtijar Vogel

引用次数: 5

Second-order constraints in dynamic invariant inference 动态不变推理中的二阶约束

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2491457

K. Li, Christoph Reichenbach, Y. Smaragdakis, M. Young

{"title":"Second-order constraints in dynamic invariant inference","authors":"K. Li, Christoph Reichenbach, Y. Smaragdakis, M. Young","doi":"10.1145/2491411.2491457","DOIUrl":"https://doi.org/10.1145/2491411.2491457","url":null,"abstract":"The current generation of dynamic invariant detectors often produce invariants that are inconsistent with program semantics or programmer knowledge. We improve the consistency of dynamically discovered invariants by taking into account higher-level constraints. These constraints encode knowledge about invariants, even when the invariants themselves are unknown. For instance, even though the invariants describing the behavior of two functions f1 and f2 may be unknown, we may know that any valid input for f1 is also valid for f2, i.e., the precondition of f1 implies that of f2. We explore techniques for expressing and employing such consistency constraints to improve the quality of produced invariants. We further introduce techniques for dynamically discovering potential second-order constraints that the programmer can subsequently approve or reject. \u0000 Our implementation builds on the Daikon tool, with a vocabulary of constraints that the programmer can use to enhance and constrain Daikon’s inference. We show that dynamic inference of second-order constraints together with minimal human effort can significantly influence the produced (first-order) invariants even in systems of substantial size, such as the Apache Commons Collections and the AspectJ compiler. We also find that 99% of the dynamically inferred second-order constraints we sampled are true.","PeriodicalId":254005,"journal":{"name":"ESEC/FSE 2013","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114909914","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}

引用次数: 10

Jalangi: a selective record-replay and dynamic analysis framework for JavaScript Jalangi: JavaScript的选择性记录重放和动态分析框架

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2491447

Koushik Sen, Swaroop Kalasapur, T. Brutch, S. Gibbs

{"title":"Jalangi: a selective record-replay and dynamic analysis framework for JavaScript","authors":"Koushik Sen, Swaroop Kalasapur, T. Brutch, S. Gibbs","doi":"10.1145/2491411.2491447","DOIUrl":"https://doi.org/10.1145/2491411.2491447","url":null,"abstract":"JavaScript is widely used for writing client-side web applications and is getting increasingly popular for writing mobile applications. However, unlike C, C++, and Java, there are not that many tools available for analysis and testing of JavaScript applications. In this paper, we present a simple yet powerful framework, called Jalangi, for writing heavy-weight dynamic analyses. Our framework incorporates two key techniques: 1) selective record-replay, a technique which enables to record and to faithfully replay a user-selected part of the program, and 2) shadow values and shadow execution, which enables easy implementation of heavy-weight dynamic analyses. Our implementation makes no special assumption about JavaScript, which makes it applicable to real-world JavaScript programs running on multiple platforms. We have implemented concolic testing, an analysis to track origins of nulls and undefined, a simple form of taint analysis, an analysis to detect likely type inconsistencies, and an object allocation profiler in Jalangi. Our evaluation of Jalangi on the SunSpider benchmark suite and on five web applications shows that Jalangi has an average slowdown of 26X during recording and 30X slowdown during replay and analysis. The slowdowns are comparable with slowdowns reported for similar tools, such as PIN and Valgrind for x86 binaries. We believe that the techniques proposed in this paper are applicable to other dynamic languages.","PeriodicalId":254005,"journal":{"name":"ESEC/FSE 2013","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122718111","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}

引用次数: 273

Distributed program tracing 分布式程序跟踪

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2491451

Diptikalyan Saha, P. Dhoolia, G. Paul

{"title":"Distributed program tracing","authors":"Diptikalyan Saha, P. Dhoolia, G. Paul","doi":"10.1145/2491411.2491451","DOIUrl":"https://doi.org/10.1145/2491411.2491451","url":null,"abstract":"Dynamic program analysis techniques depend on accurate program traces. Program instrumentation is commonly used to collect these traces, which causes overhead to the program execution. Various techniques have addressed this problem by minimizing the number of probes/witnesses used to collect traces. In this paper, we present a novel distributed trace collection framework wherein, a program is executed multiple times with the same input for different sets of witnesses. The partial traces such obtained are then merged to create the whole program trace. Such divide-and-conquer strategy enables parallel collection of partial traces, thereby reducing the total time of collection. The problem is particularly challenging as arbitrary distribution of witnesses cannot guarantee correct formation of traces. We provide and prove a necessary and sufficient condition for distributing the witnesses which ensures correct formation of trace. Moreover, we describe witness distribution strategies that are suitable for parallel collection. We use the framework to collect traces of field SAP-ABAP programs using breakpoints as witnesses as instrumentation cannot be performed due to practical constraints. To optimize such collection, we extend Ball-Larus' optimal edge-based profiling algorithm to an optimal node-based algorithm. We demonstrate the effectiveness of the framework for collecting traces of SAP-ABAP programs.","PeriodicalId":254005,"journal":{"name":"ESEC/FSE 2013","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122932598","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

SocialCDE: a social awareness tool for global software teams SocialCDE:面向全球软件团队的社会意识工具

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2494592

Fabio Calefato, F. Lanubile

引用次数: 17

An empirical analysis of the co-evolution of schema and code in database applications 数据库应用中模式与代码协同演化的实证分析

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2491431

Dong Qiu, Bixin Li, Z. Su

{"title":"An empirical analysis of the co-evolution of schema and code in database applications","authors":"Dong Qiu, Bixin Li, Z. Su","doi":"10.1145/2491411.2491431","DOIUrl":"https://doi.org/10.1145/2491411.2491431","url":null,"abstract":"Modern database applications are among the most widely used and complex software systems. They constantly evolve, responding to changes to data, database schemas, and code. It is challenging to manage these changes and ensure that everything co-evolves consistently. For example, when a database schema is modified, all the code that interacts with the database must be changed accordingly. Although database evolution and software evolution have been extensively studied in isolation, the co-evolution of schema and code has largely been unexplored. \u0000 This paper presents the first comprehensive empirical analysis of the co-evolution of database schemas and code in ten popular large open-source database applications, totaling over 160K revisions. Our major findings include: 1) Database schemas evolve frequently during the application lifecycle, exhibiting a variety of change types with similar distributions across the studied applications; 2) Overall, schema changes induce significant code-level modifications, while certain change types have more impact on code than others; and 3) Co-change analyses can be viable to automate or assist with database application evolution. We have also observed that: 1) 80% of the schema changes happened in 20-30% of the tables, while nearly 40% of the tables did not change; and 2) Referential integrity constraints and stored procedures are rarely used in our studied subjects. We believe that our study reveals new insights into how database applications evolve and useful guidelines for designing assistive tools to aid their evolution.","PeriodicalId":254005,"journal":{"name":"ESEC/FSE 2013","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597996","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}

引用次数: 87

Crossing the gap from imperative to functional programming through refactoring 通过重构跨越从命令式编程到函数式编程的鸿沟

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2491461

A. Gyori, Lyle Franklin, Danny Dig, J. Lahoda

引用次数: 55

Z3-str: a z3-based string solver for web application analysis Z3-str:用于web应用程序分析的基于z3的字符串求解器

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2491456

Yunhui Zheng, X. Zhang, Vijay Ganesh

{"title":"Z3-str: a z3-based string solver for web application analysis","authors":"Yunhui Zheng, X. Zhang, Vijay Ganesh","doi":"10.1145/2491411.2491456","DOIUrl":"https://doi.org/10.1145/2491411.2491456","url":null,"abstract":"Analyzing web applications requires reasoning about strings and non-strings cohesively. Existing string solvers either ignore non-string program behavior or support limited set of string operations. In this paper, we develop a general purpose string solver, called Z3-str, as an extension of the Z3 SMT solver through its plug-in interface. Z3-str treats strings as a primitive type, thus avoiding the inherent limitations observed in many existing solvers that encode strings in terms of other primitives. The logic of the plug-in has three sorts, namely, bool, int and string. The string-sorted terms include string constants and variables of arbitrary length, with functions such as concatenation, sub-string, and replace. The int-sorted terms are standard, with the exception of the length function over string terms. The atomic formulas are equations over string terms, and (in)-equalities over integer terms. Not only does our solver have features that enable whole program symbolic, static and dynamic analysis, but also it performs better than other solvers in our experiments. The application of Z3-str in remote code execution detection shows that its support of a wide spectrum of string operations is key to reducing false positives.","PeriodicalId":254005,"journal":{"name":"ESEC/FSE 2013","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121382427","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}

引用次数: 258

Using topic models to understand the evolution of a software ecosystem 使用主题模型来理解软件生态系统的演变

ESEC/FSE 2013 Pub Date : 2013-08-18 DOI: 10.1145/2491411.2492402

Nicolás López

引用次数: 5