Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2008-05-06
2008-05-06
Zhen, Wei (Department: 2191)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
Reexamination Certificate
active
10294362
ABSTRACT:
A byte code reader provides verification while optimizing and creating an internal SSA form to allow efficient machine code generation. Many functions are combined in one component honoring the difficult time constraints of just-in-time translation. This reader is engineered for retargeting and thus expedites the implementation of a JIT for any platform. The reader takes two single passes over the byte codes: a first pass that builds a flow graph using any set of rules for node creation, and maps definitions from the byte codes onto the flow graph nodes, and a second pass that translates whatever is in the byte codes into optimized machine code (or a traditional compiler intermediate form) with an embedded SSA graph. Global verification and global optimization are implemented while reading. Two data structures and a main program loop are provided. The data structures are used to allow the creation of a flow graph, and an exception handling (EH) graph.
REFERENCES:
patent: 5659754 (1997-08-01), Grove et al.
patent: 5778233 (1998-07-01), Besaw et al.
patent: 6249910 (2001-06-01), Ju et al.
patent: 6457172 (2002-09-01), Carmichael et al.
patent: 6651247 (2003-11-01), Srinivasan
patent: 7058935 (2006-06-01), Kawahito et al.
patent: 2002/0144245 (2002-10-01), Lueh
patent: 2003/0149969 (2003-08-01), Ogasawara
patent: 2004/0003380 (2004-01-01), Fedorov
patent: 2004/0025083 (2004-02-01), Nanja et al.
patent: 2004/0049769 (2004-03-01), Lueh et al.
Lapkowski et al. “Extended SSA Numbering: Introducing SSA properties to languages with multi-level pointers”, IBM Press, Nov. 1966.
John Whaley “Joeq: a virtual machine and compiler infrastructure” Jun. 2003 ACM Press, IVME' 03, pp. 58-66.
Michael P. Gerlek, et al. “Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA”, Jan. 1995, ACM Press, TOPLAS vol. 17, Issue 1 pp. 85-122.
Cytron, R. et al., “An Efficient Method of Computing Static Single Assignment Form”,Principles of Programming Language, 1989, 25-35.
Goff, T. et al., “Preemptive Routing in Ad Hoc Networks”,ACM Sigmobile, 2001, 43-52.
Pinter, S.S. et al., “Program Optimization and Parallelization Using Idioms”,ACM Transactions on Programming Languages and Systems, 1994, 16(3), 305-327.
Stoutchinin, A. et al., “Efficient Static Single Assignment Form for Prediction”,IEEE, 2001, 172-181.
Whaley, J. “Partial Method Compilation using Dynamic Profile Information”,OOPSLA, 2001, 166-179.
Deng Anna
Woodcock & Washburn LLP
Zhen Wei
LandOfFree
Systems and methods to read, optimize, and verify byte codes... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and methods to read, optimize, and verify byte codes..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods to read, optimize, and verify byte codes... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3958235