By Topic

Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)

Date Sept. 30 2005-Oct. 1 2005

Filter Results

Displaying Results 1 - 25 of 28
  • Fifth IEEE International Workshop on Source Code Analysis and Manipulation - Cover

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (383 KB)
    Freely Available from IEEE
  • Fifth IEEE International Workshop on Source Code Analysis and Manipulation

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • Fifth IEEE International Workshop on Source Code Analysis and Manipulation - Copyright

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • Fifth IEEE International Workshop on Source Code Analysis and Manipulation - Table of contents

    Publication Year: 2005, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Message from the Chairs

    Publication Year: 2005, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (27 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2005, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2005, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • Transformations for abstractions

    Publication Year: 2005, Page(s):3 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    The transformation language Stratego provides high-level abstractions for implementation of a wide range of transformations. Our aim is to integrate transformation in the software development process and make it available to programmers. This requires the transformations provided by the programming environment to be extensible. This paper presents a case study in the implementation of extensible p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forward slices are smaller than backward slices

    Publication Year: 2005, Page(s):15 - 24
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    This paper presents evidence from two empirical studies which show that forward slices will tend to be smaller than backward slices and discusses the importance of this result for work on source code analysis and manipulation. The difference in forward and backward slice size distributions stems from the way in which control dependence and data dependence affect slice size. The paper explains this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract slicing: a new approach to program slicing based on abstract interpretation and model checking

    Publication Year: 2005, Page(s):25 - 34
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    This paper proposes a new approach to program slicing based on abstract interpretation and model checking. First, the notion of abstract slicing is introduced. Abstract slicing extends static slicing with predicates and constraints by using as the program model an abstract state graph, which is obtained by applying predicate abstraction to a program, rather than a flow graph. This leads to a progr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic slicing of Java bytecode programs

    Publication Year: 2005, Page(s):35 - 44
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    A forward global method for obtaining backward dynamic slices of Java bytecode programs is presented. In contrast with existing published techniques that require either a customized Java compiler (which also implies access to the source code) or bytecode instrumentation and eventual manual dependency specifications, our approach was to produce an instrumented virtual machine for Java. This approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal slicing and the relationships between forms of slicing

    Publication Year: 2005, Page(s):45 - 54
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    The widespread interest in program slicing within the source code analysis and manipulation community has led to the introduction of a large number of different slicing techniques. Each preserves some aspect of a program's behaviour and simplifies the program to focus exclusively upon this behaviour. In order to understand the similarities and differences between slicing techniques, a formal mecha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending dynamic aspect mining with static information

    Publication Year: 2005, Page(s):57 - 65
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Aspect mining tries to identify crosscutting concerns in legacy systems and thus supports the refactoring into an aspect-oriented design. We briefly introduce DynAMiT, a dynamic aspect mining tool that detects crosscutting concerns based on tracing method executions. While the approach is generally fairly precise, further analysis revealed that some false positives were systematically caused by dy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fine-grained analysis of change couplings

    Publication Year: 2005, Page(s):66 - 74
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    In software evolution analysis, many approaches analyze release history data available through versioning systems. The recent investigations of CVS data have shown that commonly committed files highlight their change couplings. However, CVS stores modifications on the basis of text but does not track structural changes, such as the insertion, removing, or modification of methods or classes. A deta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concept assignment as a debugging technique for code generators

    Publication Year: 2005, Page(s):75 - 84
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    Code generators are notoriously difficult to debug, yet their correctness is crucial. This paper demonstrates that concept assignment can be performed in an entirely syntax-directed manner for code generators and other highly structured program modules. Anomalies in this concept assignment indicate the possible existence of bugs. These insights enable the formulation of a new debugging technique f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation and verification of implicit-invocation systems using source transformation

    Publication Year: 2005, Page(s):87 - 96
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    In this paper we present a source transformation-based framework to support uniform testing and model checking of implicit-invocation software systems. The framework includes a new domain-specific programming language, the Implicit-Invocation Language (IIL), explicitly designed for directly expressing implicit-invocation software systems, and a set of formal rule-based source transformation tools ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying transformation sequences as computation on program fragments with an abstract attribute grammar

    Publication Year: 2005, Page(s):97 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    We present a grammar based approach for specifying a transformation as a sequence of transformation operations that operate on an intermediate representation. The transformation sequence is specified in the semantic actions of an abstract attribute grammar. The mapping between the object-oriented design of the intermediate representation and the abstract grammar directly reflects the object-orient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Control flow graph reconstruction for assembly language programs with delayed instructions

    Publication Year: 2005, Page(s):107 - 116
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to a higher level language, we need to construct a control flow graph (CFG). However CFG construction is complicated by architectural features which include VLIW parallelism, predicated instructions and branches with delay ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static analysis for computing escapability and mutability for Java components

    Publication Year: 2005, Page(s):119 - 128
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    A common theme in information security is protection of trusted software components against unauthorized access by untrusted users. In the context of distributed object technologies, such as Enterprise Java Beans, this means preventing leaks of sensitive information to untrusted users, as well as preventing untrusted users from modifying sensitive information. In this paper, we propose an approach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast analysis for thread-local garbage collection with dynamic class loading

    Publication Year: 2005, Page(s):129 - 138
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    Long-running, heavily multi-threaded, Java server applications make stringent demands of garbage collector (GC) performance. Synchronisation of all application threads before garbage collection is a significant bottleneck for JVMs that use native threads. We present a new static analysis and a novel GC framework designed to address this issue by allowing independent collection of thread-local heap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pointer analysis for source-to-source transformations

    Publication Year: 2005, Page(s):139 - 148
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    We present a pointer analysis algorithm designed for source-to-source transformations. Existing techniques for pointer analysis apply a collection of inference rules to a dismantled intermediate form of the source program, making them difficult to apply to source-to-source tools that generally work on abstract syntax trees to preserve details of the source program. Our pointer analysis algorithm o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring the impact of friends on the internal attributes of software systems

    Publication Year: 2005, Page(s):151 - 160
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    Differing views have been expressed on the appropriateness of the friend construct in the design and implementation of object-oriented software in C++. However, little empirical analysis of its usage in the development of systems has taken place. This paper describes an empirical study of the top 100 most downloaded open-source software systems from sourceforge.net, to assess the design implicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented cohesion as a surrogate of software comprehension: an empirical study

    Publication Year: 2005, Page(s):161 - 169
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    The concept of software cohesion in both the procedural and object-oriented paradigm is well known and documented. What is not so well known or documented is the perception of what empirically constitutes a cohesive 'unit' by software engineers. In this paper, we describe an empirical investigation using object-oriented (OO) classes as a basis. Twenty-four subjects (drawn from IT experienced and I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transforming embedded Java code into custom tags

    Publication Year: 2005, Page(s):173 - 182
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    When a new technology is introduced, the migration of existing applications to the new technology must be carefully considered. Automation can make some migrations feasible that otherwise may be too risky or expensive to be worth the advantages of the new technology. In this paper we describe a technique for migrating Web applications using embedded Java code into a custom tag implementation. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.