Patent US5692122A successfully refreshed from Google Patents.
US5692122A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Generation of random conversation testcases
Assignee: International Business Machines Corp
•
Filing: 1995-06-07
•
Granted: 1997-11-25
•
Expires: 2015-06-07
Abstract
Abstract A method of generating pairs of random interprogram conversation testcases is provided in which conversation statements are selected with which to construct the testcases in dependence on what statements are permitted for the predicted current conversation states of the testcases. The effect of each statement that is added to the testcases on the states of the testcases at eventual execution is predicted from predefined state tables for particular conversation protocols. As each conversation-type statement is added to a testcase, it is determined whether matching statements must be added to the other testcase and, if so, these matching statements are randomly generated in the same way. Self-checking code is added to the testcases to check correct execution. The method is particularly suitable for testing the support of asynchronous conversations between transaction processing programs running in different CICS systems.
Inventors
- 👤 David L. Bird
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 16:47
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/36; G06F11/3668; G06F11/3672; G06F11/3684; G06F9/00; G06F9/06; G06F9/46; G06F9/466; G06F9/54
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
219 words
A method of generating testcase programs for a distributed computer system in which a conversation between partners in remote processors or regions at respective ends of said conversation employs interprogram conversation statements according to a predetermined protocol which also defines conversation states of said partners, each of said partners having a current conversation state, the method comprising the steps of: (a) randomly generating an example of an interprogram conversation statement for one of said partners which is valid for the current conversation state of that partner; (b) adding the randomly generated example of an interprogram conversation statement to a first testcase program for that partner; (c) if any randomly generated statement for the first testcase program requires a matching statement at the other end of the conversation according to said protocol, randomly generating an example of an interprogram conversation statement for the other partner which is valid for the current conversation state of that partner; (d) adding the matching statement to a second testcase program for the other partner; and (e) predicting for each generated interprogram conversation statement any changes of state to said partners that will occur on execution of the respective randomly generated examples of interprogram statements prior to generation of each such subsequent statement, whereby the validity of subsequent statements under said protocol can be predetermined.
Claim 2
Independent Claim
219 words
A method of generating testcase programs for a distributed computer system in which a conversation between partners in remote processors or regions at respective ends of said conversation employs interprogram conversation statements according to a predetermined protocol which also defines conversation states of said partners, each of said partners having a current conversation state, the method comprising the steps of: (a) randomly generating an example of an interprogram conversation statement for one of said partners which is valid for the current conversation state of that partner; (b) adding the randomly generated example of an interprogram conversation statement to a first testcase program for that partner; (c) if any randomly generated statement for the first testcase program requires a matching statement at the other end of the conversation according to said protocol, randomly generating an example of an interprogram conversation statement for the other partner which is valid for the current conversation state of that partner; (d) adding the matching statement to a second testcase program for the other partner; and (e) predicting for each generated interprogram conversation statement any changes of state to said partners that will occur on execution of the respective randomly generated examples of interprogram statements prior to generation of each such subsequent statement, whereby the validity of subsequent statements under said protocol can be predetermined.
Claim 3
Dependent Claim
78 words
A method as claimed in claim 1 for generating nonconversational program statements for testcase programs, including the steps of: initially randomly selecting a type of program statement to be added to the testcase programs; if the randomly selected type is an interprogram conversation type, carrying out steps (a) to (e); if the randomly selected type is a nonconversational type, randomly generating an example of a nonconversational program statement; and adding the nonconversational program statement to the first testcase.
Claim 4
Dependent Claim
50 words
A method as claimed in claim 2 in which said steps of randomly selecting a type of program statement and randomly generating an example of a nonconversational program statement are repeated until a predetermined number of statements have been added to said testcase programs in response to operator input information.
Claim 5
Dependent Claim
37 words
A method as claimed in claim 2 including the step of weighting said step of randomly selecting a type of program statement to preferentially select the type and/or frequency of statements in response to operator input information.
Claim 6
Dependent Claim
33 words
A method as claimed claim 1 in which checking statements are added to said first and second testcase programs for checking for correct execution of the randomly generated examples of interprogram conversation statements.
Claim 7
Dependent Claim
45 words
A method as claimed in claim 1 in which interprogram conversation statements and conversation states may conform to a plurality of different protocols, the method comprising the additional step of initially selecting one of said plurality of different protocols in response to operator input information.
References Cited (Backward Citations)
US4437184A
Cited
US4617663A
Cited
US4595981A
Cited
US4742467A
Cited
US4797885A
Cited
US4953096A
Cited
US5335342A
Cited
US5357452A
Cited
US5359546A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-11-24 | 2001-05-26 | 2001-11-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-11-24 | 2005-05-26 | 2005-11-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-11-24 | 2009-05-26 | 2009-11-25 | $7700.00 | Window Closed / Lapsed |