Quotables
"To place a man in a multi-stage rocket and project him into the controlling gravitational field of the moon where the passengers can make scientific observations, perhaps land alive, and then return to earth--all that constitutes a wild dream worthy of Jules Verne. I am bold enough to say that such a man-made voyage will never occur regardless of all future advances."
Lee deForest, American radio pioneer ; 1957
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 |
| 8032874 | Generation of executable threads having source code specifications that describe network packets From source code specification of each of a plurality of threads, those variables of a data structure referenced by the thread are determined. For each thread, a respective adaptation of the source code specification of the data structure is generated. Each adaptati... | 10/04/2011 |
| 7926048 | Efficient call sequence restoration method Embodiments of the present invention provide for minimizing the number of procedure frame unwinding operations to be performed when restoring the program control flow information. A first data structure may be constructed to contain procedure linkage information alo... | 04/12/2011 |
| 7895586 | Data flow graph processing method, reconfigurable circuit and processing apparatus A data flow graph processing method divides at least one DFG generated into a plurality of sub-DFGs, in accordance with the number of logic circuits in a circuit set in a reconfigurable circuit. When the reconfigurable circuit is provided with a structure including ... | 02/22/2011 |
| 7797691 | System and method for automatic parallelization of sequential code Systems and methods are described for automatically transforming essentially sequential code into a plurality of codes which are to be executed in parallel to achieve the same or equivalent result to the sequential code. User-defined task boundaries are determined i... | 09/14/2010 |
| 7757223 | Method and system to construct a data-flow analyzer for a bytecode verifier The problems noted above are solved in large part by a method and system to construct a data-flow analyzer for a bytecode verifier using existing hardware resources and software. Specifically, micro-sequences and JSM hardware resources may be employed fetch a first ... | 07/13/2010 |
| 7743369 | Enhanced function point analysis A system for automatically counting function points is provided. The system includes an electronic document, an analysis component, and a user interface. The electronic document contains a sequence diagram that specifies interactions in a software application. The a... | 06/22/2010 |
| 7712093 | Determining intra-procedural object flow using enhanced stackmaps Analysis of object flow during execution of individual instructions of a method within an object-oriented application provides information regarding the creation and flow of objects during an invocation of the method. This analysis information is used to track where... | 05/04/2010 |
| 7685587 | Automated instruction-set extension Commercial data processors are available that include a capability of extending their instruction set for a specified application, i.e. of introducing customized functional units in the interest of enhanced processing performance. For such processors there is a need... | 03/23/2010 |
| 7590978 | Inferring object invariant method and system A local analysis analyzes the values of objects paying attention to program flow and a global analysis analyses the object independent of the flow. The local and global analysis interact to infer the invariants of objects used within a computer program. The local an... | 09/15/2009 |
| 7584463 | State as a first-class citizen of an imperative language A state component saves a present state of a program or model. This state component can be invoked by the program or model itself, thereby making state a first-class citizen. As the state of the program evolves from the saved state, the saved state remains for refle... | 09/01/2009 |
| 7549147 | Security framework for protecting rights in computer software A method for protecting software is provided, where source code for the software has a first directive marking an encryption beginning point and a second directive marking an encryption end point. The method contains the steps of: processing the source code to ident... | 06/16/2009 |
| 7516448 | Method for improving irreducible region commoning compile speed A method for improving compile speed in irreducible code regions within a computer program is disclosed. The method comprises determining which of a plurality of code regions within a computer program is irreducible, determining an influence of the irreducible code ... | 04/07/2009 |
| 7500233 | Parallel filter check using an arithmetic memory location Performing parallel comparisons of variables to determine program code execution flow or to compare multiple variables is disclosed. Memory locations are packed with multiple sub-variables for comparison to sub-variables generated, for example, at runtime. Each bina... | 03/03/2009 |
| 7493610 | Versioning optimization for dynamically-typed languages A system and method for optimizing program code in dynamic languages includes gathering hot-type information from a program by employing inferencing or profiling to get the hot-type information for operator uses, and inserting guards in the program based on data flo... | 02/17/2009 |
| 7464375 | Method for flattening hierarchically structured flows There is disclosed a method for flattening hierarchically structured flows using a breadth-first approach. At each level of hierarchy of a hierarchically structured source flow, complex nodes are flattened by one level across the entire breadth of the flow. The resu... | 12/09/2008 |
| 7444626 | Apparatus and method for linear dead store elimination An apparatus and method for removing stores to local variables that are not aliased by other variables or to variables which have already been removed by previous optimizations prior to performing dead store elimination optimization are provided. With the method and... | 10/28/2008 |
| 7409679 | System and method for computer-aided graph-based dependency analysis The present invention is directed to a system and methods for analyzing dependencies. The dependencies that may be analyzed include, for example, dependencies among methods or procedures in software source code, or in system configuration or deployment. A layered sy... | 08/05/2008 |
| 7406686 | Systems and methods for software performance tuning Methods and apparatus for determining a level of performance of a first application in a computer system are disclosed. A selection of a second one of a plurality of applications is received. The second application is then executed, thereby producing data indicating... | 07/29/2008 |
| 7401329 | Compiling computer programs to exploit parallelism without exceeding available processing resources A compilation technique for computer programs forms a data flow graph of vertices which are analysed to form clusters C for parallel execution where those clusters are added to up to the point at which arbitrary selection between further vertices C, D to be added mu... | 07/15/2008 |
| 7395532 | Process for running programs on processors and corresponding processor system Programs having a given instruction-set architecture are executed on a multiprocessor system comprising a plurality of processors, for example of a VLIW type, each of said processors being able to execute, at each processing cycle, a respective maximum number of ins... | 07/01/2008 |
| 7392513 | Methods and apparatus for merging critical sections Methods and apparatus for merging critical sections are disclosed. An example disclosed system estimates the cost of merging a first critical section and a second critical section using a dataflow analysis on the first and second critical sections. In the example sy... | 06/24/2008 |
| 7392516 | Method and system for configuring a dependency graph for dynamic by-pass instruction scheduling There is disclosed a method and system for configuring a data dependency graph (DDG) to handle instruction scheduling in computer architectures permitting dynamic by-pass execution, and for performing dynamic by-pass scheduling utilizing such a configured DDG. In ac... | 06/24/2008 |
| 7379858 | Computation of all-pairs reaching probabilities in software systems A Markov chain model of a software system may be used to compute all-pairs reaching probabilities to provide guidance in performing speculative operations with respect to the software system. ... | 05/27/2008 |
| 7376940 | Thread suspension and method in a multi-threaded environment Mechanisms can be used to facilitate suspension of a mutator thread (or mutator threads) while imposing negligible overhead on the mutator computation during periods when thread suspension is not requested. Mechanisms are provided to spill values from a fixed set of... | 05/20/2008 |
| 7367022 | Methods and apparatus for optimizing the operating speed and size of a computer program Apparatus and methods for optimizing an operating speed and size of a computer program are disclosed. In an example, an apparatus includes an execution module to run a computer program, an exception detector to detect throws to an exception handler and to detect loc... | 04/29/2008 |
| 7363621 | Program converting apparatus, method, and program Program converting methods, apparatus and systems including a code analysis unit for performing lexical and syntactic analyses of a source code of an execution program, an optimization unit for transforming this execution program, and an output code generation unit ... | 04/22/2008 |
| 7356813 | System and method for optimizing a program Disclosed are systems and methods for optimizing a program. ... | 04/08/2008 |
| 7353488 | Flow definition language for designing integrated circuit implementation flows An instance of a flow definition language for designing an integrated circuit implementation flow. The instance of the flow definition language includes a hierarchical collection of stages for a physical chip design. Relational constraints define the execution order... | 04/01/2008 |
| 7353279 | Proxy architecture for providing quality of service(QoS) reservations An approach is provided for providing quality of service reservations in a packet-based radio communication network is disclosed. Connection information including connection rate is extracted from a dataflow from an application requesting connection-oriented service... | 04/01/2008 |
| 7353503 | Efficient dead code elimination Disclosed is a method for eliminating dead code from a computer program using an operands graph generated from a flow graph of a computer program. In one embodiment of the present invention, the operands graph is traversed for any unused operands. Upon detection of ... | 04/01/2008 |
| 7353505 | Tracing the execution path of a computer program The invention relates to tracing the execution path of a computer program comprising at least one module including a plurality of instructions. At least one of these instructions is a branch instruction. Each branch instruction is identified and evaluated to be one ... | 04/01/2008 |
| 7334216 | Method and apparatus for automatic generation of information system user interfaces A method and apparatus for the specification and automatic generation of user interfaces of information system (computer programs) is provided. The method is based in pattern language to specify requirements in an un-ambiguous mode and with precise semantics. The pa... | 02/19/2008 |
| 7320124 | Apparatus and method for analyzing and displaying operations of computer and computer program for the same A novel apparatus and method for analyzing and displaying the operation of a computer is provided, that can display a timing chart with which the relationship between transmission processes and reception processes, each relating to inter-process communications, can ... | 01/15/2008 |
| 7315850 | Software and method for performing database operations Elements of one or more database manipulation language (DML) commands strings are stored in tables, read from those tables and DML commands are generated. Storing these command elements in tables facilitates access to and modification of database commands used in da... | 01/01/2008 |
| 7307986 | State record processing The invention provides apparatuses and methods for quickly modifying state information. Preprocessing prepares the state information to be modified. A logic unit modifies the state information. Postprocessing then puts the modified state information in proper form f... | 12/11/2007 |
| 7293264 | Method and a device for abstracting instruction sequences with tail merging A method and a device for abstracting instruction sequences in a computer program. First, a control flow graph of the program is generated and analysed in order to detect multiple occurrences of a same instruction sequence (504, 506). Then, a function includi... | 11/06/2007 |
| 7278138 | Computer program conversion and compilation The present invention provides methods, apparatus, and systems to remove a redundant, sign extension instruction from a program and to improve the execution efficiency of the program. In an example embodiment, a conversion program for controlling a computer for the ... | 10/02/2007 |
| 7272829 | Factored assert chains Factored assert chains allow for improved tracking of implicit information in a computer program. The compiler may generate assert statements at various points in the program where there is implicit information. The dominator tree for the program or section of progr... | 09/18/2007 |
| 7263692 | System and method for software-pipelining of loops with sparse matrix routines A method that uses software-pipelining to translate programs, from higher level languages into equivalent object or machine language code for execution on a computer, including sparse arrays/matrices. In one example embodiment, this is accomplished by transforming s... | 08/28/2007 |
| 7260817 | Method using array range check information for generating versioning code before a loop for execution A system and method are provided that in one aspect eliminate redundant array range checks by performing a versioning for a loop. In another aspect, a system and method optimize array range checks by performing data-flow analysis in reverse order of the program exec... | 08/21/2007 |
