Dava currently performs some very basic heuristic-based naming of local variables. An interesting topic is how the decompiler could invent
good identifier names. Although unobfuscated bytecode contains some names, the names of local identifiers
are often lost, and further, obfuscators tend to changes all programmer identifiers to those which are difficult to understand.
Java constructs are detected during the Structure Encapsulation Tree (SET) generation stage of Dava. Since Dava works
on arbitrary bytecode the detection algorithms are general in nature working on the control flow graph representation
of the code. It has been noted that the algorithm used in the detection of the
is not that general. More specifically, the algorithm counts on the presence of a pattern in the control flow graph.
This results in Dava being unable to detect Synchronized blocks when the pattern does not match.
Note that this will not occur for normal
javac generated bytecode since that is handled well by the
The problem was first detected when decompiling AspectJ code produced by the
compiler and was fixed by Nomair by specifying specific pattern based detection schemes in the
stage of the SET creation. This was intended to be a temporary fix and the aim is to have a more general synchronized block
The task involves desigining an algorithm working ONLY with the control flow graph to detect Syncrhonized blocks without
any assumption of specific statement ordering and then implementing it in Dava.