Sciweavers

896 search results - page 7 / 180
» On completeness of word reversing
Sort
View
ACTAC
2002
99views more  ACTAC 2002»
13 years 7 months ago
Recognizing Design Patterns in C++ Programs with the Integration of Columbus and Maisa
A method for recognizing design patterns from C++ programs is presented. The method consists of two separate phases, analysis and reverse engineering of the C++ code, and architec...
Rudolf Ferenc, Juha Gustafsson, Lászl&oacut...
FSMNLP
2005
Springer
14 years 26 days ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
JUCS
2006
92views more  JUCS 2006»
13 years 7 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
WCRE
2003
IEEE
14 years 19 days ago
An Experimentation Framework for Evaluating Disassembly and Decompilation Tools for C++ and Java
The inherent differences between C++ and Java programs dictate that the methods used for reverse engineering their compiled executables will be languagespecific. This paper looks ...
Lori Vinciguerra, Linda M. Wills, Nidhi Kejriwal, ...
ACRI
2004
Springer
14 years 23 days ago
Block Encryption Using Reversible Cellular Automata
Cellular automata (CA) are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of a local relation. They were successfully applied for s...
Marcin Seredynski, Pascal Bouvry