2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)最新文献

Proteum/FL: A tool for localizing faults using mutation analysis Proteum/FL:一种利用突变分析定位故障的工具

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648189

Mike Papadakis, M. Delamaro, Yves Le Traon

引用次数: 15

JSNOSE: Detecting JavaScript Code Smells JSNOSE:检测JavaScript代码气味

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648192

A. M. Fard, A. Mesbah

引用次数: 119

Aspectual source code analysis with GASR 方面的源代码分析与GASR

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648184

J. Fabry, Coen De Roover, V. Jonckers

{"title":"Aspectual source code analysis with GASR","authors":"J. Fabry, Coen De Roover, V. Jonckers","doi":"10.1109/SCAM.2013.6648184","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648184","url":null,"abstract":"To be able to modularize crosscutting concerns, aspects introduce new programming language features, often in a new language, with a specific syntax. These new features lead to new needs for source code analysis tools, resulting in the requirement for a general-purpose aspectual source code analysis tool. Ignoring this requirement has led to a nontrivial duplication of effort in the aspect-oriented software development community. This is because all code analysis efforts that we are aware of have either built ad-hoc analysis tools or were performed manually. In this paper we present Gasr: a source code analysis tool in the tradition of logic program querying that reasons over AspectJ source code. By hooking into the IDE plugins for AspectJ, Gasr provides a library of predicates that can be used to query aspectual source code. We demonstrate the use of Gasr by automating the recognition of a number of previously identified aspectual source code assumptions. We then detect assumption instances on two well-known case studies that were manually investigated in the earlier work. In addition to finding the already known aspect assumptions, Gasr encounters assumption instances that were overlooked before.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130214117","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

Fix-it: An extensible code auto-fix component in Review Bot Fix-it: Review Bot中一个可扩展的代码自动修复组件

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648198

Vipin Balachandran

{"title":"Fix-it: An extensible code auto-fix component in Review Bot","authors":"Vipin Balachandran","doi":"10.1109/SCAM.2013.6648198","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648198","url":null,"abstract":"Coding standard violations, defect patterns and non-conformance to best practices are abundant in checked-in source code. This often leads to unmaintainable code and potential bugs in later stages of software life cycle. It is important to detect and correct these issues early in the development cycle, when it is less expensive to fix. Even though static analysis techniques such as tool-assisted code review are effective in addressing this problem, there is significant amount of human effort involved in identifying the source code issues and fixing it. Review Bot is a tool designed to reduce the human effort and improve the quality in code reviews by generating automatic reviews using static analysis output. In this paper, we propose an extension to Review Bot- addition of a component called Fix-it for the auto-correction of various source code issues using Abstract Syntax Tree (AST) transformations. Fix-it uses built-in fixes to automatically fix various issues reported by the auto-reviewer component in Review Bot, thereby reducing the human effort to greater extent. Fix-it is designed to be highly extensible-users can add support for the detection of new defect patterns using XPath or XQuery and provide fixes for it based on AST transformations written in a high-level programming language. It allows the user to treat the AST as a DOM tree and run XQuery UPDATE expressions to perform AST transformations as part of a fix. Fix-it also includes a designer application which enables Review Bot administrators to design new defect patterns and fixes. The developer feedback on a stand-alone prototype indicates the possibility of significant human effort reduction in code reviews using Fix-it.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124410095","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}

引用次数: 15

Criticality of defects in cyclic dependent components 循环相关部件缺陷的临界性

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648180

Tosin Daniel Oyetoyan, R. Conradi, D. Cruzes

{"title":"Criticality of defects in cyclic dependent components","authors":"Tosin Daniel Oyetoyan, R. Conradi, D. Cruzes","doi":"10.1109/SCAM.2013.6648180","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648180","url":null,"abstract":"(Background) Software defects that most likely will turn into system and/or business failures are termed critical by most stakeholders. Thus, having some warnings of the most probable location of such critical defects in a software system is crucial. Software complexity (e.g. coupling) has long been established to be associated with the number of defects. However, what is really challenging is not in the number but identifying the most severe defects that impact reliability. (Research Goal) Do cyclic related components account for a clear majority of the critical defects in software systems? (Approach) We have empirically evaluated two non-trivial systems. One commercial Smart Grid system developed with C# and an open source messaging and integrated pattern server developed with Java. By using cycle metrics, we mined the components into cyclic-related and non-cyclic related groups. Lastly, we evaluated the statistical significance of critical defects and severe defect-prone components (SDCs) in both groups. (Results) In these two systems, results demonstrated convincingly, that components in cyclic relationships account for a significant and the most critical defects and SDCs. (Discussion and Conclusion) We further identified a segment of a system with cyclic complexity that consist almost all of the critical defects and SDCs that impact on system's reliability. Such critical defects and the affected components should be focused for increased testing and refactoring possibilities.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116955854","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}

引用次数: 8

Driving a sound static software analyzer with branch-and-bound 用分支定界驱动一个健全的静态软件分析器

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648185

Sven Mattsen, Pascal Cuoq, S. Schupp

{"title":"Driving a sound static software analyzer with branch-and-bound","authors":"Sven Mattsen, Pascal Cuoq, S. Schupp","doi":"10.1109/SCAM.2013.6648185","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648185","url":null,"abstract":"During the last decade, static analyzers of source code have improved greatly. Today, precise analyzers that propagate values for the program's variables, for instance with interval arithmetic, are used in the industry. The simultaneous propagation of sets of values, while computationally efficient, is a source of approximations, and ultimately of false positives. When the loss of precision is detrimental to the user's goals, a user needs to provide some kind of manual guidance. Frama-C, a framework for the static analysis of C programs, provides a sound value analyzer. This analyzer can optionally be guided by skillfully placed user annotations. This article describes SPALTER, a Frama-C plug-in that uses a variation of the Skelboe-Moore algorithm from the field of interval arithmetic to guide Frama-C's value analyzer towards a high-level objective set by the user. SPALTER reproduces the results of a case study that used Frama-C's value analysis and required extensive manual guidance. In difference, our approach with SPALTER required no guidance, except preparation of the analyzed program by slicing.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116268076","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

GeCoS: A framework for prototyping custom hardware design flows geco:用于定制硬件设计流程原型的框架

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648190

Antoine Floch, Tomofumi Yuki, Ali Hassan El Moussawi, Antoine Morvan, Kevin J. M. Martin, Maxime Naullet, M. Alle, L. L'Hours, N. Simon, Steven Derrien, François Charot, C. Wolinski, O. Sentieys

引用次数: 33

Review efforts reduction by partitioning of static analysis warnings 通过划分静态分析警告来减少评审工作量

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648191

Tukaram Muske, Ankit Baid, Tushar Sanas

{"title":"Review efforts reduction by partitioning of static analysis warnings","authors":"Tukaram Muske, Ankit Baid, Tushar Sanas","doi":"10.1109/SCAM.2013.6648191","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648191","url":null,"abstract":"Static analysis has been successfully employed in software verification, however the number of generated warnings and cost incurred in their manual review is a major concern. In this paper we present a novel idea to reduce manual review efforts by identifying redundancy in this review process. We propose two partitioning techniques to identify redundant warnings - 1) partitioning of the warnings with each partition having one leader warning such that if the leader is a false positive, so are all the warnings in its partition which need not be reviewed and 2) further partitioning the leader warnings based on similarity of the modification points of variables referred to in their expressions. The second technique makes the review process faster by identifying further redundancies and it also makes the reviewing of a warning easier due to the associated information of modification points. Empirical results obtained with these grouping techniques indicate that, on an average, 60% of warnings are redundant in the review context and skipping their review would lead to a reduction of 50-60% in manual review efforts.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128075440","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}

引用次数: 32

CodeMetropolis - code visualisation in MineCraft CodeMetropolis - MineCraft中的代码可视化

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648194

Gergõ Balogh, Árpád Beszédes

{"title":"CodeMetropolis - code visualisation in MineCraft","authors":"Gergõ Balogh, Árpád Beszédes","doi":"10.1109/SCAM.2013.6648194","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648194","url":null,"abstract":"Data visualisation with high expressive power plays an important role in code comprehension. Recent visualization tools try to fulfil the expectations of the users and use various analogies. For example, in an architectural metaphor, each class is represented by a building. Buildings are grouped into districts according to the structure of the namespaces. We think that these unique ways of code representation have great potential, but in our opinion they use very simple graphical techniques (shapes, figures, low resolution) to visualize the structure of the source code.On the other hand, computer games use high quality graphic and good expressive power. A good example is Minecraft, a popular role playing game with great extensibility and interactivity from another (third party) software. It supports both high definition, photo-realistic textures and long range 3D scene displaying. Our main contribution is to connect data visualisation with high end-user graphics capabilities. To achieve this, a conversion tool was implemented. It processes the basic source code metrics as input and generates a Minecraft world with buildings, districts, and gardens. The tool is in the prototype state, but it can be used to investigate the possibilities of this kind of data visualisation.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125813142","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}

引用次数: 18

Tracing with a minimal number of probes 使用最少数量的探针进行跟踪

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM) Pub Date : 2013-10-28 DOI: 10.1109/SCAM.2013.6648187

D. Baca

{"title":"Tracing with a minimal number of probes","authors":"D. Baca","doi":"10.1109/SCAM.2013.6648187","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648187","url":null,"abstract":"When a program execution must be observed, probes are injected to trace its execution. Probes are intrusive, causing execution overhead and modifying a program's real time properties. It is therefore desirable to place them efficiently, so that their negative effects are mitigated. This paper presents a new algorithm for efficiently allocating probes at vertices in the control flow graph of a program in a way that makes it possible to reconstruct program traces. Despite of the intractability of finding minimal vertex probe placement, a fact proven in this paper, the presented algorithm is capable of identifying a locally minimal set of vertices, which reduces the set of needed probes beyond the current state-of-the-art. First, the paper shows the advantages of placing probes at vertices, rather than edges. Next, the known methods for reducing the set of probes needed to profile execution are proven to be applicable to reduce the set needed to trace execution. Further, the new algorithm is described along with the algorithm for reconstructing the executed path from a trace file. In addition, the new algorithm is combined with methods for placing profiling probes to reduce the execution overhead even further. Finally, the new probe placement algorithm is compared with known algorithms to elaborate on its benefits.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124991790","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}

引用次数: 2