By Topic

Proceedings Eighth Working Conference on Reverse Engineering

2-5 Oct. 2001

Filter Results

Displaying Results 1 - 25 of 40
  • Proceedings Eighth Working Conference on Reverse Engineering

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (203 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 381
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • Requirements-driven software re-engineering framework

    Publication Year: 2001, Page(s):71 - 80
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1248 KB) | HTML iconHTML

    Software re-engineering projects such as migrating code from one platform to another or restructuring a monolithic system into a modular architecture are popular maintenance tasks. Usually, projects of this type have to conform to hard and soft quality constraints (or non-functional requirements) such as "the migrant system must run as fast as the original", or "the new system should be more maint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Union schemas as a basis for a C++ extractor

    Publication Year: 2001, Page(s):59 - 67
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    An extractor is a program which processes source code and outputs facts about the code in a software exchange format (SEF). An SEF can be further specified by a schema, analogous to a schema for a database. This paper explains how two such schemas can be combined into a union schema as the basis for creating an extractor. We describe CPPX (C Plus Plus eXtractor), which transforms a schema designed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decompiling Java using staged encapsulation

    Publication Year: 2001, Page(s):368 - 374
    Cited by:  Papers (12)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    The paper presents an approach to program structuring for use in decompiling Java bytecode to Java source. The structuring approach uses three intermediate representations: (1) a list of typed, aggregated statements with an associated exception table, (2) a control flow graph, and (3) a structure encapsulation tree. The approach works in six distinct stages, with each stage focusing on a specific ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a standard schema for C/C++

    Publication Year: 2001, Page(s):49 - 58
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB) | HTML iconHTML

    Developing a standard schema at the abstract syntax tree (AST) level for C/C++ to be used by reverse engineering and reengineering tools is a complex and difficult problem. In this paper we present a catalogue of issues that need to be considered in order to design a solution. Three categories of issues are discussed. Lexical structure is the first category and pertains to characteristics of the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GUSTT: an amorphous slicing system which combines slicing and transformation

    Publication Year: 2001, Page(s):271 - 280
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    The paper presents a system for amorphous program slicing which combines slicing and transformation to achieve thinner slices than are possible using conventional syntax-preserving slicing. The approach involves the validation of the transformation and slicing steps using the Coq proof assistant, thereby guaranteeing the correctness of the amorphous slices produced. The combined application of sli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing type-based and proof-directed decompilation

    Publication Year: 2001, Page(s):362 - 367
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    In the past couple of years interest in decompilation has widened from its initial concentration on reconstruction of control flow into well-founded-in-theory methods to reconstruct type information. A. Mycroft (1999) described Type-Based Decompilation and S. Katsumata and A. Ohori (2001) described Proof-Directed Decompilation. The article summarises the two approaches and identifies their commona... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reverse program calculation supported by code slicing

    Publication Year: 2001, Page(s):35 - 45
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    This paper sketches a discipline for reverse engineering which combines formal and semi-formal methods. Among the former is the "algebra of programming", which we apply in "reverse order" so as to reconstruct formal specifications of legacy code. The latter includes code slicing, used as a means of trimming down the complexity of handling the formal semantics of all program variables at the same t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible reverse engineering of web pages with VAQUISTA

    Publication Year: 2001, Page(s):241 - 248
    Cited by:  Papers (23)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB) | HTML iconHTML

    VAQUISTA allows developers to reverse engineer a presentation model of a web page according to multiple reverse engineering options. The alternatives offered by these options not only widen the spectrum of possible presentation models but also encourage developers in exploring multiple reverse engineering strategies. The options provide filtering capabilities in a static analysis of HTML code that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Displaying dependence graphs: a hierarchical approach

    Publication Year: 2001, Page(s):261 - 270
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB) | HTML iconHTML

    We present a method to handle data- and control-flow information, represented as simplified system dependence graphs. As soon as a program is bigger than a few dozens of lines of code, its dependence graph becomes unreadable with standard drawing tools, since it contains far too many nodes and edges. In our approach, we propose to decompose the program into a hierarchy of groups that are likely to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple type system for program reengineering

    Publication Year: 2001, Page(s):357 - 361
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    This paper describes a type system used in a disassembler program to produce enhanced disassembly output The type system described in this paper is capable of representing C language types. It operates using the following methodology. First, the type information is collected from the standard C headers and is stored in type library files. The stored information is then used to comment and enhance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From an informal textual lexicon to a well-structured lexical database: an experiment in data reverse engineering

    Publication Year: 2001, Page(s):127 - 135
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    We present an experiment in data reverse engineering in the field of computational linguistics. We explain a methodology which preserves to a great extent the original input format, allowing parallel acquisition/updating of the data with processing at a more structured representation level. We motivate the use for such applications of Objective Caml, a functional programming language with strong s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Node coarsening calculi for program slicing

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

    Several approaches to reverse and re-engineering are based upon program slicing. Unfortunately, for large systems, such as those which typically form the subject of reverse engineering activities, the space and time requirements of slicing can be a barrier to successful application. Faced with this problem, several authors have found it helpful to merge control flow graph (CFG) nodes, thereby impr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach for reverse engineering of web-based applications

    Publication Year: 2001, Page(s):231 - 240
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    The new possibilities offered by WEB applications are pervasively and radically changing several areas. WEB applications, compared to WEB sites, offer substantially greater opportunities: a WEB application provides the WEB user with a means to modify the site status. WEB applications must cope with an extremely short development/evolution life cycle. Usually, they are implemented without producing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reengineering relational databases to object-oriented: constructing the class hierarchy and migrating the data

    Publication Year: 2001, Page(s):335 - 344
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB) | HTML iconHTML

    The object-oriented data model is predicted to be the heart of the next generation of database systems. Users want to move from old legacy databases into applying this new technology that provides extensibility and flexibility in maintenance. However, a major limitation on the wide acceptance of object-oriented databases is the amount of time and money invested on existing database applications, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Component clustering based on maximal association

    Publication Year: 2001, Page(s):103 - 114
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB) | HTML iconHTML

    Presents a supervised clustering framework for recovering the architecture of a software system. The technique measures the association between the system components (such as files) in terms of data and control flow dependencies among the groups of highly related entities that are scattered throughout the components. The application of data mining techniques allows us to extract the maximum associ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Folding: an approach to enable program understanding of preprocessed languages

    Publication Year: 2001, Page(s):3 - 12
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB) | HTML iconHTML

    Since the early days of programming, preprocessors have been used to increase the expressiveness of programming languages. As a prominent example, the C Preprocessor cpp even allows low level configuration management through conditional compilation. But preprocessors significantly complicate the task of program understanding because "what the user sees is not what the compiler gets". There is a ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing the informal knowledge contained in systems

    Publication Year: 2001, Page(s):166 - 175
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB) | HTML iconHTML

    Program comprehension of legacy systems is a highly knowledge-intensive task. One of the goals of reverse engineering is to propose automated help to relate application domain concepts to all their implementation instances. It is generally accepted that to do so would require analyzing such documentation as identifiers or comments. However, before attempting to perform this difficult analysis, it ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling the system-user dialog using interaction traces

    Publication Year: 2001, Page(s):208 - 217
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB) | HTML iconHTML

    It is generally the case that some user interface (UI) reverse engineering is needed for every non-trivial reengineering project. Typically, this is done through code analysis, which can be very difficult and/or expensive. When code analysis is not a must, as for wrapping purposes, system-user interaction can be an alternative input for the reverse engineering process. In the CelLEST project, we h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lessons learned in data reverse engineering

    Publication Year: 2001, Page(s):323 - 327
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    Reverse engineering of data has been performed in one form or another for over twenty-five years (1976-2001 approx.). The author describe the lessons learned in data reverse engineering (DRE) as contributed in a survey of data reverse engineers. Interesting is the fact that some of the lessons learned tell us how we are doing in the process of initial database design as well as how difficult the D... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of UML associations and their adornments in design recovery

    Publication Year: 2001, Page(s):81 - 90
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB) | HTML iconHTML

    Many CASE tools support reverse engineering and UML. However, it can be observed that, usually, only a subset of the UML notation is supported, namely those parts with a more or less direct code representation. Although a lot of research has been done in this field, the more advanced features of UML notations are not commonly supported in reverse engineering. In this paper, we show approaches to d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer security analysis through decompilation and high-level debugging

    Publication Year: 2001, Page(s):375 - 380
    Cited by:  Papers (6)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    The extensive use of computers and networks worldwide has raised the awareness of the need for tools and techniques to aid in computer security analysis of binary code, such as the understanding of viruses, trojans, worms, backdoors and general security flaws, in order to provide immediate solutions with or without the aid of software vendors. The paper is a proposal for a high-level debugging too... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preprocessor conditional removal by simple partial evaluation

    Publication Year: 2001, Page(s):281 - 290
    Cited by:  Papers (23)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    Preprocessors with conditionals are often used as software configuration management tools, with preprocessor variables naming configuration aspects. The preprocessor conditionals found in large systems often have complex enabling Boolean equations and nesting. Over long periods, some configuration aspects lose all utility. Removal of all traces of a configuration variable and code dependent on tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reverse engineering to achieve maintainable WWW sites

    Publication Year: 2001, Page(s):249 - 257
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB) | HTML iconHTML

    The growth of the World Wide Web and the accelerated development of web sites and associated web technologies has resulted in a variety of maintenance problems. The maintenance problems associated with web sites and the WWW are examined. It is argued that currently web sites and the WWW lack both data abstractions and structures that could facilitate maintenance. A system to analyse existing web s... View full abstract»

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