Abstract: The present disclosure relates to a method for correcting the operation of a target computer system constrained by an inconsistent set of timed requirements, the set of timed requirements comprising a first subset and a second subset, said method comprising initializing a set of constraints based on a witness trace of the inconsistency, and iterating steps of: •—modifying the second subset of timed requirements to obtain an updated set of timed requirements for which each constraint in the set of constraints is satisfied; •—searching for a further witness trace of the inconsistency of the updated set of timed requirements; •—when a further witness trace is found: augmenting the set of constraints based on said further witness trace; wherein the operation of the target computer system is considered corrected when no further witness trace is found for an updated set of timed requirements.

Abstract: The present disclosure relates to a method for testing the operation of a target computer system constrained by a set of timed requirements. For each of a plurality of subsets of the set, the method includes: searching for a witness trace satisfying a criterion for detecting a conflict between timed requirements of the subset; when a witness trace is found: searching for a contradicting timed requirement among the timed requirements of the set which are not present in the subset; when a contradicting timed requirement is found: adding the contradicting timed requirement to the incremental subset. An inconsistency of the operation of the target computer system is detected when a witness trace is found for and no contradicting timed requirement is found.

Abstract: An equivalence verification unit (130) judges through equivalence verification, for each of corresponding combinations which are each a combination of a function included in pre-change source code and a function included in post-change source code, whether the functions included in the corresponding combination are equivalent to each other. A partial verification judgment unit (150) judges, for each of inequivalent ones of the corresponding combinations, whether the corresponding combination is a partial verification combination including a function where an inequivalent path, in which an inequivalent function is called, and a non-inequivalent path, in which a non-inequivalent function is called, are both included. A partial verification unit (160) judges, for each of the partial verification combinations, whether the functions included in the partial verification combination are partially equivalent to each other by excluding the inequivalent path and performing the equivalence verification.

Abstract: A non-equivalence set extraction unit (120) extracts, from a target set list, a non-equivalence set being a target set that does not satisfy a condition that an output of an after-change target function is coincident with an output of a before-change target function when a same input is provided to both of the before-change target function and the after-change target function. A test case selection unit (140) selects, from a plurality of test cases, a test case wherein the before-change target function included in the non-equivalence set is called, as an important test case.

Abstract: An equivalence verification unit (130) judges through equivalence verification, for each of corresponding combinations which are each a combination of a function included in pre-change source code and a function included in post-change source code, whether the functions included in the corresponding combination are equivalent to each other. A partial verification judgment unit (150) judges, for each of inequivalent ones of the corresponding combinations, whether the corresponding combination is a partial verification combination including a function where an inequivalent path, in which an inequivalent function is called, and a non-inequivalent path, in which a non-inequivalent function is called, are both included. A partial verification unit (160) judges, for each of the partial verification combinations, whether the functions included in the partial verification combination are partially equivalent to each other by excluding the inequivalent path and performing the equivalence verification.