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

Characterization and assessment of the linux configuration complexity linux配置复杂性的表征和评估

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

Ahmad Jbara, D. Feitelson

{"title":"Characterization and assessment of the linux configuration complexity","authors":"Ahmad Jbara, D. Feitelson","doi":"10.1109/SCAM.2013.6648179","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648179","url":null,"abstract":"The Linux kernel is configured for specific uses by manipulations of the source code during the compilation process. These manipulations are performed by the C pre-processor (CPP), based on in-line directives. Such directives, and the interleaving of multiple versions of the code that they allow, may cause difficulties in code comprehension. To better understand the effects of CPP, we perform a deep analysis of the configurability of the Linux kernel. We found significant inconsistencies between the source code and the configuration control system. Focusing on the thousands of config options appearing in the source code, we found that their distribution is heavy-tailed, with some options having more than a thousand instances in the code. Such wide use seems to imply a massive coupling between different parts of the system. However, we argue that employing a purely syntactic analysis is insufficient. By involving semantic considerations, we find that in reality the coupling induced by the very frequent options is limited. Moreover, even at the syntactic level the adverse effects of CPP are limited, as there is little nesting and the expressions controlling conditional compilation are usually very simple. But it could be even better if the configuration system undergoes a clean up. On the other hand, we found that the code controlled by CPP is very heterogeneous and may exhibit intimate mingling with non-variable code. As a result the applicability of alternative mechanisms such as aspects is hard to envision.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"30 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":"132251672","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

A state alteration and inspection-based interactive debugger 一个基于状态更改和检查的交互式调试器

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

Yan Wang, Min Feng, Rajiv Gupta, Iulian Neamtiu

{"title":"A state alteration and inspection-based interactive debugger","authors":"Yan Wang, Min Feng, Rajiv Gupta, Iulian Neamtiu","doi":"10.1109/SCAM.2013.6648188","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648188","url":null,"abstract":"Despite significant advances in automated debugging, programmers still rely on traditional interactive debuggers (e.g., GDB) to find and fix bugs. While popular, these debuggers have major deficiencies: they do not guide the programmer in narrowing the source of error, and they only support a limited and low-level set of state-altering commands, hence semantic state alteration requires recompilation and reexecution. To address these shortcomings, we present an interactive debugger that combines capabilities that reduce debugging effort and increase debugging speed. The capabilities that yield these benefits include: state alteration commands for dynamically switching the directions of conditional branches and suppressing the execution of statements; state inspection commands including navigating and pruning dynamic slices; and state rollback and checkpointing commands to allow reexecution of the program from an earlier checkpoint. Our prototype is built on top of GDB using the Pin infrastructure; we also provide a GUI based on KDbg. Our experience shows that our debugger handles many kinds of real bugs effectively and efficiently.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"10 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":"115963349","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

MetricMiner: Supporting researchers in mining software repositories MetricMiner:支持研究人员挖掘软件库

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

Francisco Zigmund Sokol, M. Aniche, M. Gerosa

引用次数: 28

PtrTracker: Pragmatic pointer analysis PtrTracker:实用指针分析

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

Sebastian Biallas, Mads Chr. Olesen, F. Cassez, Ralf Huuck

引用次数: 9

Code clustering workbench 代码集群工作台

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

K. Annervaz, Vikrant S. Kaulgud, Janardan Misra, Shubhashis Sengupta, Gary Titus, A. Munshi

{"title":"Code clustering workbench","authors":"K. Annervaz, Vikrant S. Kaulgud, Janardan Misra, Shubhashis Sengupta, Gary Titus, A. Munshi","doi":"10.1109/SCAM.2013.6648181","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648181","url":null,"abstract":"Source code clustering is an important technique used in software development and maintenance to understand the modular structure of code. An array of algorithms are available for clustering like simulated annealing based search. Source code have different kinds of features such as structural or textual features. The collection of these different types of source code features and computation of relevant feature metrics is a difficult task. Further, the clustering algorithms can run on metrics based on different types of source code features or their combinations. This flexibility makes it non-trivial to test effectiveness of clustering algorithms on a source code. In this paper, we present a highly configurable clustering workbench that allows the user to collect the various source code features and then to select the code features used for clustering, the clustering algorithm and its various parameters. Clustering quality metrics are computed. They allow comparison of algorithm output based on different combinations of code-features and algorithms. We also present the specific contribution made in multi-dimensional feature analysis and clustering. The tool hides the algorithm complexity from the user, thus allowing complete focus on understanding the 'effect' of the configuration choices. We have also applied this tool in real-life maintenance projects, where the users found it useful to tweak the clustering techniques for the source-code peculiarities.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"72 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":"131879814","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

ForkSim: Generating software forks for evaluating cross-project similarity analysis tools ForkSim:生成用于评估跨项目相似度分析工具的软件分支

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

Jeffrey Svajlenko, C. Roy, Slawomir Duszynski

{"title":"ForkSim: Generating software forks for evaluating cross-project similarity analysis tools","authors":"Jeffrey Svajlenko, C. Roy, Slawomir Duszynski","doi":"10.1109/SCAM.2013.6648182","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648182","url":null,"abstract":"Software project forking, that is copying an existing project and developing a new independent project from the copy, occurs frequently in software development. Analysing the code similarities between such software projects is useful as developers can use similarity information to merge the forked systems or migrate them towards a reuse approach. Several techniques for detecting cross-project similarities have been proposed. However, no good benchmark to measure their performance is available. We developed ForkSim, a tool for generating datasets of synthetic software forks with known similarities and differences. This allows the performance of cross-project similarity tools to be measured in terms of recall and precision by comparing their output to the known properties of the generated dataset. These datasets can also be used in controlled experiments to evaluate further aspects of the tools, such as usability or visualization concepts. As a demonstration of our tool, we evaluated the performance of the clone detector NiCad for similarity detection across software forks, which showed the high potential of ForkSim.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"28 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":"132354679","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}

引用次数: 7

sql-schema-comparer: Support of multi-language refactoring with relational databases sql-schema-comparer:支持用关系数据库进行多语言重构

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

Hagen Schink

引用次数: 7

Ontological interpretation of object-oriented programming abstractions 面向对象编程抽象的本体论解释

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

Arvind W. Kiwelekar, R. Joshi

引用次数: 3

Assembler restructuring in FermaT FermaT中的汇编器重组

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

Martin P. Ward

引用次数: 10

A relational symbolic execution algorithm for constraint-based testing of database programs 基于约束的数据库程序测试的关系符号执行算法

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

M. Marcozzi, Wim Vanhoof, Jean-Luc Hainaut

{"title":"A relational symbolic execution algorithm for constraint-based testing of database programs","authors":"M. Marcozzi, Wim Vanhoof, Jean-Luc Hainaut","doi":"10.1109/SCAM.2013.6648200","DOIUrl":"https://doi.org/10.1109/SCAM.2013.6648200","url":null,"abstract":"In constraint-based program testing, symbolic execution is a technique which allows to generate test data exercising a given execution path, selected within the program to be tested. Applied to a set of paths covering a sufficient part of the code under test, this technique permits to generate automatically adequate test sets for units of code. As databases are ubiquitous in software, generalizing such a technique for efficient testing of programs manipulating databases is an interesting approach to enhance the reliability of software. In this work, we propose a relational symbolic execution algorithmto be used for testing of simple Java methods, reading and writing with transactional SQL in a relational database, subject to integrity constraints. This algorithm considers the Java method under test as a sequence of operations over a set of constrained relational variables, modeling both the database tables and the method variables. By integrating this relational model of the method and database with the classical symbolic execution process, the algorithm can generate a set of Alloy constraints for any finite path to test in the control-flow graph of the method. Solutions of these constraints are data which constitute a test case, including valid content for the database, which exercises the selected path in the method. A tool implementing the proposed algorithm is demonstrated over a number of examples.","PeriodicalId":170882,"journal":{"name":"2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116009673","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}

引用次数: 16