Spelling suggestions: "subject:"THIS (eomputer program language)"" "subject:"THIS (aomputer program language)""
101 |
Programmer-friendly decompiled JavaNaeem, Nomair A. January 2006 (has links)
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.
|
102 |
A study of PostScript as a graphics programming language /Miller, Ruane. January 1988 (has links)
Thesis (M.F.A.)--Rochester Institute of Technology, 1988. / Includes bibliographical references (leaves 48-49).
|
103 |
Distributed C++ : design and implementation /Mansey, Pradeep P. January 1989 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1989. / Includes bibliographical references (leaves 50-55).
|
104 |
Vulnerability assessment of Java bytecodeShah, Rahul Arvind.. January 2005 (has links) (PDF)
Thesis(M.S.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references.
|
105 |
Animating multiprocessing programs in the Smalltalk-80 environment. /Modahl, Kurt B. January 1988 (has links)
Thesis (M.S.)--Oregon Graduate Center, 1988.
|
106 |
Distributed Smalltalk : inheritance and reactiveness in distributed systems /Bennett, John K. January 1988 (has links)
Thesis (Ph. D.)--University of Washington, 1988. / Vita. Bibliography: leaves [135]-145.
|
107 |
Ada and the graphical kernel system /Wessman, Richard R. January 1988 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1988. / Includes bibliographical references (leaves 50-52).
|
108 |
Java bytecode obfuscationBatchelder, Michael R. January 1900 (has links)
Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2007/08/29). Includes bibliographical references.
|
109 |
VPI PROLOG compiler project report /Deighan, John, January 1991 (has links)
Report (M.S.)--Virginia Polytechnic Institute and State University. M.S. 1991. / Abstract. Includes bibliographical references (leaves 80-81). Also available via the Internet.
|
110 |
Investigation of a C++ refactoring tool /Brubaker, Ryan. January 2008 (has links)
Thesis (M.S.E.)--University of Wisconsin -- La Crosse, 2008. / Includes bibliographical references (p. 43).
|
Page generated in 0.0934 seconds