Abstract: A computer-implemented method, program product, and system for determining the validity of a string generated by a computer programming language program. The method includes: abstracting a constraint between variables extracted from a source code for a programming language, describing the constraint in M2L, and storing the constraint; and evaluating the validity of the string on an M2L solver on the basis of the constraint and a M2L specification to determine whether the string is safe or unsafe.

Abstract: A computer-implemented method, program product, and system for determining the validity of a string generated by a computer programming language program. The method includes: abstracting a constraint between variables extracted from a source code for a programming language, describing the constraint in M2L, and storing the constraint; and evaluating the validity of the string on an M2L solver on the basis of the constraint and a M2L specification to determine whether the string is safe or unsafe.

Abstract: It is determined whether a plurality of screens to be sequentially displayed by a process of a program satisfies a specification without executing this program. A system of the present invention stores a first schema prescribing a specification of a first screen, a second schema prescribing a specification of a second screen, and an event switching the display by program from the first screen to the second screen. First, a partial program executed in response to an event generated during displaying the screen satisfying the first schema is extracted from a program on the basis of the first schema and the event. Next, an intermediate program for calculating a set of screens being displayed in response to an event generated during displaying screens in a set of screens satisfying the first schema from this set is generated on the basis of the partial program.

Abstract: The computer program enables a computer to function as: means for transforming a static call graph into a syntax tree having a binary tree structure; means for transforming a protocol state diagram into a stochastic process algebraic form; means for transforming an activity diagram into a stochastic process algebraic form; means for obtaining a stochastic process algebraic form of each of classes by merging the stochastic process algebraic form of the protocol state diagram, and the stochastic process algebraic form of the activity diagram; and means for obtaining a stochastic algebraic form of a whole system from the syntax tree, and from the stochastic process algebraic forms of the classes.

Abstract: A system, such as hardware or software system having a number of modules, is simulated using multi-tasking computer code. Simulation computer code launches tasks simulating system execution, where each task corresponds to a module. Each task requests a processing delay to a common scheduler. Upon the common scheduler receiving a processing delay request, the common scheduler instructs a scheduling method processor to update a task-remaining time for at least one task. The scheduling method processor updates the task-remaining time for at least one task based at least on a scheduling approach. The common scheduler sends a wait request to a preexisting simulation system to delay a module that corresponds to the task by a length of time, based on the task-remaining time for the task and the scheduling approach. The preexisting simulation system delays the module that corresponds to the task by the length of time of the wait request.

Abstract: Systems, methods and computer program products for string analysis with security labels for vulnerability detection. Exemplary embodiments include a method in a computer system configured to analyze security-labeled strings and to detect vulnerability, the method including receiving a program with security labels, translating the program into a static single assignment form, constructing a control flow graph having basic blocks as nodes, extracting instructions relating to string functions and object variables, calculating pre-conditions of variables for the basic blocks, extracting constraints among the variables subject to a rule set for translating pre-conditions, solving the constraints and obtaining a set of strings that he object variables form as a context-free grammar to obtain a set of security-labeled strings, checking if the set of security-labeled strings satisfies a rule of the rule set for translating pre-conditions and identifying locations in the program where a vulnerability is detected.

Abstract: It is determined whether a plurality of screens to be sequentially displayed by a process of a program satisfies a specification without executing this program. A system of the present invention stores a first schema prescribing a specification of a first screen, a second schema prescribing a specification of a second screen, and an event switching the display by program from the first screen to the second screen. First, a partial program executed in response to an event generated during displaying the screen satisfying the first schema is extracted from a program on the basis of the first schema and the event. Next, an intermediate program for calculating a set of screens being displayed in response to an event generated during displaying screens in a set of screens satisfying the first schema from this set is generated on the basis of the partial program.

Abstract: It is determined whether a plurality of screens to be sequentially displayed by a process of a program satisfies a specification without executing this program. A system of the present invention stores a first schema prescribing a specification of a first screen, a second schema prescribing a specification of a second screen, and an event switching the display by program from the first screen to the second screen. First, a partial program executed in response to an event generated during displaying the screen satisfying the first schema is extracted from a program on the basis of the first schema and the event. Next, an intermediate program for calculating a set of screens being displayed in response to an event generated during displaying screens in a set of screens satisfying the first schema from this set is generated on the basis of the partial program.

Abstract: The computer program enables a computer to function as: means for transforming a static call graph into a syntax tree having a binary tree structure; means for transforming a protocol state diagram into a stochastic process algebraic form; means for transforming an activity diagram into a stochastic process algebraic form; means for obtaining a stochastic process algebraic form of each of classes by merging the stochastic process algebraic form of the protocol state diagram, and the stochastic process algebraic form of the activity diagram; and means for obtaining a stochastic algebraic form of a whole system from the syntax tree, and from the stochastic process algebraic forms of the classes.

Abstract: A system, such as hardware or software system having a number of modules, is simulated using multi-tasking computer code. Simulation computer code launches tasks simulating system execution, where each task corresponds to a module. Each task requests a processing delay to a common scheduler. Upon the common scheduler receiving a processing delay request, the common scheduler instructs a scheduling method processor to update a task-remaining time for at least one task. The scheduling method processor updates the task-remaining time for at least one task based at least on a scheduling approach. The common scheduler sends a wait request to a preexisting simulation system to delay a module that corresponds to the task by a length of time, based on the task-remaining time for the task and the scheduling approach. The preexisting simulation system delays the module that corresponds to the task by the length of time of the wait request.