International Business Machines Corporation

Paul Robert Carini

Michael George Burke

Jong-Deok Choi

Yi-Min Chee

Michael Peter Perrone

Danny Soroker

Paul Turquand Keyser

Michael S Karasick

Michael James Hind

Jayashree Subrahmonia

David Andrew Sawin

Samuel Monk Weber

Jeffrey S Schaffer

Several methods, and related apparatus, are provided for the entry of formatted ink data (i.e., electronic ink) such that individual items in the data may be parsed and recognized more effectively. Each method allows users to enter formatted ink data in-line, which can then be recognized with constraints and parsed for use in other application programs or databases. In addition, a method is provided for allowing user-specialization of any of these entry methods (or other similar) methods. Note that in any of these methods, the user may send the formatted ink either to the default ink-processing application, or else directly to another application or database.

Methods and apparatus for formatted entry of electronic ink

The system of the present invention includes a form design component, a form description repository, and a forms processing component Each form used with the system has a layout including a form identifier field with a common location space for each given form of the plurality of different types of forms. The forms processing component is coupled to the form description repository and receives data from an electronic clipboard, through an interface port, which permits recognition of a unique form identifier, communication with the form description repository, receipt of a form definition corresponding to the unique form identifier, and correct processing of the data on the given form (based on the identifier) The method includes generating a form identifier field having a common location space for each different type of form, prompting a user of the system to enter a unique form identifier into the field, via input of at least one handwritten stroke, recording electronic stroke data indicative of the at least one handwritten stroke, storing the stroke data together with electronic entry field data indicative of contents of other fields of the given form, and then invoking a handwriting recognition engine on the stroke data so as to obtain correct identity of each given form, thereby permitting proper processing of the electronic entry field data.

System and method for identifying form type in a handwriting recognition based form completion system

A compiler implemented method performs call-site specific selective automatic procedure integration over a program call graph. Individual call sites are selected for inlining based on two cost functions without the need for profiling. A routine cost function models each procedure and attempts to capture the cost of inlining a procedure. A call site cost function models the region around each call site, and attempts to capture the benefit of inlining or cloning a particular call site. Inlining is performed only at call sites for which both the routine cost function is less than a first threshold value and the call site cost function is less than a second threshold value.

Call-site specific selective automatic inlining

A computer implemented method performs flow-sensitive interprocedural data flow analysis without iteration for a class of interprocedural problems. The accuracy of the solution can approach the iterative result without the compile time cost. For interprocedural constant propagation (ICP), this method is more effective than existing methods and costs about the same compilation time. For flow-sensitive ICP over a program call graph (PCG), the method supports recursion while only performing one flow-sensitive analysis of each routine. If the PCG has cycles, a flow-insensitive solution is precomputed for constant propagation. During the flow-sensitive computation, the flow-insensitive result is used for a back edge. This permits a flow-sensitive solution to be obtained in one forward traversal of the PCG. This method can also be used to compute returned constants with one reverse traversal of the PCG. For flow-sensitive USE over a program call graph (PCG), the method supports recursion while only performing one flow-sensitive analysis of each routine. If the PCG has cycles, a flow-insensitive solution for a reference set (REF) is precomputed. During the flow-sensitive USE computation, the flow-insensitive REF solution is used for a back edge. This permits a flow-sensitive USE solution to be obtained in one reverse traversal of the PCG.

Interprocedural data-flow analysis that supports recursion while only

The invention provides a method for improving the precision of interprocedural alias analysis by efficiently qualifying (naming) dynamically allocated storage locations with call path information and identifying as identical qualified name pairs, one of which is a prefix substring of another. The invention also provides a compact method for representing alias information which improves the efficiency and in some cases, the precision, of alias analysis, by eliminating alias relations that involve more than one level of dereferencing and by eliminating all alias relations that do not contain at least one dereferenced object.

Methods for distinguishing dynamically allocated storage along different

By novel use of the Program Call Graph representation of computer programs, this method and apparatus provides a general analysis method for interprocedural bidirection data flow problems in computer software programs. The invention has many uses, including the determination of interprocedural alias analysis of computer software programs which contain pointers. The method starts by constructing a Program Call Graph representation of a computer program with each node of the graph representing a routine of the program. An internal representation of each node is then constructed and initial interprocedural values are associated with appropriate nodes. An interprocedural traversal of the Program Call Graph is performed in which each node is visited; an intraprocedural propagation is performed to develop a new set of interim solution values; and the new interim solution values are interprocedurally propagated. The new interim solution is propagated in a forward and backward direction in one pass of the traversal. The interprocedural traversal of the Program Call Graph is repeated until the interprocedural solution does not change.

Growing community of inventors

Sherman, CT, United States of America

Paul Robert Carini