System and method for software test analysis
US-2024419581-A1 · Dec 19, 2024 · US
US9396099B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9396099-B2 |
| Application number | US-14520008-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 24, 2008 |
| Priority date | Jun 24, 2008 |
| Publication date | Jul 19, 2016 |
| Grant date | Jul 19, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for controlling a computer-implemented application, the method including determining a current state of a computer-implemented application, inducing the application into a predefined state associated with a target action of the application if the current state does not match the predefined state in accordance with predefined match criteria, and causing the target action to be performed.
Opening claim text (preview).
What is claimed is: 1. A method implemented by a computer for controlling a computer-implemented application for automated testing of the application, the method comprising: determining, by the computer, a current state of the computer-implemented application; determining, by the computer, a prerequisite action set for a target action, wherein the action set is a sequence in which a plurality of actions are performed and is generated by generating non- looping graphs of possible action paths; inducing, by the computer, said application into a predefined state associated with the target action of said application if said current state does not match said predefined state in accordance with predefined match criteria; selecting, by the computer, a path from a root application point to the target action having the fewest number of actions needed to perform the target action wherein the selected path comprises a subset of actions from a set of actions, wherein the subset of actions will induce the predefined state without using two or more actions included in the prerequisite action set; implementing, by the computer, the subset; causing, by the computer, said target action to be performed; identifying, by the computer, at least one candidate subset of zero or more actions of said set of actions, wherein performing said candidate subset of actions produces a state that matches a predefined state associated with said target action according to the predefined match criteria; selecting, by the computer, one of said candidate subsets that includes the fewest number of actions of said candidate subsets; and performing, by the computer, said selected candidate subset responsive to detecting a request that said computer-implemented application perform said target action; wherein if the identified candidate subset differs from the prerequisite action set, and the candidate subset produces the predefined state, it is determined that said computer-implemented application does not enforce the prerequisite action set. 2. The method according to claim 1 wherein said determining the current state, inducing, and causing steps are performed responsive to detecting, by the computer, a request that said computer-implemented application perform said target action. 3. The method according to claim 1 wherein said inducing step comprises performing, by the computer, a predefined set of actions of said application whose performance is known to induce said predefined state. 4. The method according to claim 3 wherein said performing step comprises performing, by the computer, said set of actions in accordance with a predefined sequence. 5. The method according to claim 1 , wherein: selecting, by the computer, the path from the root application point to the target action having the fewest number of actions needed to perform the target action is performed without using any of the actions included in the prerequisite action set. 6. A system for controlling a computer-implemented application for automated testing of the application, the system comprising: a processor and a memory; a state detector configured to determine a current state of the computer-implemented application; a determiner configured to determine a prerequisite action set for a target action, wherein the action set is a sequence in which a plurality of actions are performed and is generated by generating non-looping graphs of possible action paths; a state inducer configured to induce said application into a predefined state associated with a target action of said application if said current state does not match said predefined state in accordance with predefined match criteria; a selector configured to select a path from a root application point to the target action having the fewest number of actions needed to perform the target action wherein the selected path comprises a subset of actions from a set of actions, wherein the subset of actions will induce the predefined state without using two or more actions included in the prerequisite action set; an implementer configured to implement the subset; a target action manager configured to cause or allow said target action to be performed; and an action set optimizer configured to: identify at least one candidate subset of zero or more actions of a set of actions of said computer-implemented application, said set associated with a target action of said application, wherein performing said candidate subset of actions produces a result that results in a state that matches a predefined state associated with said target action according to the predefined match criteria, and select one of said candidate subsets that includes the fewest number of actions of said candidate subsets, and wherein said state inducer is configured to cause said computer-implemented application to perform said selected candidate subset responsive to detecting a request that said computer-implemented application perform said target action; and wherein if the identified candidate subset differs from the prerequisite action set, and the candidate subset produces the predefined state, it is determined that said computer-implemented application does not enforce the prerequisite action set. 7. The system according to claim 6 wherein said state detector, state inducer, and target action manager are operative responsive to the detection of a request that said computer-implemented application perform said target action. 8. The system according to claim 6 wherein said state inducer is configured to cause said computer-implemented application to perform a predefined set of actions of said application whose performance is known to induce said predefined state. 9. The system according to claim 8 wherein said state inducer is configured to perform said set of actions in accordance with a predefined sequence. 10. The system according to claim 6 , wherein: the selector is configured to select the path from the root application point to the target action having the fewest number of actions needed to perform the target action without using any of the actions included in the prerequisite action set. 11. A computer program product for automated testing of an application, the computer program product comprising a non-transitory computer-readable medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to: determine a current state of a computer-implemented application; determine a prerequisite action set for a target action, wherein the action set is a sequence in which a plurality of actions are performed and is generated by generating non-looping graphs of possible action paths; induce said application into a predefined state associated with a target action of said application if said current state does not match said predefined state in accordance with predefined match criteria; select a path from a root application point to the target action having the fewest number of actions needed to perform the target action wherein the selected path comprises a subset of actions from a set of actions, wherein the subset of actions will induce the predefined state without using two or more actions included in the prerequisite action set; implement the subset; cause said target action to be performed; identify at least one candidate subset of zero or more actions of said set of actions, wherein performing said candidate subset of actions produces a result that a) matches a known result of said set of actions in accordance with the predefined match criteria, or b) results in a state that matches a predefined state associated with said target action according to the predefine
for test execution, e.g. scheduling of test suites · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.