Abstract: A computer-implemented method for detecting code regions related to specific processes in an application is provided including obtaining a call-graph of an application, each node of the call-graph representing a program in the application and each edge of the call-graph representing a call between programs, detecting merge points in the call-graph where paths from different entry points are merged, dividing the call-graph into sub-call-graphs at the merge points to create a macro-call-graph, each node of the macro-call-graph representing each of the sub-call-graphs, detecting code regions related to specific processes in each program in the application based on variable names corresponding to the specific processes, setting an initial state to each entry point of the sub-call-graphs, and identifying sub-call-graphs related to each specific process by using dataflow analysis with the initial states and the code regions based on entry states of the sub-call-graphs.

Abstract: A method, system, and computer program product for error detection and correction of query expressions are provided. The method extracts a first set of queries from a set of programs prior to query editing. A first word set is generated from the first set of queries. A second set of queries are extracted from the set of programs after query editing. A second word set is generated from the second set of queries. The method determines a set of differences for word pairs within the first word set and the second word set. A third word set is generated from one or more edited queries based on the set of differences. The method generates an error report for the third word set based on the third word set and the set of differences.

Abstract: A computer-implemented method for detecting code regions related to specific processes in an application is provided including obtaining a call-graph of an application, each node of the call-graph representing a program in the application and each edge of the call-graph representing a call between programs, detecting merge points in the call-graph where paths from different entry points are merged, dividing the call-graph into sub-call-graphs at the merge points to create a macro-call-graph, each node of the macro-call-graph representing each of the sub-call-graphs, detecting code regions related to specific processes in each program in the application based on variable names corresponding to the specific processes, setting an initial state to each entry point of the sub-call-graphs, and identifying sub-call-graphs related to each specific process by using dataflow analysis with the initial states and the code regions based on entry states of the sub-call-graphs.

Abstract: A computer-implemented method is described for creating an entity relationship diagram. In one embodiment, the method for creating the entity relationship diagram can include analyzing programs to extract tables having references to SQL statements and call graphs. The method may further include counting a number of co-occurrences of pairs of tables having the references to SQL statements. Creating first edges based on the number of co-occurrences of pairs of tables having the references to SQL statements. The method may further include computing a shortest path lengths between two programs using pairs of tables in the call graphs based on a program to table use relationship. The method can further include creating second edges based on the shortest path lengths. The entity relationship diagram is plotted from the first edges and the second edges.

Abstract: Systems and methods for quality analysis of a source code are disclosed. The method includes obtaining plural comments included in the source code. Each of the plural comments includes at least one of plural predetermined words. Also the method extracts plural candidate comments which are comments obtained by excluding plural specific comments from the obtained plural comments. Each of the plural specific comments can be identified using a similarity between a source code fragment relating to any of the obtained plural comments and an adjacent source code fragment adjacent to the source code fragment. In addition, the method outputs an evaluation about incompletion of the source code. The evaluation is determined using the plural candidate comments.

Abstract: Systems and methods for quality analysis of a source code are disclosed. The method includes obtaining plural comments included in the source code. Each of the plural comments includes at least one of plural predetermined words. Also the method extracts plural candidate comments which are comments obtained by excluding plural specific comments from the obtained plural comments. Each of the plural specific comments can be identified using a similarity between a source code fragment relating to any of the obtained plural comments and an adjacent source code fragment adjacent to the source code fragment. In addition, the method outputs an evaluation about incompletion of the source code. The evaluation is determined using the plural candidate comments.

Abstract: A computer-implemented method is provided for detecting characteristics of usages of problem expressions for each of multiple authors. The method includes providing, by a hardware processor, a set of regular expression patterns configured to detect the problem expressions. The method further includes detecting, by the hardware processor based on the set of regular expressions, respective sets of the problem expressions which are (i) used in each of multiple analysis units, (ii) associated with a respective one of each of the multiple authors, and (iii) associated with a respective one of each of multiple artifact types. The method also includes finding, by the hardware processor using automatic feature selection, a set of important expressions in the respective sets of problem expressions. The method additionally includes detecting, by the hardware processor, a typical tendency of the usages of the problem expressions for each of the multiple authors, based on the important expressions.

Abstract: A computer-implemented method is provided for detecting characteristics of usages of problem expressions for each of multiple authors. The method includes providing, by a hardware processor, a set of regular expression patterns configured to detect the problem expressions. The method further includes detecting, by the hardware processor based on the set of regular expressions, respective sets of the problem expressions which are (i) used in each of multiple analysis units, (ii) associated with a respective one of each of the multiple authors, and (iii) associated with a respective one of each of multiple artifact types. The method also includes finding, by the hardware processor using automatic feature selection, a set of important expressions in the respective sets of problem expressions. The method additionally includes detecting, by the hardware processor, a typical tendency of the usages of the problem expressions for each of the multiple authors, based on the important expressions.

Abstract: Automatic verification of changes in a UML model made based on a change plan using a learning mode and a verification mode. In the learning mode, UML model differences are obtained between the UML model prior to the change and after the change, difference mapping is defined and a mapping metamodel is automatically extracted from the difference mapping. In the verification mode, planned difference mapping is created based on applying the mapping metamodel in the learning mode to a design change plan. Actual difference mapping based on the design change work is created and the planned difference mapping is compared to the actual difference mapping to see if additional changes to the mapping metamodel are needed.

