Abstract: Parallelization of loops is performed for loops having indirect loop index variables and embedded conditional statements in the loop body. Loops having any finite number of array variables in the loop body, and any finite number of indirect loop index variables can be parallelized. There are two particular limitations of the described techniques: (i) that there are no cross-iteration dependencies in the loop other than through the indirect loop index variables; and (ii) that the loop index variables (either direct or indirect) are not redefined in the loop body.

Abstract: A method of restructuring a source computer program to a target computer program. A defined source computer program has source code. A set of tasks is defined for the source computer program to be performed by the source computer program. For each task, a corresponding set of input data sets is defined. For each input data set, a corresponding set of programs is determined such that each program in the set of programs includes declarations and executable statements, from the source code of the source computer program, required to execute the task in each input data set. Each set of programs is processed to generate a component that executes the respective task, resulting in generation of a set of components. A target computer program is generated from the set of components.

Abstract: Grouping blocks of text according to user-defined contexts, and editing group specific blocks can be used to improve document consistency during editing and revising of electronic documents. A change made in one block often requires appropriate changes to be made in other blocks that are contextually related to the changed block. Such changes are made to ensure this consistency. Commands that deal with block groups (such as, create group, add block to group(s), delete block from group(s), edit group, merge group, etc.) are provided to assist a user in editing documents.

Abstract: Existing program is restructured based on a set of tasks that the existing program executes. A set of tasks is used, in conjunction with related test cases, to verify the correct functioning of the restructured program, and also to restructure the program. The restructuring process involves information about: (i) the tasks for which the original computer program is used, (ii) the inputs (including their valid ranges) to be provided to the program to accomplish the tasks, and (iii) the outputs generated by the program, known but unfixed bugs, etc. Legacy computer programs or applications for which reliable documentation is either not available or inadequate is desirably restructured for improved understanding and maintenance.

Abstract: Parallelization of loops is performed for loops having indirect loop index variables and embedded conditional statements in the loop body. Loops having any finite number of array variables in the loop body, and any finite number of indirect loop index variables can be parallelized. There are two particular limitations of the described techniques: (i) that there are no cross-iteration dependencies in the loop other than through the indirect loop index variables; and (ii) that the loop index variables (either direct or indirect) are not redefined in the loop body.

Abstract: In a method of carrying out arithmetic and relational operations on decimal numerals of arbitrary size, the operations produce exact results if the decimal numerals involved are terminating or repeating. The result of arithmetic operations is flagged to indicate whether the result is a terminating or a repeating numeral. To maintain computational accuracy, numbers are converted to rational fractions, whenever necessary and computations are performed using such fractions. The sign, decimal point, and digits comprising a number are treated as individual character symbols. All arithmetical and relational operations are performed on character strings, rather than on binary maps of the relevant numbers.

Abstract: This invention relates to a method, system and program product to detect reduction variables in assignment statements in the source code for enabling the parallel execution of program loops. The reduction variables found using the method herein described can be tagged to the respective loops and passed to a compiler through compiler directives for parallelizing the reduction operation, along with the information about each variable's respective associative operator.

Abstract: The present invention discloses a method of developing a software system. The method facilitates the task of checking the software system's conformity to design during development, testing, and maintenance. A design control flow graph describes how the software system is to operate. Coding of the software system proceeds with reference to the design control flow graph. The design control flow graph can also be used as a framework for the construction of a monitoring module that comprises a collection of functions for checking the coding of the software system. During development, each node in the software system executes a corresponding monitoring function of the monitoring module. The monitoring function verifies, for example, whether the node was entered from a valid predecessor node, and whether some or all variables visible to the node have permissible values.

Abstract: The present invention discloses a method of carrying out arithmetic and relational operations on decimal numerals of arbitrary size. The operations produce exact results if the decimal numerals involved are terminating or repeating. The result of arithmetic operations is flagged to indicate whether the result is a terminating or a repeating numeral. To maintain computational accuracy, numbers are converted to rational fractions, whenever necessary and computations are performed using such fractions. The sign, decimal point, and digits comprising a number are treated as individual character symbols. All arithmetical and relational operations are performed on character strings, rather than on binary maps of the relevant numbers.

Abstract: Grouping blocks of text according to user-defined contexts, and editing group specific blocks can be used to improve document consistency during editing and revising of electronic documents. A change made in one block often requires appropriate changes to be made in other blocks that are contextually related to the changed block. Such changes are made to ensure this consistency. Commands that deal with block groups (such as, create group, add block to group(s), delete block from group(s), edit group, merge group, etc.) are provided to assist a user in editing documents.

Abstract: This invention relates to a method, system and program product to detect reduction variables in assignment statements in the source code for enabling the parallel execution of program loops. The reduction variables found using the method herein described can be tagged to the respective loops and passed to a compiler through compiler directives for parallelizing the reduction operation, along with the information about each variable's respective associative operator.

Abstract: The present invention discloses a method of developing a software system. The method facilitates the task of checking the software system's conformity to design during development, testing, and maintenance. A design control flow graph describes how the software system is to operate. Coding of the software system proceeds with reference to the design control flow graph. The design control flow graph can also be used as a framework for the construction of a monitoring module that comprises a collection of functions for checking the coding of the software system. During development, each node in the software system executes a corresponding monitoring function of the monitoring module. The monitoring function verifies, for example, whether the node was entered from a valid predecessor node, and whether some or all variables visible to the node have permissible values.

Abstract: Existing program is restructured based on a set of tasks that the existing program executes. A set of tasks is used, in conjunction with related test cases, to verify the correct functioning of the restructured program, and also to restructure the program. The restructuring process involves information about: (i) the tasks for which the original computer program is used, (ii) the inputs (including their valid ranges) to be provided to the program to accomplish the tasks, and (iii) the outputs generated by the program, known but unfixed bugs, etc. Legacy computer programs or applications for which reliable documentation is either not available or inadequate is desirably restructured for improved understanding and maintenance.