Quotables
"The production of too many useful things results in too many useless people."
Karl Marx
PatentStorm News
Make the Most of Our Site
See this month's Top Inventors and Most Cited Patents.
Stay on top of the latest innovations by subscribing to an RSS feed.
Registered users: Manage your profile.
| Number | Title | Issue Date |
| 5418958 | Register allocation by decomposing, re-connecting and coloring hierarchical program regions During code generation, a routine is first decomposed into regions. Then, starting from the highest plateau, i.e. the inner most control flow level, the interference graph of each region in a plateau is colored individually. Neighboring regions of the pla... | 05/23/1995 |
| 5396627 | Method of producing object program based on interprocedural dataflow analysis of a source program A method of producing an object program from an inputted source program with a compiler using a computer, includes the steps of: performing an interprocedural dataflow analysis of a variable associated with a procedure such as a subroutine, function, and ... | 03/07/1995 |
| 5339238 | Register usage tracking in translating code for different machine architectures by forward and reverse tracing through the program flow graph A code translator, constructed similar to a compiler, accepts as an input to be translated the assembly code written for one architecture (e.g., VAX), and produces as an output object code for a different machine architecture (e.g., RISC). The input code ... | 08/16/1994 |
| 5317734 | Method of synchronizing parallel processors employing channels and compiling method minimizing cross-processor data dependencies A method of synchronizing the parallel processors of a multiple instruction stream multiprocessor employs a limited number of register channels, which may be re-used, for enforcing cross-stream data or event dependencies by passing data or event notificat... | 05/31/1994 |
| 5307498 | Automated method for adding hooks to software The automatic addition of hooks to software is provided by greatly simplified steps. A function which is to be hooked is renamed. A new function is then created utilizing the original function name to call the renamed function. The new function is provide... | 04/26/1994 |
| 5307492 | Mapping assembly language argument list references in translating code for different machine architectures A code translator, constructed similar to a compiler, accepts as an input to be translated the assembly code written for one architecture (e.g., VAX), and produces as an output object code for a different machine architecture (e.g., RISC). The input code ... | 04/26/1994 |
| 5301325 | Use of stack depth to identify architechture and calling standard dependencies in machine code A code translator, constructed similar to a compiler, accepts as an input to be translated the assembly code written for one architecture (e.g., VAX), and produces as an output object code for a different machine architecture (e.g., RISC). The input code ... | 04/05/1994 |
| 5283901 | Microcomputer with high speed access memory and language processing program execution system A microcomputer having a high speed access memory and a language processing program execution system capable of producing a compact object including a high speed variable operation is disclosed. As to an input source program, variable areas used by subrou... | 02/01/1994 |
| 5230053 | Processor scheduling method for iterative loops A compiling method is described whereby a source program written in a conventional high-language for execution by a serial architecture computer can be automatically converted to an object program for parallel execution by a multi-processor computer, with... | 07/20/1993 |
| 5210837 | Methods and apparatus for transforming machine language program control into high-level language constructs by manipulating graphical program representations A method for translating an initial program flow representation of a computer program into a modified program flow representation examines paths in the initial program flow representation, selects for replication nodes which have multiple predecessor node... | 05/11/1993 |
| 5193190 | Partitioning optimizations in an optimizing compiler A computer program to be compiled is optimized prior to carrying out the final compilation. Subgraphs within the program are identified and examined for optimization beginning with the entire program as the largest subgraph. The number of entities in each... | 03/09/1993 |
| 5161216 | Interprocedural slicing of computer programs using dependence graphs Programs having multiple procedures are analyzed by creating a syst This invention was made with U.S. Government support awarded by the National Science Foundation (NSF), Grant #DCR-8603356 and PYI Award #DCR-8552602. The U.S. Government has certain rights in ... | 11/03/1992 |
| 5146594 | Method of producing object program based on interprocedural dataflow analysis of a source program A method of producing an object program from an inputted source program with a compiler using a computer, includes the steps of: performing an interprocedural dataflow analysis of a variable associated with a procedure such as a subroutine, function, and ... | 09/08/1992 |
| 5125092 | Method and apparatus for providing multiple condition code fields to to allow pipelined instructions contention free access to separate condition codes A computer system includes a condition register having multiple fields. Each field may be used as an independent condition register. A compiler which generates executable code for the computer system assigns instructions to different fields, allowing cond... | 06/23/1992 |
| 4885684 | Method for compiling a master task definition data set for defining the logical data flow of a distributed processing network A compiler method is disclosed which defines a data flow for a specific complex function to be executed on a plurality of data processing elements in a distributed processing system, by means of defining a plurality of control blocks which are associated ... | 12/05/1989 |
| 4571678 | Register allocation and spilling via graph coloring In an optimizing compiler which receives a high level source language program and produces machine interpretable instructions, a method for assigning computational data utilized by the program to a limited number of high speed machine registers in a targe... | 02/18/1986 |