Abstract: Systems and methods are provided for generating classification data which is used for classifying documents. The method includes reading documents in a form of a spreadsheet; collecting cell values in each of the documents; finding one or more common cell values among the collected values; counting, for each of the common cell values, a number of the documents having the common cell value; storing, if the number of the documents is equal to or larger than a predetermined number, the common cell value as a candidate header label in a memory; calculating a distance between cell locations of the candidate header labels in each of the documents; choosing, according to the calculated distance, two or more candidate header labels among the candidate header labels for each of the documents; and storing one or more combinations of the chosen two or more candidate header labels as the classification data.

Abstract: Automatic verification of changes in a UML model made based on a change plan using a learning mode and a verification mode. In the learning mode, UML model differences are obtained between the UML model prior to the change and after the change, difference mapping is defined and a mapping metamodel is automatically extracted from the difference mapping. In the verification mode, planned difference mapping is created based on applying the mapping metamodel in the learning mode to a design change plan. Actual difference mapping based on the design change work is created and the planned difference mapping is compared to the actual difference mapping to see if additional changes to the mapping metamodel are needed.

Abstract: Systems and methods are provided for generating classification data which is used for classifying documents. The method includes reading documents in a form of a spreadsheet; collecting cell values in each of the documents; finding one or more common cell values among the collected values; counting, for each of the common cell values, a number of the documents having the common cell value; storing, if the number of the documents is equal to or larger than a predetermined number, the common cell value as a candidate header label in a memory; calculating a distance between cell locations of the candidate header labels in each of the documents; choosing, according to the calculated distance, two or more candidate header labels among the candidate header labels for each of the documents; and storing one or more combinations of the chosen two or more candidate header labels as the classification data.

Abstract: Computing a date and time format includes obtaining a UT value of a reference time; computing intermediate data including year, month, day, hour, minute, and second, from the UT value of the reference time; computing a difference between a conversion target UT value and the UT value of the reference time using a processor; computing values of hour, minute, and second, based on the difference between the UT values; and generating a character string format representing year, month, day, hour, minute, and second, by combining the intermediate data and the values of hour, minute, and second.

Abstract: Computing a date and time format includes obtaining a UT value of a reference time; computing intermediate data including year, month, day, hour, minute, and second, from the UT value of the reference time; computing a difference between a conversion target UT value and the UT value of the reference time using a processor; computing values of hour, minute, and second, based on the difference between the UT values; and generating a character string format representing year, month, day, hour, minute, and second, by combining the intermediate data and the values of hour, minute, and second.

Abstract: Computing a date and time format includes obtaining a UT value of a reference time; computing intermediate data including year, month, day, hour, minute, and second, from the UT value of the reference time; computing a difference between a conversion target UT value and the UT value of the reference time using a processor; computing values of hour, minute, and second, based on the difference between the UT values; and generating a character string format representing year, month, day, hour, minute, and second, by combining the intermediate data and the values of hour, minute, and second.

Abstract: Computing a date and time format includes obtaining a UT value of a reference time; computing intermediate data including year, month, day, hour, minute, and second, from the UT value of the reference time; computing a difference between a conversion target UT value and the UT value of the reference time using a processor; computing values of hour, minute, and second, based on the difference between the UT values; and generating a character string format representing year, month, day, hour, minute, and second, by combining the intermediate data and the values of hour, minute, and second.

Abstract: 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 execution. Yet in another aspect, a system and method obtains information about array ranges already checked by performing data-flow analysis in program execution order and eliminate redundant array range checks from this information.

Abstract: To collect frequencies with which processes of a program are executed at high speed. A compiler apparatus for optimizing a program based on frequencies with which each process is executed has a loop process detection portion for detecting a repeatedly executed loop process of the program, a loop process frequency collection portion for collecting loop process frequencies with which the loop process is executed in the program, an in-loop process frequency collection portion for collecting in-loop process frequencies with which, as against times of execution of loop process, each of a plurality of in-loop processes included in the loop process is executed, an in-loop execution information generating portion for generating in-loop execution information indicating the frequencies with which each of the plurality of in-loop processes is executed in the case where the program is executed, and an optimization portion for optimizing the program based on the in-loop execution information.

Abstract: It is one object of the present invention to provide a program execution method for performing greater optimization. A program execution apparatus according to the present invention performs a transfer from an interpreter process to a compiled code process in the course of the execution of a method. At this time, if no problem occurs when a transfer point is moved to the top of a loop, the transfer point for code is so moved. And when a transfer point is located inside a loop, a point that post-dominates the top of the loop and the transfer point is copied to a position immediately preceding the loop. Then, information for generating recalculation code is provided for the transfer point, and a recalculation is performed.

Abstract: The efficient performance of prefetching of data prior to the reading of the data by a program. A prefetching apparatus, for prefetching data from a file to a buffer before the data is read by a program, includes: a history recorder, for recording a history for a plurality of data readings issued by the program while performing data reading; a prefetching generator, for generating a plurality of prefetchings that correspond to the plurality of data readings recorded in the history; a prefetching process determination unit, for determining, based on the history, the performance order for the plurality of prefetchings; and a prefetching unit, for performing, when following the determination of the performance order the program is executed, the plurality of prefetchings in the performance order.