2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation最新文献_第2页

An Empirical Study of Function Overloading in C++ c++中函数重载的实证研究

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.25

Cheng Wang, Daqing Hou

引用次数: 4

Modular Decompilation of Low-Level Code by Partial Evaluation 部分求值的低级代码模块化反编译

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.35

M. Gómez-Zamalloa, E. Albert, G. Puebla

{"title":"Modular Decompilation of Low-Level Code by Partial Evaluation","authors":"M. Gómez-Zamalloa, E. Albert, G. Puebla","doi":"10.1109/SCAM.2008.35","DOIUrl":"https://doi.org/10.1109/SCAM.2008.35","url":null,"abstract":"Decompiling low-level code to a high-level intermediate representation facilitates the development of analyzers, model checkers, etc. which reason about properties of the low-level code (e.g., bytecode, .NET). Interpretive decompilation consists in partially evaluating an interpreter for the low-level language (written in the high-level language) w.r.t. the code to be decompiled. There have been proofs-of-concept that interpretive decompilation is feasible, butt here remain important open issues when it comes to decompile a real language: does the approach scale up? is the quality of decompiled programs comparable to that obtained by ad-hoc decompilers? do decompiled programs preserve the structure of the original programs? This paper addresses these issues by presenting, to the best of our knowledge, the first modular scheme to enable interpretive decompilation of low-level code to a high-level representation, namely, we decompile bytecode into PROLOG. We introduce two notions of optimality. The first one requires that each method/block is decompiled just once. The second one requires that each program point is traversed at most once during decompilation. We demonstrate the impact of our modular approach and optimality issues on a series of realistic benchmarks. Decompilation times and decompiled program sizes are linear with the size of the input bytecode program. This demostrates empirically the scalability of modular decompilation of low-level code by partial evaluation.","PeriodicalId":433693,"journal":{"name":"2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124517212","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}

引用次数: 9

Some Assembly Required - Program Analysis of Embedded System Code 一些汇编要求-嵌入式系统代码的程序分析

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.15

A. Fehnker, Ralf Huuck, F. Rauch, Sean Seefried

引用次数: 14

The Semantics of Abstract Program Slicing 抽象程序切片的语义

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.19

D. Zanardini

引用次数: 15

Using Program Transformations to Add Structure to a Legacy Data Model 使用程序转换向遗留数据模型添加结构

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.9

M. Ceccato, T. Dean, P. Tonella

引用次数: 1

On the Use of Data Flow Analysis in Static Profiling 数据流分析在静态分析中的应用

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.18

C. Boogerd, L. Moonen

引用次数: 17

Parfait - A Scalable Bug Checker for C Code Parfait -一个可伸缩的C代码Bug检查器

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.21

C. Cifuentes

{"title":"Parfait - A Scalable Bug Checker for C Code","authors":"C. Cifuentes","doi":"10.1109/SCAM.2008.21","DOIUrl":"https://doi.org/10.1109/SCAM.2008.21","url":null,"abstract":"Parfait is a bug checker of C code that has been designed to address developers' requirements of scalability (support millions of lines of code in a reasonable amount of time), precision (report few false positives) and reporting of bugs that may be exploitable from a security vulnerability point of view. For large code bases, performance is at stake if the bug checking tool is to be integrated into the software development process, and so is precision, as each false alarm (i.e., false positive) costs developer time to track down. Further, false negatives give a false sense of security to developers and testers, as it is not obvious or clear what other bugs were not reported by the tool. A common criticism of existing bug checking tools is the lack of reported metrics on the use of the tool. To a developer it is unclear how accurate the tool is, how many bugs it does not find, how many bugs get reported that are not actual bugs, whether the tool understands when a bug has been fixed, and what the performance is for the reported bugs. In this tool demonstration we show how Parfait fairs in the area of buffer overflow checking against the various requirements of scalability and precision.","PeriodicalId":433693,"journal":{"name":"2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129579063","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}

引用次数: 13

Rejuvenate Pointcut: A Tool for Pointcut Expression Recovery in Evolving Aspect-Oriented Software 复兴切入点:面向方面软件发展中的切入点表达式恢复工具

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.32

Raffi Khatchadourian, A. Rashid

{"title":"Rejuvenate Pointcut: A Tool for Pointcut Expression Recovery in Evolving Aspect-Oriented Software","authors":"Raffi Khatchadourian, A. Rashid","doi":"10.1109/SCAM.2008.32","DOIUrl":"https://doi.org/10.1109/SCAM.2008.32","url":null,"abstract":"Aspect-oriented programming (AOP) strives to localize the scattered and tangled implementations of crosscutting concerns (CCCs) by allowing developers to declare that certain actions (advice) should be taken at specific points (join points) during the execution of software where a CCC (an aspect) is applicable. However, it is non-trivial to construct optimal pointcut expressions (a collection of join points) that capture the true intentions of the programmer and, upon evolution, maintain these intentions. We demonstrate an AspectJ source-level inferencing tool called rejuvenate pointcut which helps developers maintain pointcut expressions over the lifetime of a software product. A key insight into the tool's construction is that the problem of maintaining pointcut expressions bears strong similarity to the requirements traceability problem in software engineering; hence, the underlying algorithm was devised by adapting existing approaches for requirements traceability to pointcut maintenance. The Eclipse IDE-based tool identifies intention graph patterns pertaining to a pointcut and, based on these patterns, uncovers other potential join points that may fall within the scope of the pointcut with a given confidence. This work represents a significant step towards providing tool-supported maintainability for evolving aspect-oriented software.","PeriodicalId":433693,"journal":{"name":"2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129758317","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}

引用次数: 3

DTS - A Software Defects Testing System 软件缺陷测试系统

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.12

Zhaohong Yang, Yunzhan Gong, Qing Xiao, Yawen Wang

引用次数: 17

Precise Analysis of Java Programs Using JOANA 使用JOANA对Java程序进行精确分析

2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation Pub Date : 2008-10-03 DOI: 10.1109/SCAM.2008.17

Dennis Giffhorn, Christian Hammer

引用次数: 16