CN105095060A - Device and method for generating test case by using rule set network - Google Patents
Device and method for generating test case by using rule set network Download PDFInfo
- Publication number
- CN105095060A CN105095060A CN201410151595.0A CN201410151595A CN105095060A CN 105095060 A CN105095060 A CN 105095060A CN 201410151595 A CN201410151595 A CN 201410151595A CN 105095060 A CN105095060 A CN 105095060A
- Authority
- CN
- China
- Prior art keywords
- node
- constraint
- restriction
- examples
- rule
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention provides a device and a method for generating test cases by using a rule set network. A rule set network comprises a root node, one or more intermediate nodes, and one or more terminal nodes, and each node is provided with respective local restriction. The device comprises a traversal unit, a case information acquisition unit, and a test case generation unit. The traversal unit is configured to be used to calculate global restriction of each node through traversing the rule set network, wherein the global restriction of each node is obtained by combining local restriction of an ancestor node of the node and the local restriction of the node. The case information acquisition unit is configured to be used to obtain case information used to generate test cases according to the global restriction of the terminal nodes. The test case generation unit is configured to be used to generate a test case according to the case information. According to the technical scheme, the device and the method can effectively realize to automatically generate a test case in BRMS.
Description
Technical field
The present invention relates to technical field of information processing, relate more specifically to a kind of apparatus and method utilizing rule set network generating test use case.
Background technology
In Business Rules Management System (BusinessRuleManagementSystem, BRMS), service logic is represented by the form of rule (Rules).BRMS makes user can change service logic by alteration ruler instead of amendment code.Because business rule is understood and amendment relative to the business expert that is more convenient for code, therefore BRMS is relative to more flexible traditional software.By example (Facts) and the condition of rule are carried out pattern match, BRMS regulation engine can find out the example that satisfies condition and corresponding rule, and after managing conflict executing rule.Wherein, Rete is one of pattern matching algorithm in regulation engine, and it improves the efficiency of pattern match by shared portion matching result among the nodes.
For BRMS, one of them problem how tests to ensure the correctness of these rules, integrality and consistance to rule.Traditional BRMS method of testing, as OpenRules, require user's manual creation test case, this is quite time consuming, and does not reach good coverage rate.
Therefore, people wish that a kind of method can automatically generating test use case, and can test rule all sidedly.But the automatic example generation method for traditional software can not be applicable to BRMS.For traditional software, logic is described by function or method, therefore can carry out test to ensure software quality to these functions or method.Meanwhile, due to function or method clear stipulaties input/output argument, so be easy to carry out generating test use case according to these input and output.But for BRMS, logic is represented by the condition of rule and action, and the input of rule is specified implicitly through to the expectation of the example existed in working memory.Generating test use case from condition and action is also not easy, because with come according to function or method generating test use case unlike, needing to calculate before generating test use case needs to generate how many examples for each class and could cover test to strictly all rules, and determines the value of each attribute of example.
Summary of the invention
Give hereinafter about brief overview of the present invention, to provide about the basic comprehension in some of the present invention.But, should be appreciated that this general introduction is not summarize about exhaustive of the present invention.It is not that intention is used for determining critical component of the present invention or pith, neither be intended to for limiting scope of the present invention.Its object is only provide about some concept of the present invention in simplified form, in this, as the preorder in greater detail provided after a while.
In view of the said circumstances of prior art, the object of this invention is to provide a kind of apparatus and method utilizing rule set network generating test use case, to realize automatic generating test use case in BRMS.
To achieve these goals, according to an aspect of the present invention, provide a kind of device utilizing rule set network generating test use case, wherein said rule set network comprises root node, one or more intermediate node and one or more terminal node, and each Node configuration has respective local restriction, described device comprises: Traversal Unit, it is arranged to the global restriction calculating each node by traveling through described rule set network, wherein the global restriction of each node is obtained by the combination local restriction of its ancestor node and the local restriction of himself, example information acquiring unit, it is arranged to the global restriction according to described terminal node, obtain and be used for the example information of generating test use case, wherein said example information comprises the span needing to be included in example set in test case and each instance properties, and Test cases technology unit, it is arranged to according to described example information, generating test use case.
According to another aspect of the present invention, additionally provide a kind of method utilizing rule set network generating test use case, wherein said rule set network comprises root node, one or more intermediate node and one or more terminal node, and each Node configuration has respective local restriction, described method comprises: the global restriction calculating each node by traveling through described rule set network, and wherein the global restriction of each node is obtained by the combination local restriction of its ancestor node and the local restriction of himself; According to the global restriction of described terminal node, obtain and be used for the example information of generating test use case, wherein said example information comprises the span needing to be included in example set in test case and each instance properties; And according to described example information, generating test use case.
According to another aspect of the present invention, additionally provide for realizing the above-mentioned computer program utilizing the method for rule set network generating test use case.
According to another aspect of the present invention, additionally providing computer-readable medium, it recording for realizing the above-mentioned computer program code utilizing the method for rule set network generating test use case.
According to technique scheme of the present invention, automatic generating test use case in BRMS effectively can be realized.
Accompanying drawing explanation
The present invention can be better understood by reference to hereinafter given by reference to the accompanying drawings detailed description, wherein employs same or analogous Reference numeral in all of the figs to represent identical or similar parts.Described accompanying drawing comprises in this manual together with detailed description below and forms a part for instructions, is used for illustrating the preferred embodiments of the present invention further and explaining principle and advantage of the present invention.In the accompanying drawings:
Fig. 1 is the block diagram of a kind of exemplary construction of the device of the generating test use case illustrated according to the embodiment of the present invention;
Fig. 2 is the exemplary plot schematically showing Rete network;
Fig. 3 be illustrate that global restriction comprises various types of constraints between the schematic diagram of relation;
Fig. 4 is the process flow diagram of a kind of exemplary process of the method for the generating test use case illustrated according to the embodiment of the present invention; And
Fig. 5 is the block diagram that the example arrangement wherein realizing computing machine of the present invention is shown.
The element that it will be appreciated by those skilled in the art that in accompanying drawing be only used to simple and clear for the purpose of illustrate, and not necessarily to draw in proportion.Such as, in accompanying drawing, the size of some element may be exaggerated relative to other element, to contribute to improving the understanding to the embodiment of the present invention.
Embodiment
To be described one exemplary embodiment of the present invention by reference to the accompanying drawings hereinafter.For clarity and conciseness, all features of actual embodiment are not described in the description.But, should understand, must make a lot specific to the decision of embodiment in the process of any this practical embodiments of exploitation, to realize the objectives of developer, such as, meet those restrictive conditions relevant to system and business, and these restrictive conditions may change to some extent along with the difference of embodiment.In addition, although will also be appreciated that development is likely very complicated and time-consuming, concerning the those skilled in the art having benefited from present disclosure, this development is only routine task.
At this, also it should be noted is that, in order to avoid the present invention fuzzy because of unnecessary details, illustrate only in the accompanying drawings with according to the closely-related apparatus structure of the solution of the present invention and/or treatment step, and eliminate other details little with relation of the present invention.
As described above, in prior art, the method for automatic generating test use case can not be applicable to BRMS.The present invention proposes a kind of apparatus and method utilizing rule set network generating test use case, it can integrate network as business rule generating test use case by traversal rule, have effectively achieved automatic generating test use case in BRMS.
The apparatus and method of the generating test use case according to the embodiment of the present invention are described using Rete network as the example of rule set network below.But, it will be clear to one skilled in the art that the present invention also goes for other rule set networks except Rete network.
An example of the device of the generating test use case according to the embodiment of the present invention is described in detail below in conjunction with Fig. 1.
As shown in Figure 1, Traversal Unit 110, example information acquiring unit 120 and Test cases technology unit 130 is comprised according to the device 100 of the generating test use case of the embodiment of the present invention.
First, need to do following preliminary work: obtain the business rule that user provides, and the rule set be made up of business rule is compiled into Rete network.
Then, this Rete network can be input to Traversal Unit 110, Traversal Unit 110 can obtain the global restriction of each node by this Rete network of traversal.Example information acquiring unit 120 according to the global restriction of each terminal node, can obtain the example information being used for generating test use case.Test cases technology unit 130 can according to the information generating test use case of obtained example.
As mentioned above, the device 100 of generating test use case carrys out generating test use case based on traversal Rete network.Therefore, first the scheme of Rete network and traversal Rete network is introduced below.
Rete network is a kind of directed acyclic graph, is the senior representation of rule.It comprises a root node (also referred to as Rete node), one or more intermediate node (comprising entrypoint node, objecttype node, alpha node, beta node, leftinputadapter node, rightinputadapter node etc.) and multiple terminal node.Beta node is divided into again join node, not node, exists node, accumulate node etc.
Below by way of example Rete network is described.A rule set example (it is simply formed by the rule that drools rule language is write as by two) is as follows:
For above-mentioned rule set, the Rete network of its correspondence is shown in Figure 2, and this Rete network comprises a root node (Rete), multiple intermediate node and two terminal nodes (TerminalNode).Intermediate node comprises entrypoint node (EntryPointNode), objecttype node (ObjectTypeNode), alpha node (AlphaNode), beta node (JoinNode) and leftinputadapter node (LeftInputAdapterNode).
Example enters Rete network from root node.When a node receives an example, it can check whether this example meets the local restriction (LocalConstraint, LC) of this node together with other example (if any) first arriving this node.If met, so this node will accept this example, and the example collection its local restriction being satisfied this is transferred to its all child node.Repeat this process, until some example arrives certain terminal node always.If some example can arrive certain terminal node, the rule that so this terminal node is corresponding will be added to the medium conflict to be solved of conflict set by these example activation and perform.That is, the corresponding rule of each terminal node (every rule may corresponding multiple terminal node), such as: corresponding " findexperiencedgolfer " this rule of the terminal node TerminalNode (8) in Fig. 2, and corresponding " findsolution " this rule of terminal node TerminalNode (17).
The local restriction of Rete network interior joint is relevant with the type of this node.Such as, for objecttype node, its local restriction is object type.For alpha node, its local restriction is the tlv triple that Property Name, comparison operators, property value or attribute boundary are worth composition.Such as, local restriction (name ,==, " Fred ") in, " name " is the title of attribute, and "==" is comparison operators, and " Fred " is property value.For join node, not node, exists node and accumulate node, local restriction is the relation between example.For leftinputadapter node, its local restriction is empty (Φ), because it is only responsible for single instance transfer to become the tuple of an example so that the left side as beta node inputs.For root node, entrypoint node and terminal node, its local restriction is all empty.
For the Rete network shown in Fig. 2, the local restriction of each node as shown in table 1 can be obtained.
Table 1:
In Rete network, if some example can arrive a node and be accepted by this node, so these examples must meet all local restrictions of this node and all ancestor node thereof.In the present invention, the combination of the local restriction of such present node and all ancestor node thereof is defined as the global restriction (GlobalConstraint, GC) of present node.It is about intrafascicular one or more that global restriction can comprise with Types Below: to the constraint (ConstraintsOnFacts of example itself, COF), constraint (ConstraintsBetweenFacts between example in COF, CBF), do not allow the constraint (ConstraintsOnNotExistingFacts of the example existed, CONEF), example in COF and the constraint (ConstraintsBetweencommonfactandNotExistingFact between the example in CONEF, CBNEF), constraint (the ConstraintsOnExistingFacts of the example that must exist, COEF), example in COF and the constraint (ConstraintsBetweencommonfactandExistingFact between the example in COEF, CBEF), in order to perform the constraint (ConstraintsOnAccumulateFacts of the example of accumulative operation, COAF), example in COF and the constraint (ConstraintsBetweencommonfactandAccumulateFact between the example in COAF, CBAF).Wherein COF, CONEF, COEF and COAF are example constraint, and CBF, CBNEF, CBEF and CBAF retrain between example.Relation between these constraints can be as shown in Figure 3.
According to an exemplary embodiment of the present invention, global restriction GC can represent as follows:
GC=<COF,CBF,CONEF,CBNEF,COEF,CBEF,COAF,CBAF>。
COF is a set, and it can be expressed as COF={ECOF
1, ECOF
2..., ECOF
n, wherein each element (ECOF) describes the sequence of the constraint for an example.
ECOF can be expressed as ECOF=[item
1, item
2..., item
m], each (item) wherein describes the some constraints for an example.
Wherein, the item comprised in ECOF can be divided into following three types:
1, overall identification: for uniquely determining an example between and strictly all rules inner at every rule.It defines relative to the local identities in local restriction, and local identities can only determine an example in a rule inside.Overall identification can not directly obtain from Rete network, but calculates in the process of the traversal Rete network that can will describe later.Each ECOF has and only has an overall identification.Section 1 (item1) in ECOF is for describing overall identification.
2, type constraint: type constraint is used to specify the type of example corresponding to this ECOF.Each ECOF has and only has a type constraint.Section 2 (item in ECOF
2) for describing type constraint.
3, attribute constraint: for retraining certain attribute of respective instance.Each ECOF may have 0, one or more attribute constraint.Each attribute constraint can be a tlv triple being similar to the local restriction of alpha node.All attribute constraint from Section 3 in ECOF.All properties constraint can be sorted in alphabetical order.
CONEF and COEF is also a set respectively, and the element that they comprise is called ECONEF and ECOEF.The definition of ECONEF, ECOEF and ECOF is identical.But with COF unlike, these two constrain sets describe: only have the example when there is not the constraint met in CONEF in working memory, and when there is the example of the constraint met in COEF, present node just accepts and the example tuple inputted on its left side passes to its all child node.
COAF is also a set, and the element wherein comprised is called ECOAF.The definition of ECOAF and ECOF is identical.But represent in the test case generated unlike, each ECOAF with ECOF, one or more example meeting this constraint should be comprised, to carry out accumulative operation (as average, min, max, count, sum, collectList, collectSet etc.).
Retraining CBF, CBNEF, CBEF, CBAF between example is also a set all respectively, and they can be expressed as CBF, CBNEF, CBEF, CBAF={item
1, item
2..., item
l; the each element (item) wherein comprised describes a constraint between two examples; it can be a tlv triple be made up of example or instance properties title, comparison operators, example or instance properties title; wherein each example is determined by overall identification, instead of is determined by local identities.For each constraint in CBF, two examples involved by it are all from COF.For each constraint in CBNEF, two examples one involved by it are from COF, and another is from CONEF.Similarly, for CBEF and CBAF, two examples one involved by its constraint are from COF, and another is from COEF or COAF.
It should be noted that, the above expression about global restriction GC is only exemplary, and those skilled in the art can carry out various change based on instruction herein completely.Such as, in an embodiment simplified, global restriction GC only can comprise COF and CBF.In addition, only a kind of specific design that the local restriction of present node and all ancestor node thereof is combined above about the expression of global restriction GC, apparently, the present invention is not limited thereto, those skilled in the art can expect that the local restriction of other specific representation to present node and all ancestor node thereof combines easily.
As mentioned above, in Rete network, the global restriction of each node depends on its all ancestor node.Therefore, only have by traversal Rete network, just can obtain the global restriction of each node.Device 100 of the present invention can utilize Traversal Unit 110 to travel through each node of Rete network, to calculate the global restriction of each node.When Traversal Unit 110 travels through this Rete network, the global restriction of present node can be obtained by crossing the combination local restriction of present node and the global restriction of its father node.In addition, when Traversal Unit 110 travels through this Rete network, the mode of depth-first traversal can be taked, also the mode of breadth first traversal can be taked, but with traditional traversal unlike, for each node in Rete network, only having himself could be accessed after its all father node is all accessed, because must know that the global restriction of its father node could calculate the global restriction (in fact, only having bete node just may have multiple father node in Rete network) of himself.
Below by an illustrative embodiments of the traversal processing performed by detailed description Traversal Unit 110.Specifically, Traversal Unit 110 travels through Rete network based on following algorithm 1, thus obtains the global restriction of each node.
Algorithm 1:visit (N)
N is a node in Rete network.
If first time calls, so N is necessary for root node, and the state of all nodes of this Rete network is " access ".
1., if the state of N is " accessing ", so return;
2., if also there is the state of one or more father nodes of N for " access ", so return;
3. judge the type of N
If a) N is root node: arrange GC (N)=< Φ, Φ, Φ, Φ, Φ, Φ, Φ, Φ >
If b) N is entrypoint node: arrange GC (N)=< Φ, Φ, Φ, Φ, Φ, Φ, Φ, Φ >
If c) N is objecttype node: arrange GC (N)=<{ [$ n, type] }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >, wherein n represents that N is the n-th child node of its father node, and type is the value obtained from the local restriction of N, i.e. the type of example.Such as, if N is first child node of its father node and its local restriction is " Grade ", GC (N)=<{ [1, Grade] is so set }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >
If d) N is alpha node:
1) global restriction of the father node of N is first obtained.Suppose GC (father node of N)=<{ [$ m, type ... ], Φ, Φ, Φ, Φ, Φ, Φ, Φ >
2) arrange GC (N)=<{ [$ mn, type ..., LC] }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >, wherein n represents that N is the n-th child node of its father node, and LC is the local restriction of N.Such as, suppose GC (father node of N)=<{ [$ 1, Grade] }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >, N be first child node of its father node and the local restriction of N for (name ,==, " golden "), so arrange GC (N)=<{ [$ 11, Grade, (name ,==, " golden ")] }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >
3) by the attribute constraint of all ECOF of GC (N) according to letter sequence
If e) N is leftinputadapter node:
1) global restriction of the father node of N is first obtained.Suppose GC (father node of N)=<{ [$ m, type ... ], Φ, Φ, Φ, Φ, Φ, Φ, Φ >
2) arrange GC (N)=<{ [$ mn, type ... ], Φ, Φ, Φ, Φ, Φ, Φ, Φ >, wherein n represents that N is the n-th child node of its father node.Such as, suppose GC (father node of N)=<{ [$ 1, Grade] }, Φ, Φ, Φ, Φ, Φ, Φ, Φ > and n are second child node of its father node, GC (N)=<{ [$ 12, Grade] is so set }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >
If f) N is join node:
1) overall identification of ECOF unique in COF (the right father node of N) is become mn from m, wherein n for this reason join node be the n-th child node of its father node, and this new COF is designated as COF ' (the right father node of N)
2) according to the mapping between the local identities recorded and overall identification, the local identities of all examples in LC (N) is replaced to corresponding overall identification.Then, the LC after replacing it is designated as LC ' (N).
3) COF (N)=COF (the left father node of N) ∪ COF ' (the right father node of N) is set
4) CBF (N)=CBF (the left father node of N) ∪ LC ' (N) is set
5) CONEF (N)=CONEF (the left father node of N) is set
6) CBNEF (N)=CBNEF (the left father node of N) is set
7) COEF (N)=COEF (the left father node of N) is set
8) CBEF (N)=CBEF (the left father node of N) is set
9) COAF (N)=COAF (the left father node of N) is set
10) CBAF (N)=CBAF (the left father node of N) is set
11) GC (N)=<COF (N) is set, CBF (N), CONEF (N), CBNEF (N), COEF (N), CBEF (N), COAF (N), CBAF (N) >.Such as, suppose GC (the left father node of N)=<{ [$ 221, Golfer, (name,==, " Fred ")] }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >, GC (the right father node of N)=<{ [$ 231, Golfer, (name,==, " Joe "), (position,==, 2)] }, Φ, Φ, Φ, Φ, Φ, Φ, Φ >, LC (N)={ (position, unequal to, $ fred.position), (color, unequal to, $ fred.color) }, so according to said method, we can obtain GC (N)=<{ [$ 221, Golfer, (name,==, " Fred ")], [$ 2311, Golfer, (name,==, " Joe "), (position,==, 2)] }, { ($ 2311.position, unequal to, $ 221.position), ($ 2311.color, unequal to, $ 221.color) }, Φ, Φ, Φ, Φ, Φ, Φ >
If g) N is not node:
1) overall identification of ECOF unique in COF (the right father node of N) is become mn from m, wherein n for this reason not node be the n-th child node of its father node, and this new COF is designated as COF ' (the right father node of N)
2) according to the mapping between the local identities recorded and overall identification, the local identities of all examples in LC (N) is replaced to corresponding overall identification.Then, the LC after replacing it is designated as LC ' (N).
3) COF (N)=COF (the left father node of N) is set
4) CBF (N)=CBF (the left father node of N) is set
5) CONEF (N)=COF ' (the right father node of N) ∪ CONEF (the left father node of N) is set
6) CBNEF (N)=CBNEF (the left father node of N) ∪ LC ' (N) is set
7) COEF (N)=COEF (the left father node of N) is set
8) CBEF (N)=CBEF (the left father node of N) is set
9) COAF (N)=COAF (the left father node of N) is set
10) CBAF (N)=CBAF (the left father node of N) is set
11) GC (N)=<COF (N) is set, CBF (N), CONEF (N), CBNEF (N), COEF (N), CBEF (N), COAF (N), CBAF (N) >
If h) N is exists node:
1) overall identification of ECOF unique in COF (the right father node of N) is become mn from m, wherein n for this reason exists node be the n-th child node of its father node, and this new COF is designated as COF ' (the right father node of N)
2) according to the mapping between the local identities recorded and overall identification, the local identities of all examples in LC (N) is replaced to corresponding overall identification.Then, the LC after replacing it is designated as LC ' (N).
3) COF (N)=COF (the left father node of N) is set
4) CBF (N)=CBF (the left father node of N) is set
5) CONEF (N)=CONEF (the left father node of N) is set
6) CBNEF (N)=CBNEF (the left father node of N) is set
7) COEF (N)=COF ' (the right father node of N) ∪ COEF (the left father node of N) is set
8) CBEF (N)=CBEF (the left father node of N) ∪ LC ' (N) is set
9) COAF (N)=COAF (the left father node of N) is set
10) CBAF (N)=CBAF (the left father node of N) is set
11) GC (N)=<COF (N) is set, CBF (N), CONEF (N), CBNEF (N), COEF (N), CBEF (N), COAF (N), CBAF (N) >
If i) N is accumulate node:
1) overall identification of ECOF unique in COF (the right father node of N) is become mn from m, wherein n for this reason accumulate node be the n-th child node of its father node, and this new COF is designated as COF ' (the right father node of N)
2) according to the mapping between the local identities recorded and overall identification, the local identities of all examples in LC (N) is replaced to corresponding overall identification.Then, the LC after replacing it is designated as LC ' (N).
3) COF (N)=COF (the left father node of N) is set
4) CBF (N)=CBF (the left father node of N) is set
5) CONEF (N)=CONEF (the left father node of N) is set
6) CBNEF (N)=CBNEF (the left father node of N) is set
7) COEF (N)=COEF (the left father node of N) is set
8) CBEF (N)=CBEF (the left father node of N) is set
9) COAF (N)=COF ' (the right father node of N) ∪ COAF (the left father node of N) is set
10) CBAF (N)=CBAF (the left father node of N) ∪ LC ' (N) is set
11) GC (N)=<COF (N) is set, CBF (N), CONEF (N), CBNEF (N), COEF (N), CBEF (N), COAF (N), CBAF (N) >
If j) N is terminal node: arrange GC (N)=GC (father node of N)
4. the state of N is set for " accessing "
5., for each child node M of N, call visit (M)
For the Rete network shown in Fig. 2, Traversal Unit 110 adopts above-mentioned traversal scheme to travel through this Rete network based on the principle of depth-first, the traversal order of each node is as shown in the numbering in Fig. 2 interior joint bracket, by traveling through this Rete network, the global restriction of each node in this Rete network can be obtained, specifically as shown in table 2.
Table 2:
It should be noted that, the traversal processing performed by Traversal Unit 110 described above is only exemplary, and those skilled in the art can carry out various change based on instruction herein completely.Such as, above-mentioned traversal processing is realized by depth-first traversal, but apparently, as previously mentioned, it also can be realized by breadth first traversal.In addition, in above-mentioned traversal processing, node for such as Types Below processes: root node, objecttype node, entrypoint node, alpha node, leftinputadapter node, join node, not node, exists node, accumulate node and terminal node, but those skilled in the art is according to embody rule scene, the process to the wherein node of some type can be omitted, also the process of the node to other types can be increased, such as, forall grammer in Drools passes through two not nodes in Rete network, a rightinputadapter node, a join node composition, if so forall grammer will be supported, only need to add the process to rightinputadapter node again.
Those skilled in the art are to be understood that, in the traversal processing performed by Traversal Unit 110, key is that the global restriction of each node is local restriction by combining its ancestor node and the local restriction of himself and obtains, and can not limit for traversal mode and concrete ergodic algorithm.
Traversal Unit 110 travels through after this Rete network obtains the global restriction of each node, example information acquiring unit 120 can utilize the global restriction of each terminal node, obtain the example information being used for generating test use case, for Test cases technology unit 130 generating test use case.Specifically, the span needing to be included in example set in test case and each instance properties can be comprised for the example information of generating test use case.
Below by an illustrative embodiments of the process performed by detailed description example information acquiring unit 120.
First, example information acquiring unit 120 can determine according to the COF comprised in the global restriction of each terminal node the example set that needs to be included in test case.Specifically, because each ECOF in the COF of global restriction represents the constraint for single instance, and each ECOF of same node correspond to different examples, so example information acquiring unit 120 can determine according to the ECOF comprised in the global restriction of each terminal node the example set that needs to be included in test case.Such as, for the terminal node TerminalNode (8) in table 2, in its global restriction, comprise two ECOF, therefore need two examples be included in test case to be: overall identification is $ 111, type is the example of Grade; And overall identification be $ 211, type is the example of Golfer.As shown in table 3.
Table 3:
| Overall identification | Type |
| Example 1 | $111 | Grade |
| Example 2 | $211 | Golfer |
Similarly, following example can be obtained from terminal node TerminalNode (17), as shown in table 4.
Table 4:
| Overall identification | Type | |
| Example 3 | $221 | Golfer |
| Example 4 | $2311 | Golfer |
| Example 5 | $2411 | Golfer |
After obtaining example collection corresponding to each terminal node, all examples that just can obtain for generating test use case are merged to these.But, alternatively, in order to reduce the scale of test case, according to the rule preset, the example in the example collection from different terminals node can be merged.According to an illustrative embodiments, the rule merging example can set as follows:
First, if two examples have identical overall identification, so obviously they can be merged into an example.
Secondly, if 4 conditions below two instances conform, so also they can be merged into an example:
1, these two examples have different overall identification;
2, these two examples have identical type;
3, these two examples are not present in the global restriction of same terminal node, and specifically, the ECOF that the overall identification of these two examples is corresponding does not appear in the global restriction of same terminal node; And
4, two the intersection of sets collection be made up of the Property Name in the attribute constraint of these two examples are respectively empty.Specifically, two intersection of sets collection that the Property Name in the attribute constraint that the ECOF that the overall identification of these two examples is corresponding comprises respectively forms are for empty.
Such as, when the example collection shown in his-and-hers watches 3 and table 4 merges, above-mentioned example 2($ 211) and example 3($ 221) just meet above-mentioned condition:
1, example 2 has different overall identification from example 3: $ 211 and $ 221;
2, example 2 has identical type with example 3: Golfer;
3, the ECOF that the overall identification ($ 211) of example 2 is corresponding does not appear in the global restriction of terminal node TerminalNode (17), and the ECOF of the overall identification of example 3 ($ 221) correspondence does not appear in the global restriction of terminal node TerminalNode (8) yet;
4, the set that the Property Name in the attribute constraint that the ECOF that the overall identification ($ 211) of example 2 is corresponding comprises forms is { age}, the set that Property Name in the attribute constraint that ECOF corresponding to the overall identification ($ 221) of example 3 comprises forms is for { name}, these two intersection of sets collection be sky.
Therefore, example 2 and example 3 can be merged into same example.Like this, the example collection of carrying out after case combination is as shown in table 5.
Table 5:
| Overall identification | Type | |
| Example 1 | $111 | Grade |
| Example 3 (after merging) | $ 221 or $ 211 | Golfer |
| Example 4 | $2311 | Golfer |
| Example 5 | $2411 | Golfer |
In addition, it should be noted that same example can only merge with from the example of in same terminal node.Therefore, although example 2 and example 4 or example 2 and example 5, these two pairs of examples also meet the condition of merging, and example 2 can not merge with example 4 or example 5 while merging with example 3 again.In addition, if the example that there is predefined type is the example of " org.drools.reteoo.InitialFactImpl " as type, need it to remove from example collection.
It should be noted that, the rule of merging example described above is only exemplary, and those skilled in the art can carry out various change based on instruction herein completely.Such as, in another embodiment, two examples with identical overall identification can only be merged.Again such as, in another embodiment, if two examples satisfy condition 1,2 and 3 or condition 1,2 and 4 can merge.
After determining to need to be included in the example set in test case, example information acquiring unit 120 can determine all possible span of each instance properties according to the global restriction of each terminal node.
As a rule, span obtains from the attribute constraint of ECOF, ECONEF, ECOEF and ECOAF of terminal node.Such as, from the ECOF [$ 211 of terminal node TerminalNode (8), Golfer, (age, >, 30) the explicit span " >30 " of of Golfer.age attribute and two implicit spans "==30 ", " <30 " can], be obtained.For the attribute of character string type, implicit span comprises a null character string and a random string.
If the 3rd value in a certain item (tlv triple) in CBF, CBEF, CBNEF, CBAF be " overall identification " instead of " overall identification. Property Name ", so it also can be used to build the span of attribute.Such as, CBF due to terminal node TerminalNode (8) comprises ($ a 211.grade,==, $ 111), and this 3rd value 111 be " overall identification " but not " overall identification. Property Name ", so an explicit span "==111 " and an implicit span "==null " of Golfer.grade can be obtained.
In addition, if two different attributes exist relatively or assignment relation in CBF, CBEF, CBNEF, CBAF, so span set each other can merge as they common span set by they.
For above-mentioned terminal node TerminalNode (8) and terminal node TerminalNode (17), the span of the instance properties obtained according to its global restriction is as shown in table 6.
Table 6:
Utilize the global restriction of each terminal node at example information acquiring unit 120, after obtaining the example information for generating test use case, Test cases technology unit 130 can carry out generating test use case according to these example information.
Below by an illustrative embodiments of the process performed by detailed description Test cases technology unit 130.
First, Test cases technology unit 130 can select random value to generate test data in the span of instance properties.For the example set shown in table 6, can generate test data as shown in table 7, wherein " ocad ", " klsd " and " rkos " are random string.
Table 7:
| Property Name | Explicit value | Implicit value |
| Golfer.age | 45 | 30,25 |
| Golfer.position | 2 | 4,1 |
| Golfer.color | “plaid” | “”,“ocad” |
| Golfer.name | “Fred”,“Joe”,“Bob” | “”,“klsd” |
| Grade.name | “golden” | “”,“rkos” |
| Golfer.grade | $111 | null |
Then, Test cases technology unit 130 can utilize between the example in the global restriction of above-mentioned test data, the example set obtained by example information acquiring unit 120 and each terminal node and retrain (one or more in CBF, CBNEF, CBEF, CBAF), the test case needed for generation.
Continue example above, utilize the CBF of the example set in table 5, the test data in table 7 and terminal node, just required test case can be generated by the method for such as combined test, such as, utilize PICT(PairwiseIndependentCombinatorialTestingtool, independently combine testing tool in pairs) generate test case (#1 ~ #33) as shown in table 8.
Table 8:
In test case shown in table 8, owing to only comprising the constraint between an attribute ($ 211.grade) and example ($ 111) in the CBF of terminal node TerminalNode (8), and the constraint do not comprised between attribute and attribute, so only used the CBF of terminal node TerminalNode (17) when utilizing PICT generating test use case, and do not use the CBF of terminal node TerminalNode (8).
In addition, alternatively, the test case generated owing to utilizing PICT can not ensure that the every rule in Rete network at least can be activated by a test case, therefore Test cases technology unit 130 according to the global restriction of each terminal node, can generate one or more test case of the strictly all rules that can activate in Rete network.Specifically, ideally, can add an extra test case (#34 as in table 8) and activate strictly all rules in Rete network, this test case directly obtains from the global restriction of all terminal nodes structure.But, in some cases, may conflict be there is due to the rule that different terminals node is corresponding and the test case that can be activated strictly all rules cannot be built, now, a test case can be constructed respectively to activate rule corresponding to this terminal node for the global restriction of each terminal node.
In addition, alternatively, for each ECOAF in the global restriction of each terminal node, the example meeting this ECOAF of suitable number (as 1-3) can be comprised in the test case generated, whether meet expection to test accumulative operation.
In addition, alternatively, for the example that each ECONEF and ECOEF in the global restriction of each terminal node is corresponding, can check whether at least there are such two test cases: one comprises this example, another does not comprise this example.If there is no, then such test case can additionally be supplemented to final test use cases.
Describe the device utilizing rule set network generating test use case according to the embodiment of the present invention above by reference to the accompanying drawings in detail.Below in conjunction with accompanying drawing, the method utilizing rule set network generating test use case according to the embodiment of the present invention is described.
Fig. 4 shows the overview flow chart utilizing the method for Rete network (example as rule set network) generating test use case according to the embodiment of the present invention.As shown in Figure 4, the treatment scheme 400 of the method, from step S410, then performs step S420.
In the step s 420, calculate the global restriction of each node by traversal Rete network, wherein the global restriction of each node is obtained by the local restriction of its ancestor node of combination and the local restriction of himself.Here, process performed in step S420 can be identical with the process of above Traversal Unit 110 described in conjunction with Figure 1, do not repeat them here.
Next, in step S430, according to the global restriction of terminal node, obtain and be used for the example information of generating test use case, wherein this example information comprises the span needing to be included in example set in test case and each instance properties.Here, process performed in step S430 can be identical with the process of above example information acquiring unit 120 described in conjunction with Figure 1, do not repeat them here.
Next, in step S440, according to above-mentioned example information, generating test use case.Here, process performed in step S440 can be identical with the process of above Test cases technology unit 130 described in conjunction with Figure 1, do not repeat them here.
Finally, the treatment scheme 400 of the method ends at step S450.
It should be noted that, above in the description of the specific embodiment of the invention, the feature described for a kind of embodiment and/or illustrate can use in one or more other embodiment in same or similar mode, combined with the feature in other embodiment, or substitute the feature in other embodiment.
Said apparatus and method are by hardware implementing.Such hardware can be single treatment facility or multiple treatment facility.Such treatment facility can be any equipment of microprocessor, microcontroller, digital processing unit, microcomputer, the part of CPU (central processing unit), state machine, logical circuit and/or operation signal.
Should also be noted that said apparatus and method also can be realized by software and firmware.When being realized by software or firmware, from storage medium or network to the computing machine with specialized hardware structure, the program forming this software installed by multi-purpose computer 500 such as shown in Fig. 5, and this computing machine, when being provided with various program, can perform various function etc.
In Figure 5, CPU (central processing unit) (CPU) 501 performs various process according to the program stored in ROM (read-only memory) (ROM) 502 or from the program that storage area 508 is loaded into random access memory (RAM) 503.In RAM503, also store the data required when CPU501 performs various process etc. as required.
CPU501, ROM502 and RAM503 are connected to each other via bus 504.Input/output interface 505 is also connected to bus 504.
Following parts are connected to input/output interface 505: importation 506, comprise keyboard, mouse etc.; Output 507, comprises display, such as cathode-ray tube (CRT) (CRT), liquid crystal display (LCD) etc., and loudspeaker etc.; Storage area 508, comprises hard disk etc.; With communications portion 509, comprise network interface unit such as LAN card, modulator-demodular unit etc.Communications portion 509 is via network such as the Internet executive communication process.
As required, driver 510 is also connected to input/output interface 505.Detachable media 511 such as disk, CD, magneto-optic disk, semiconductor memory etc. are installed on driver 510 as required, and the computer program therefrom read is installed in storage area 508 as required.
When series of processes above-mentioned by software simulating, from network such as the Internet or storage medium, such as detachable media 511 installs the program forming software.
It will be understood by those of skill in the art that this storage medium is not limited to wherein having program stored therein shown in Fig. 5, distributes the detachable media 511 to provide program to user separately with equipment.The example of detachable media 511 comprises disk (comprising floppy disk (registered trademark)), CD (comprising compact disc read-only memory (CD-ROM) and digital universal disc (DVD)), magneto-optic disk (comprising mini-disk (MD) (registered trademark)) and semiconductor memory.Or hard disk that storage medium can be ROM502, comprise in storage area 508 etc., wherein computer program stored, and user is distributed to together with comprising their equipment.
Also it is pointed out that the step performing above-mentioned series of processes can order naturally following the instructions perform in chronological order, but do not need necessarily to perform according to time sequencing.Some step can walk abreast or perform independently of one another.
Although described the present invention and advantage thereof in detail, be to be understood that and can have carried out various change when not exiting the spirit and scope of the present invention limited by appended claim, substituting and conversion.And the scope of the application is not limited only to the specific embodiment of process described by instructions, equipment, manufacture, the structure of material, means, method and step.One of ordinary skilled in the art will readily appreciate that from disclosure of the present invention, according to the present invention can use perform the function substantially identical with corresponding embodiment described herein or obtain and its substantially identical result, existing and to be developed future process, equipment, manufacture, the structure of material, means, method or step.Therefore, appended claim is intended to comprise in their scope such process, equipment, manufacture, the structure of material, means, method or step.
According to embodiments of the invention, also disclose following remarks:
Remarks 1. 1 kinds utilizes the device of rule set network generating test use case, wherein said rule set network comprises root node, one or more intermediate node and one or more terminal node, and each Node configuration has respective local restriction, described device comprises:
Traversal Unit, it is arranged to the global restriction calculating each node by traveling through described rule set network, and wherein the global restriction of each node is obtained by the combination local restriction of its ancestor node and the local restriction of himself;
Example information acquiring unit, it is arranged to the global restriction according to described terminal node, obtain and be used for the example information of generating test use case, wherein said example information comprises the span needing to be included in example set in test case and each instance properties; And
Test cases technology unit, it is arranged to according to described example information, generating test use case.
The device of remarks 2. according to remarks 1, wherein, the global restriction of each node is obtained by the global restriction of its father node of combination and the local restriction of himself.
The device of remarks 3. according to remarks 1, wherein, described Traversal Unit is arranged to from described root node, adopts the mode of the degree of depth or breadth First to travel through described rule set network, and for each node in described rule set network, after its all father node is accessed, himself could be accessed.
The device of remarks 4. according to remarks 1, it is about intrafascicular one or more that wherein said global restriction comprises with Types Below:
First constraint, to the constraint of example self;
Second constraint, the constraint between the described first about intrafascicular example;
3rd constraint, does not allow the constraint of the example existed;
4th constraint, the constraint between the described first about intrafascicular example and described 3rd about intrafascicular example;
5th constraint, the constraint of the example that must exist;
6th constraint, the constraint between the described first about intrafascicular example and described 5th about intrafascicular example;
7th constraint, in order to perform the constraint of the example of accumulative operation; And
8th constraint, the constraint between the described first about intrafascicular example and described 7th about intrafascicular example.
The device of remarks 5. according to remarks 1, wherein, the span of described instance properties comprises: the explicit span of described instance properties and implicit span.
The device of remarks 6. according to remarks 1, wherein, described example information acquiring unit is arranged to further and merges two examples according to preset rules.
The device of remarks 7. according to remarks 6, wherein, described preset rules is one of following rule:
First rule, described two examples have identical mark;
Second Rule, described two examples have identical mark, or, described two examples there is different marks and there is identical type, described two examples are not present in the global restriction of same terminal node and two the intersection of sets collection be made up of the Property Name in the attribute constraint of described two examples are respectively empty;
Three sigma rule, described two examples have identical mark, or, described two examples there is different marks and there is identical type, described two examples are not present in the global restriction of same terminal node; And
4th rule, described two examples have identical mark, or described two examples have different marks and have identical type and two intersection of sets collection be made up of the Property Name in the attribute constraint of described two examples are respectively sky.
The device of remarks 8. according to remarks 1, wherein, described Test cases technology unit is arranged to and carrys out generating test use case by combined test method.
The device of remarks 9. according to remarks 8, wherein, described Test cases technology unit is also arranged to the global restriction according to described terminal node, generates one or more test case that can activate the strictly all rules relevant to described rule set network.
Remarks 10. 1 kinds utilizes the method for rule set network generating test use case, wherein said rule set network comprises root node, one or more intermediate node and one or more terminal node, and each Node configuration has respective local restriction, described method comprises following process:
Calculate the global restriction of each node by traveling through described rule set network, wherein the global restriction of each node is obtained by the combination local restriction of its ancestor node and the local restriction of himself;
According to the global restriction of described terminal node, obtain and be used for the example information of generating test use case, wherein said example information comprises the span needing to be included in example set in test case and each instance properties; And
According to described example information, generating test use case.
The method of remarks 11. according to remarks 10, wherein, the global restriction of each node is obtained by the global restriction of its father node of combination and the local restriction of himself.
The method of remarks 12. according to remarks 10, wherein, in the process of traversal rule collection network, from described root node, the mode of the degree of depth or breadth First is adopted to travel through described rule set network, and for each node in described rule set network, after its all father node is accessed, himself could be accessed.
The method of remarks 13. according to remarks 10, it is about intrafascicular one or more that wherein said global restriction comprises with Types Below:
First constraint, to the constraint of example self;
Second constraint, the constraint between the described first about intrafascicular example;
3rd constraint, does not allow the constraint of the example existed;
4th constraint, the constraint between the described first about intrafascicular example and described 3rd about intrafascicular example;
5th constraint, the constraint of the example that must exist;
6th constraint, the constraint between the described first about intrafascicular example and described 5th about intrafascicular example;
7th constraint, in order to perform the constraint of the example of accumulative operation; And
8th constraint, the constraint between the described first about intrafascicular example and described 7th about intrafascicular example.
The method of remarks 14. according to remarks 10, wherein, the span of described instance properties comprises: the explicit span of described instance properties and implicit span.
The method of remarks 15. according to remarks 10, wherein, in the process obtaining the example information being used for generating test use case, merges two examples according to preset rules.
The method of remarks 16. according to remarks 15, wherein, described preset rules is one of following rule:
First rule, described two examples have identical mark;
Second Rule, described two examples have identical mark, or, described two examples there is different marks and there is identical type, described two examples are not present in the global restriction of same terminal node and two the intersection of sets collection be made up of the Property Name in the attribute constraint of described two examples are respectively empty;
Three sigma rule, described two examples have identical mark, or described two examples have different marks and have identical type and described two examples are not present in the global restriction of same terminal node; And
4th rule, described two examples have identical mark, or described two examples have different marks and have identical type and two intersection of sets collection be made up of the Property Name in the attribute constraint of described two examples are respectively sky.
The method of remarks 17. according to remarks 10, wherein, in the process of generating test use case, carrys out generating test use case by combined test method.
The method of remarks 18. according to remarks 17, wherein, in the process of generating test use case, according to the global restriction of described terminal node, generates one or more test case that can activate the strictly all rules relevant to described rule set network.
Claims (10)
1. utilize a device for rule set network generating test use case, wherein said rule set network comprises root node, one or more intermediate node and one or more terminal node, and each Node configuration has respective local restriction, and described device comprises:
Traversal Unit, it is arranged to the global restriction calculating each node by traveling through described rule set network, and wherein the global restriction of each node is obtained by the combination local restriction of its ancestor node and the local restriction of himself;
Example information acquiring unit, it is arranged to the global restriction according to described terminal node, obtain and be used for the example information of generating test use case, wherein said example information comprises the span needing to be included in example set in test case and each instance properties; And
Test cases technology unit, it is arranged to according to described example information, generating test use case.
2. device according to claim 1, wherein, the global restriction of each node is obtained by the global restriction of its father node of combination and the local restriction of himself.
3. device according to claim 1, wherein, described Traversal Unit is arranged to from described root node, adopts the mode of the degree of depth or breadth First to travel through described rule set network, and for each node in described rule set network, after its all father node is accessed, himself could be accessed.
4. device according to claim 1, it is about intrafascicular one or more that wherein said global restriction comprises with Types Below:
First constraint, to the constraint of example self;
Second constraint, the constraint between the described first about intrafascicular example;
3rd constraint, does not allow the constraint of the example existed;
4th constraint, the constraint between the described first about intrafascicular example and described 3rd about intrafascicular example;
5th constraint, the constraint of the example that must exist;
6th constraint, the constraint between the described first about intrafascicular example and described 5th about intrafascicular example;
7th constraint, in order to perform the constraint of the example of accumulative operation; And
8th constraint, the constraint between the described first about intrafascicular example and described 7th about intrafascicular example.
5. device according to claim 1, wherein, the span of described instance properties comprises: the explicit span of described instance properties and implicit span.
6. device according to claim 1, wherein, described example information acquiring unit is arranged to further and merges two examples according to preset rules.
7. device according to claim 6, wherein, described preset rules is one of following rule:
First rule, described two examples have identical mark;
Second Rule, described two examples have identical mark, or, described two examples there is different marks and there is identical type, described two examples are not present in the global restriction of same terminal node and two the intersection of sets collection be made up of the Property Name in the attribute constraint of described two examples are respectively empty;
Three sigma rule, described two examples have identical mark, or described two examples have different marks and have identical type and described two examples are not present in the global restriction of same terminal node; And
4th rule, described two examples have identical mark, or described two examples have different marks and have identical type and two intersection of sets collection be made up of the Property Name in the attribute constraint of described two examples are respectively sky.
8. device according to claim 1, wherein, described Test cases technology unit is arranged to and carrys out generating test use case by combined test method.
9. device according to claim 8, wherein, described Test cases technology unit is also arranged to the global restriction according to described terminal node, generates one or more test case that can activate the strictly all rules relevant to described rule set network.
10. one kind utilizes the method for rule set network generating test use case, wherein said rule set network comprises root node, one or more intermediate node and one or more terminal node, and each Node configuration has respective local restriction, described method comprises following process:
Calculate the global restriction of each node by traveling through described rule set network, wherein the global restriction of each node is obtained by the combination local restriction of its ancestor node and the local restriction of himself;
According to the global restriction of described terminal node, obtain and be used for the example information of generating test use case, wherein said example information comprises the span needing to be included in example set in test case and each instance properties; And
According to described example information, generating test use case.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410151595.0A CN105095060A (en) | 2014-04-15 | 2014-04-15 | Device and method for generating test case by using rule set network |
| JP2015081749A JP2015204116A (en) | 2014-04-15 | 2015-04-13 | Device and method for generating test case by using rule group network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410151595.0A CN105095060A (en) | 2014-04-15 | 2014-04-15 | Device and method for generating test case by using rule set network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105095060A true CN105095060A (en) | 2015-11-25 |
Family
ID=54575556
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410151595.0A Pending CN105095060A (en) | 2014-04-15 | 2014-04-15 | Device and method for generating test case by using rule set network |
Country Status (2)
| Country | Link |
|---|---|
| JP (1) | JP2015204116A (en) |
| CN (1) | CN105095060A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106874172A (en) * | 2015-12-10 | 2017-06-20 | 富士通株式会社 | Test cases technology device and method |
| CN108388504A (en) * | 2017-02-03 | 2018-08-10 | 北京嘀嘀无限科技发展有限公司 | A kind of test method and device |
| CN108701074A (en) * | 2016-02-24 | 2018-10-23 | 三菱电机株式会社 | Test cases technology device and test case generator |
| CN110598413A (en) * | 2019-06-26 | 2019-12-20 | 上海云盾信息技术有限公司 | Method, system and equipment for maintaining rules of anti-attack platform |
| CN111290948A (en) * | 2020-01-19 | 2020-06-16 | 腾讯科技（深圳）有限公司 | Test data acquisition method and device, computer equipment and readable storage medium |
| CN113282350A (en) * | 2021-05-26 | 2021-08-20 | 重庆零壹空间科技集团有限公司 | Telemetering data interpretation method and device, computer equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101788907A (en) * | 2010-01-04 | 2010-07-28 | 北京航空航天大学 | Automatic generation method for combination service simplified test case and device therefor |
| CN102043716A (en) * | 2010-12-24 | 2011-05-04 | 南京联创科技集团股份有限公司 | Automatic software testing method based on business driving |
| CN102799532A (en) * | 2012-07-20 | 2012-11-28 | 上海斐讯数据通信技术有限公司 | Method and system for designing test case |
| CN103412819A (en) * | 2013-08-28 | 2013-11-27 | 北京信息科技大学 | Document converter testing method and device based on association degree analysis |
-
2014
- 2014-04-15 CN CN201410151595.0A patent/CN105095060A/en active Pending
-
2015
- 2015-04-13 JP JP2015081749A patent/JP2015204116A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101788907A (en) * | 2010-01-04 | 2010-07-28 | 北京航空航天大学 | Automatic generation method for combination service simplified test case and device therefor |
| CN102043716A (en) * | 2010-12-24 | 2011-05-04 | 南京联创科技集团股份有限公司 | Automatic software testing method based on business driving |
| CN102799532A (en) * | 2012-07-20 | 2012-11-28 | 上海斐讯数据通信技术有限公司 | Method and system for designing test case |
| CN103412819A (en) * | 2013-08-28 | 2013-11-27 | 北京信息科技大学 | Document converter testing method and device based on association degree analysis |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106874172A (en) * | 2015-12-10 | 2017-06-20 | 富士通株式会社 | Test cases technology device and method |
| CN108701074A (en) * | 2016-02-24 | 2018-10-23 | 三菱电机株式会社 | Test cases technology device and test case generator |
| CN108388504A (en) * | 2017-02-03 | 2018-08-10 | 北京嘀嘀无限科技发展有限公司 | A kind of test method and device |
| CN110598413A (en) * | 2019-06-26 | 2019-12-20 | 上海云盾信息技术有限公司 | Method, system and equipment for maintaining rules of anti-attack platform |
| CN110598413B (en) * | 2019-06-26 | 2021-06-15 | 上海云盾信息技术有限公司 | Method, system and equipment for maintaining rules of anti-attack platform |
| CN111290948A (en) * | 2020-01-19 | 2020-06-16 | 腾讯科技（深圳）有限公司 | Test data acquisition method and device, computer equipment and readable storage medium |
| CN111290948B (en) * | 2020-01-19 | 2022-02-22 | 腾讯科技（深圳）有限公司 | Test data acquisition method and device, computer equipment and readable storage medium |
| CN113282350A (en) * | 2021-05-26 | 2021-08-20 | 重庆零壹空间科技集团有限公司 | Telemetering data interpretation method and device, computer equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2015204116A (en) | 2015-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105095060A (en) | Device and method for generating test case by using rule set network | |
| CN109947950B (en) | Method and device for constructing domain knowledge graph based on middle-layer core ontology | |
| Raidl et al. | Metaheuristic hybrids | |
| US11521080B2 (en) | Declarative rule-based decision support system | |
| CN111930956B (en) | Multi-innovation method recommendation and flow driving integrated system adopting knowledge graph | |
| CN105446734A (en) | Software development history-based developer network relation construction method | |
| CN111191821A (en) | Equipment resource allocation optimization method based on knowledge graph drive | |
| CN105138588A (en) | Database overlap mode abstract generating method based on multi-label propagation | |
| CN110297765A (en) | Software reliability earlier evaluations method | |
| Ross et al. | A case-based reasoning system for conflict resolution: design and implementation | |
| CN103294791A (en) | Extensible markup language pattern matching method | |
| CN105718591B (en) | A kind of rule-based and constraint satisfaction qualitative reasoning of spatial relations method | |
| Aronis et al. | Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation. | |
| Bohács et al. | Development of an ontology-driven, component based framework for the implementation of adaptiveness in a Jellyfish-type simulation model | |
| CN107609938A (en) | A kind of service recommendation method based on the qualitative and quantitative preference of user | |
| CN104636422B (en) | The method and system for the pattern concentrated for mining data | |
| Jin et al. | Automated requirements elicitation: Combining a model-driven approach with concept reuse | |
| Aslam et al. | Cloud migration framework clustering method for social decision support in modernizing the legacy system | |
| CN108776697B (en) | Multi-source data set cleaning method based on predicates | |
| Schwarz et al. | Towards an integrated sustainability evaluation of energy scenarios with automated information exchange | |
| Frimpong | Ontology matching algorithms for data model alignment in big data | |
| Zanjirchi et al. | An extended ISM and MICMAC method under neutrosophic environment | |
| Prignano et al. | Infrastructures connecting people: A mechanistic model for terrestrial transportation networks | |
| Sidorov et al. | A review of approaches to modeling applied vehicle routing problems | |
| CN108363563A (en) | Uml model consistency detecting method based on data collection of illustrative plates, Information Atlas and knowledge mapping framework |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20151125 |
|
| WD01 | Invention patent application deemed withdrawn after publication |