Results 1 
4 of
4
Structuring Decompiled Graphs
 In Proceedings of the International Conference on Compiler Construction
, 1996
"... . A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into functional, semantical and structural equivalent graphs, without code replication or introduction of new variables. The algorithm makes use of a set of generic highlevel language structures that inc ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
. A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into functional, semantical and structural equivalent graphs, without code replication or introduction of new variables. The algorithm makes use of a set of generic highlevel language structures that includes different types of loops and conditionals. Gotos are used only when the graph cannot be structured with the structures in the generic set. This algorithm is adequate for the control flow analysis required when decompiling programs, given that a pure binary program does not contain information on the highlevel structures used by the initial highlevel language program (i.e. before compilation). The algorithm has been implemented as part of the dcc decompiler, an i80286 decompiler of DOS binary programs, and has proved successful in its aim of structuring decompiled graphs. 1 Introduction A decompiler is a software tool that reverses the compilation process by translating a pure binar...
Generating Decompilers
 Information and Software Technology Journal
, 1998
"... Compiler compilers are in widespread use, but decompiler compilers are a more novel concept. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Compiler compilers are in widespread use, but decompiler compilers are a more novel concept.
From Graph Transformation Rules to Rulebased Visual Objectoriented Programs
, 1999
"... Graph transformation is an established computational model for specification and programming. In this paper we outline a path that can be taken in order to turn graph transformation into a rulebased visual objectoriented programming language. In particular, we discuss how functional and data abst ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Graph transformation is an established computational model for specification and programming. In this paper we outline a path that can be taken in order to turn graph transformation into a rulebased visual objectoriented programming language. In particular, we discuss how functional and data abstraction can be achieved in the setting of graphs, by minimal extensions of the graph and transformation model.
Parsing Noisy RecursivelyStructured Geometric Patterns
"... This paper describes a method for affineinvariant syntactic pattern recognition of geometric patterns using a new type of contextfree graph grammar. The grammar accommodates variability in the geometric relations between parts of patterns; this variability is modelled using affine transformations ..."
Abstract
 Add to MetaCart
This paper describes a method for affineinvariant syntactic pattern recognition of geometric patterns using a new type of contextfree graph grammar. The grammar accommodates variability in the geometric relations between parts of patterns; this variability is modelled using affine transformations and metric tensors. A parallel parsing algorithm is outlined, which is suitable for nonEulerian graphs.