Thesis (M.S.)--West Virginia University, 2004. / Title from document title page. Document formatted into pages; contains viii, 92 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 89-92).

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: Java; weak reference; reference objects; distributed objects; distributed garbage collection. Includes bibliographical references (p. 91-93).

Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2003. / Thesis advisor(s): Neil C. Rowe, Gary L. Kreeger. Includes bibliographical references (p. 121-122). Also available online.

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: java; software visualization; probes; event notification. Includes bibliographical references (p. 79-82).

published_or_final_version / abstract / toc / Computer Science and Information Systems / Master / Master of Philosophy

Java decompilers convert Java class files to Java source. Common Java decompilers are javac-specific decompilers since they target bytecode produced from a particular javac compiler. We present work carried out on Dava, a tool-independent decompiler that decompiles bytecode produced from any compiler. A known deficiency of tool-independent decompilers is the generation of complicated decompiled Java source which does not resemble the original source as closely as output produced by javac-specific decompilers. This thesis tackles this short-coming, for Dava, by introducing a new back-end consisting of simplifying transformations. / The work presented can be broken into three major categories: transformations using tree traversals and pattern matching to simplify the control flow, the creation of a flow analysis framework for an Abstract Syntax Tree (AST) representation of Java source code and the implementation of flow analyses with their use in complicated transformations. / The pattern matching transformations rewrite the ASTs to semantically-equivalent ASTs that correspond to code that is easier for programmers to understand. The targeted Java constructs include If and If-Else aggregation, for-loop creation and the removal of abrupt control flow. Pattern matching using tree traversals has its limitations. Thus, we introduce a new structure-based data flow analysis framework that can be used to gather information required by more complex transformations. Popular compiler analyses e.g., reaching definitions, constant propagation etc. were implemented using the framework. Information from these analyses is then leveraged to perform more advanced AST transformations. / We performed experiments comparing different decompiler outputs for different sources of bytecode. The results from these experiments indicate that the new Dava back-end considerably improves code comprehensibility and readability.

Thesis(M.S.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references.

Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2007/08/29). Includes bibliographical references.

Thesis (M.S.E.)--University of Wisconsin -- La Crosse, 2008. / Includes bibliographical references (p. 42-45).

Thesis (Ph.D.)--University of Nebraska-Lincoln, 2008. / Title from title screen (site viewed July 22, 2008). PDF text: xi, 126 p. : ill. (some col.) ; 2 Mb. UMI publication number: AAT 3291923. Includes bibliographical references. Also available in microfilm and microfiche formats.