Abstract: A test case generation method includes in a processor, extracting descriptions from document artifacts, extracting a first set of keywords from the descriptions, categorizing the descriptions to a first set and a second set, extracting a second set of keywords that occur in the second set and generating a test case from the second set of keywords.

Abstract: To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.

Abstract: To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.

Abstract: A method for acquiring an input value such that an output value differs before and after refactoring is not known and an information processing apparatus searching for such an input value that inequivalent output values can be brought about for the equivalent input values among multiple target programs. The apparatus including: an acquisition section acquiring, for each of the multiple target programs, an input/output constraint showing a condition to be satisfied by an input value and an output value; a constraint condition generating section generating a constraint condition which becomes true when the multiple input/output constraints for the multiple target programs are satisfied, input values for the multiple target programs are equivalent, and output values for the multiple target programs are not equivalent; and a constraint releasing section giving the constraint condition to a constraint solver to obtain an input value satisfying the constraint condition.

Abstract: A computer implemented method, a computer system, and a program for generating a parser combination. The method includes: generating a parser combination by combining parsers each associated with at least one grammar description, where the step is carried out using (i) at least one grammar description means and (ii) a computer device. The computer system includes: a processor, a memory connected to the processor, and a parser generator for generating a parser combination in the memory by combining parsers each associated with at least one grammar description, and at least one grammar description type means.

Abstract: A test case generation system includes a processor, a process residing on the processor and configured to extract descriptions from document artifacts, extract a first set of keywords from the descriptions, categorize the descriptions to a first set and a second set, extract a second set of keywords that occur in the second set and generate a test case from the second set of keywords.

Abstract: A computer-implemented method is disclosed for determining a calculation expression for finding a KPI relating to a business process (process KPI) on the basis of a KPI obtained in each task (task KPI), the business process being representable as a graph structure including a plurality of tasks and edges representing how processing of the tasks proceeds. The method includes preparing a table defining a group of composite operation expressions for the task KPIs of the plurality of tasks, the composite operation expressions being associated with a predetermined relation of the plurality of tasks for each task KPI type; determining composite operation expressions for the task KPIs over the business process for each task KPI type by referring to the table; and creating a calculation expression for finding the process KPI of the business process using the composite operation expressions for the task KPIs over the business process.

Abstract: A test case generation method includes in a processor, extracting descriptions from document artifacts, extracting a first set of keywords from the descriptions, categorizing the descriptions to a first set and a second set, extracting a second set of keywords that occur in the second set and generating a test case from the second set of keywords.

Abstract: A test case generation system includes a processor, a process residing on the processor and configured to extract descriptions from document artifacts, extract a first set of keywords from the descriptions, categorize the descriptions to a first set and a second set, extract a second set of keywords that occur in the second set and generate a test case from the second set of keywords.

Abstract: The present invention provides a method of extracting a transformation pattern as an approximate pattern expression. In the process of transforming the sets of input strings to at least one pattern expression, the transformation pattern transforming the sets of input strings to the pattern expression. The method includes: 1) preparing one structure including multiple nodes each representing a state and multiple edges each representing a transition; 2) generating a first reduced structure by removing at least one state in one structure from one structure and by merging at least two edges including an edge associated with the removed state in the one structure; 3) generating a first approximate pattern expression based on the first reduced structure; and 4) presenting the first approximate pattern expression.

Abstract: To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.

Abstract: To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.

Abstract: Techniques are disclosed for effectively reflecting a manipulation of an object in graph data. In one example, a method enables a manipulation performed on an object as an image of a mapping of at least a part of graph data including nodes and edges to be reflected in the graph data. The method includes the step of specifying, from among nodes in the graph data that are related to the object being modified by the manipulation, a shared node that may be related to another object as well, and the step of reflecting the manipulation in the graph data while preventing the shared node from being modified.

Abstract: Techniques are disclosed for effectively reflecting a manipulation of an object in graph data. In one example, a method enables a manipulation performed on an object as an image of a mapping of at least a part of graph data including nodes and edges to be reflected in the graph data. The method includes the step of specifying, from among nodes in the graph data that are related to the object being modified by the manipulation, a shared node that may be related to another object as well, and the step of reflecting the manipulation in the graph data while preventing the shared node from being modified.

Abstract: A source code of a program is used to identify a first portion of the program that is predicted as being written by a first developer wherein a remaining portion of the program is written by a second developer. The program includes a plurality of program elements. Style information is extracted from each of the program elements. The style information is analyzed to identify a first set of program elements which have a first style corresponding to the first developer, wherein the first style differs from a second style corresponding to the second developer and used by a second set of program elements comprising remaining program elements of the plurality of program elements, and wherein the style information identifies a pattern indicative of how one or more non-syntactic characters have been inserted among syntactic program elements of the plurality of program elements.

Abstract: A computer implemented method, a computer system, and a program for generating a parser combination. The method includes: generating a parser combination by combining parsers each associated with at least one grammar description, where the step is carried out using (i) at least one grammar description means and (ii) a computer device. The computer system includes: a processor, a memory connected to the processor, and a parser generator for generating a parser combination in the memory by combining parsers each associated with at least one grammar description, and at least one grammar description type means.

Abstract: A source code of a program is used to identify a first portion of the program that is predicted as being written by a first developer wherein a remaining portion of the program is written by a second developer. The program includes a plurality of program elements. Style information is extracted from each of the program elements. The style information is analyzed to identify a first set of program elements which have a first style corresponding to the first developer, wherein the first style differs from a second style corresponding to the second developer and used by a second set of program elements comprising remaining program elements of the plurality of program elements, and wherein the style information identifies a pattern indicative of how one or more non-syntactic characters have been inserted among syntactic program elements of the plurality of program elements.