CN108536606B - EFSM test method based on composite dependency coverage criterion - Google Patents

EFSM test method based on composite dependency coverage criterion Download PDF

Info

Publication number
CN108536606B
CN108536606B CN201810363831.3A CN201810363831A CN108536606B CN 108536606 B CN108536606 B CN 108536606B CN 201810363831 A CN201810363831 A CN 201810363831A CN 108536606 B CN108536606 B CN 108536606B
Authority
CN
China
Prior art keywords
migration
dependency
pair
path
composite
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.)
Active
Application number
CN201810363831.3A
Other languages
Chinese (zh)
Other versions
CN108536606A (en
Inventor
李征
史晶晶
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Chemical Technology
Original Assignee
Beijing University of Chemical Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Chemical Technology filed Critical Beijing University of Chemical Technology
Priority to CN201810363831.3A priority Critical patent/CN108536606B/en
Publication of CN108536606A publication Critical patent/CN108536606A/en
Application granted granted Critical
Publication of CN108536606B publication Critical patent/CN108536606B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3668—Software testing
    • G06F11/3672—Test management
    • G06F11/3684—Test management for test design, e.g. generating new test cases

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses an EFSM testing method based on a composite dependency relationship coverage criterion, and belongs to the fields of communication protocols, embedded systems, web application tests and the like. The method provides a coverage criterion based on the composite dependency relationship, and guides the generation of the test path by combining a novel control dependency relationship and a novel data dependency relationship in an EFSM model. The test method related by the method comprises a composite dependency migration pair set generation part, a migration pair conflict relation detection and removal part and a test path generation part. Compared with the existing testing method based on data flow and migration or state coverage criteria, the method solves the problem of generating the testing path of the non-termination model, and simultaneously gives full play to the advantages of control dependence and data dependence, so that the generated EFSM path set can more effectively detect errors, and the testing cost is reduced.

Description

EFSM test method based on composite dependency coverage criterion
Technical Field
The invention relates to an EFSM testing method based on a composite dependency relationship coverage criterion, and belongs to the fields of communication protocols, embedded systems, web application tests and the like.
Background
The Extended Finite State Machine (EFSM) has strong data modeling and behavior modeling capabilities and is widely applied to communication protocols, embedded systems and web application modeling. An extended finite state machine can be represented as a six-tuple M ═ S (S, S)0T, E, G, A), wherein s0E S represents the initial state, T is the set of all migrations, E is the set of event events on migration, G is the set of judgment conditions guard on migration, and a is the set of all operation actions.
The test coverage criteria, which is the core of software testing, defines a set of test case requirements and this set must be covered by a complete set of test cases. The test coverage criteria is to find a minimum set of test cases that can test each part of the software. The test coverage criteria on the EFSM model at present can be mainly classified into three categories: a data flow based coverage criterion, a migration or state based coverage criterion, and a random coverage criterion.
Disclosure of Invention
The invention aims to provide an EFSM testing method based on a composite dependency coverage criterion. The method defines a composite dependency relationship coverage criterion combining control dependence and data dependence, provides an EFSM test path generation method based on the criterion, and can solve the problem of non-termination EFSM test path generation.
In order to achieve the purpose, the invention adopts a scheme of an EFSM model testing method based on a composite dependency coverage criterion, and important control dependency and data dependency of an EFSM model are used as the coverage criterion to guide the generation of a testing path. The test method comprises three core parts of generation of a composite dependency migration pair set, detection and removal of a migration pair conflict relation and generation of a test path:
firstly, generating a composite dependency migration pair set: selecting a novel control dependency relationship in an EFSM model according to the termination of the model to generate a composite dependency migration pair set;
secondly, detecting and removing a conflict relationship of migration pair: analyzing variables on two migrations in the composite dependency migration pair set, and removing the migration pairs with conflicting conditions from the composite dependency migration pair set;
thirdly, generating a test path: and generating a test path set meeting the composite dependency coverage criterion by using a depth-first traversal method, and providing four path generation rules for better meeting the composite dependency coverage criterion in the path generation process.
These three sections are described in detail below, respectively.
Firstly, generating a composite dependency migration pair set: selecting a novel control dependency relationship in an EFSM model according to the termination of the model to generate a composite dependency migration pair set;
according to the non-termination and non-certainty of the EFSM model, control dependence is divided into non-termination sensitive control dependence (NTSCD) and non-termination insensitive control dependence (NTICD), wherein the NTICD is suitable for terminating the EFSM model, the NTSCD is suitable for the non-termination model, and a proper control dependence relation needs to be selected according to specific situations.
The method comprises the following steps that an intersection exists between a dependence migration pair generated according to the relation between a control dependence and a data dependence, and the dependence migration pair is not mutually contained, so that the definition of a composite dependence covering criterion is provided:
first, define Pair _ TS as the place of sequence TSThere are migration pairs: given a non-null sequence TS ═ t1,...,tn> (wherein, t)iIs migration in EFSM M, n represents the number of migration sequence numbers, and i represents the ith migration sequence number; if Pair _ TS { (t)i,tj) I is less than or equal to 1, j is less than or equal to n, then Pair _ TS is called as all migration pairs of the sequence TS, and j represents the jth migration serial number; next, a composite dependency coverage criterion is defined: assume that the migration set of EFSM M is T ═ TiI is more than or equal to 1 and less than or equal to n, and the control dependence pair set is
Figure BDA0001636681060000021
Representing a control dependency; the data dependency pair set is
Figure BDA0001636681060000022
Set a ═ TSiI e N is the set of all migration sequences in M,
Figure BDA0001636681060000023
representing data dependencies; if there is a collection
Figure BDA0001636681060000024
So that
Figure BDA0001636681060000025
Then call AMCovering by a compound dependency relationship of M;
Figure BDA0001636681060000026
representing an empty set; n represents the sequence number of the migration sequence, and l represents the sequence number of the ith migration sequence; .
And (3) according to the definition, a method for generating a composite dependency migration pair set is provided: firstly, selecting a corresponding control dependency relationship according to the termination of the model to calculate a control dependency pair and a data dependency pair, and finally generating a composite dependency migration pair set.
Secondly, detecting and removing a conflict relationship of migration pair: analyzing variables on two migrations in the composite dependency migration pair set, and removing the migration pairs with conflicting conditions from the composite dependency migration pair set;
because the condition conflict pair is judged when the path is generated, if the conflict migration pair exists in the composite dependency pair set, the corresponding path cannot cover the conflict migration pair. Therefore, the method carries out conflict judgment on each dependency pair in the composite dependency migration pair set, if a conflict exists between a certain pair of dependency pairs, the pair of dependency pairs is removed from the dependency pair set, and finally the remaining non-conflict dependency pairs form the composite non-conflict dependency pair set.
Thirdly, generating a test path: and generating a test path set meeting the composite dependency coverage criterion by using a depth-first traversal method, and providing four path generation rules for better meeting the composite dependency coverage criterion in the path generation process.
The path generation adopts a depth-first traversal algorithm, the coverage criterion meeting the compound dependency relationship is used as a path generation stopping criterion in the algorithm, and four path generation rules are provided for better meeting the compound dependency coverage criterion.
Rule 1: if there is a condition conflict in the path, then the path is not added to the set of paths.
Rule 2: when selecting the subsequent migration, selecting the subsequent migration with the least occurrence times in the path to join the path.
Rule 3: for the non-termination model, assigning a certain termination probability to each node in the control trap makes it possible to terminate at any node in the control trap.
Rule 4: for a control dependent pair, the generated test path only needs to cover the pair; for a data-dependent pair, a variable analysis needs to be performed on the migration between two migrations with data dependence in the path to decide whether the data-dependent pair can be overwritten.
Compared with the prior art, the invention has the following beneficial effects.
Combining data dependencies and control dependencies may avoid testing incompleteness on false detections of data flows and false detections of control flows.
The control dependence reflects the most important structural information in the EFSM model, and compared with other coverage criteria, the redundant test cases can be greatly reduced, so that the effects of finding more errors and reducing the test cost are achieved.
Drawings
FIG. 1 is a flow chart of an embodiment of the method of the present invention.
Detailed Description
The invention adopts a scheme of an EFSM model testing method based on a composite dependency coverage criterion, and important control dependency and data dependency of an EFSM model are used as the coverage criterion to guide the generation of a testing path. The test method comprises three core parts of generation of a composite dependency migration pair set, detection and removal of a migration pair conflict relation and generation of a test path:
firstly, generating a composite dependency migration pair set: selecting a novel control dependency relationship in an EFSM model according to the termination of the model to generate a composite dependency migration pair set;
secondly, detecting and removing a conflict relationship of migration pair: analyzing variables on two migrations in the composite dependency migration pair set, and removing the migration pairs with conflicting conditions from the composite dependency migration pair set;
thirdly, generating a test path: and generating a test path set meeting the coverage criterion of the compound dependency relationship by using a depth-first traversal method.
Specifically, as shown in the implementation flowchart of fig. 1, three dashed boxes represent, from top to bottom, generation of a set of complex dependent migration pairs, detection and removal of conflict relationship between migration pairs, and generation of a test path.
Firstly, generating a composite dependency migration pair set: before generating the composite dependency migration pair set, the relationship between the control dependency and the data dependency is firstly explored, and if the control dependency can completely contain the data dependency or the data dependency can completely contain the control dependency, it is meaningless to combine the control dependency and the data dependency. Therefore, the properties that the control dependence and the data dependence are not included are explored, and the specific definition is as follows: let M denote the set of all EFSM model constructs, if control and data dependentIf and only if they are not mutually exclusive,
Figure BDA0001636681060000047
so that m's PathSetData _ m' does not cover all of the pailsetcontrol _ m ', or PathSetControl _ m' on m 'does not cover all of the pailsetcontdata _ m'; the control dependence and the data dependence are mutually independent through proving.
Then, the definition of the coverage criterion of the compound dependency relationship is proposed:
first define Pair _ TS as all migration pairs of sequence TS: given a non-null sequence TS ═ t1,...,tn> (wherein, t)iIs migration in EFSM M, n represents the number of migration sequence numbers, and i represents the ith migration sequence number; if Pair _ TS { (t)i,tj) I is less than or equal to 1, j is less than or equal to n, then Pair _ TS is called as all migration pairs of the sequence TS, and j represents the jth migration serial number; next, a composite dependency coverage criterion is defined: assume that the migration set of EFSM M is T ═ TiI is more than or equal to 1 and less than or equal to n, and the control dependence pair set is
Figure BDA0001636681060000041
Representing a control dependency; the data dependency pair set is
Figure BDA0001636681060000042
Set a ═ TSiI e N is the set of all migration sequences in M,
Figure BDA0001636681060000043
representing data dependencies; if there is a collection
Figure BDA0001636681060000044
So that
Figure BDA0001636681060000045
Then call AMCovering by a compound dependency relationship of M;
Figure BDA0001636681060000046
representing an empty set; n denotes the number of the sequence of the migrating sequence, l denotes the sequence of the first migrating sequenceNumber;
and generating a composite dependency migration pair set, firstly, selecting a corresponding control dependency relationship according to the termination of the model to calculate a control dependency pair, recording the formed control dependency pair set as PairSetControl _ M, calculating a data dependency pair for the model, and recording the formed data dependency pair set as PairSetData _ M. And removing the same dependent pair in the control dependent pair set and the data dependent pair set to obtain a compound dependent migration pair set. Since the calculated control dependency pairs are binary groups and the calculated data dependency pairs contain definition on migration and use variables as triples, when two sets are merged and elements are taken from the data dependency pair set, the variable elements in each dependency pair are removed, so that the forms of the data dependency pairs and the control dependency pairs are consistent. The original data dependency pair set still retains the variable information for use in path generation coverage.
Secondly, detecting and removing a conflict relationship of migration pair: analyzing variables on two migrations in the composite dependency migration pair set, and removing the migration pairs with conflicting conditions from the composite dependency migration pair set;
because the condition conflict pair is judged when the path is generated, if the conflict migration pair exists in the composite dependency pair set, the corresponding path cannot cover the conflict migration pair. Therefore, the method carries out conflict judgment on each dependency pair in the composite dependency migration pair set, if a conflict exists between a certain pair of dependency pairs, the pair of dependency pairs is removed from the dependency pair set, and finally the remaining non-conflict dependency pairs form the composite non-conflict dependency pair set.
The conflict mentioned above refers to condition conflict, that is, the condition on one migration conflicts with the condition on a certain migration in the same path. For the
Figure BDA0001636681060000051
For migration tiAnd migration of tjAnd (6) performing conflict judgment. Variable at migration tiCannot be at t after the above definitionjStrip ofIs triggered on the element, causing the infeasibility of the entire path containing the dependency pair. These conditionally conflicting migration pairs are removed and the remaining non-conflicting dependent pairs comprise a composite set of non-conflicting dependent pairs.
Thirdly, generating a test path: and generating a test path set meeting the composite dependency coverage criterion by using a depth-first traversal method, and providing four path generation rules for better meeting the composite dependency coverage criterion in the path generation process.
Four rules are detailed below:
rule 1: if there is a condition conflict in the path, then the path is not added to the set of paths.
Obviously, if a conditional conflict migration pair exists in a path, a variable value cannot be found, so that the path simultaneously satisfies the migration in the conditional conflict migration pair, that is, test data cannot be generated for the path, and therefore, when the path is selected, the test path with the conditional conflict pair is firstly filtered, and the path is preliminarily screened.
Rule 2: when selecting the subsequent migration, selecting the subsequent migration with the least occurrence times in the path to join the path.
A count variable is first added to each migration to mark the number of times each migration occurs in the path. When the counting variables of the subsequent migration are the same, randomly selecting one migration; when the count variable of the subsequent migration is different, the migration with the smallest count variable is selected.
Rule 3: for the non-termination model, assigning a certain termination probability to each node in the control trap makes it possible to terminate at any node in the control trap.
The non-termination models all contain control traps and no termination nodes exist, so each node in the control traps can stop the generation of paths. But there needs to be certain rules at which node to stop. Here, a certain termination probability is set for each node in the control trap, and one way of setting the termination probability may be a specific constant, or may be specifically set according to specific situations, for example, the number of nodes existing in the control trap k is denoted as Nk, and the termination probability of each node in the control trap is 1/Nk.
Rule 4: for a control dependent pair, the generated test path only needs to cover the pair; for a data-dependent pair, a variable analysis needs to be performed on the migration between two migrations with data dependence in the path to decide whether the data-dependent pair can be overwritten.
For control dependent pair discovery, assume Path (A, B) represents all paths from A to B. If it is
Figure BDA0001636681060000061
Then pair
Figure BDA0001636681060000062
Ti has a control dependency on Tj, i.e., the control dependency between two migrations is independent of the path selection between the two migrations. Any path between two migrations with control dependencies can preserve the control dependencies. The control dependencies include NTSCD, NTICD, and UNTICD. The overlay control dependency pair can overlay the corresponding control dependency.
For data dependency pair discovery, a change in data dependency relationship between two migrations with data dependency may be caused by a difference in path. Therefore, in the algorithm for path generation, in addition to the marking of whether the dependent pair in the dependent pair set is covered, the marking of whether the dependent pair is a data dependent pair is performed. For the data dependency pair, it needs to be determined whether a path between two migrations having data dependency in the path is a clearly defined path. At this time, an original data dependency pair set is used, the set reserves variable information on two migrations with data dependency, and if the variable is not redefined on the migration between the two migrations with data dependency in the path, the variable is recorded as covering the data dependency pair; otherwise, it is uncovered.

Claims (1)

1. An EFSM model testing method based on a composite dependency relationship coverage criterion is characterized in that: the dependency relationship on the EFSM model is divided into a control dependency relationship and a data dependency relationship; the test method comprises three core parts of generation of a composite dependency migration pair set, detection and removal of a migration pair conflict relation and generation of a test path:
firstly, generating a composite dependency migration pair set: selecting a novel control dependency relationship in an EFSM model according to the termination of the model to generate a composite dependency migration pair set;
secondly, detecting and removing a conflict relationship of migration pair: analyzing variables on two migrations in the composite dependency migration pair set, and removing the migration pairs with conflicting conditions from the composite dependency migration pair set;
thirdly, generating a test path: generating a test path set meeting a composite dependency relationship coverage criterion by using a depth-first traversal method, and providing four path generation rules in the path generation process;
selecting a novel control dependency relationship in an EFSM model according to the model termination, and generating a composite dependency migration pair set, specifically:
dividing the control dependence into non-termination sensitive control dependence and non-termination insensitive control dependence according to the non-termination and non-certainty of the EFSM model, wherein the non-termination sensitive control dependence is suitable for terminating the EFSM model, the non-termination insensitive control dependence is suitable for the non-termination model, and a proper control dependence relation needs to be selected according to specific conditions;
the method comprises the following steps that an intersection exists between a dependence migration pair generated according to the relation between a control dependence and a data dependence, and the dependence migration pair is not mutually contained, so that the definition of a composite dependence covering criterion is provided:
first define Pair _ TS as all migration pairs of sequence TS: given a non-null sequence TS ═ t1,...,tn> (wherein, t)iIs migration in EFSM M, n represents the number of migration sequence numbers, and i represents the ith migration sequence number; if Pair _ TS { (t)i,tj) I is less than or equal to 1, j is less than or equal to n, then Pair _ TS is called as all migration pairs of the sequence TS, and j represents the jth migration serial number; next, a composite dependency coverage criterion is defined: assume that the migration set of EFSM M is T ═ TiI is more than or equal to 1 and less than or equal to n, and the control is based onSet of dependent pairs as
Figure FDA0002784132030000011
Figure FDA0002784132030000012
Representing a control dependency; the data dependency pair set is
Figure FDA0002784132030000013
Set a ═ TSiI e N is the set of all migration sequences in M,
Figure FDA0002784132030000014
representing data dependencies; if there is a collection
Figure FDA0002784132030000015
AM＝{TSlL is equal to N }, so that l is equal to N }, and the method can be used for solving the problem of low cost of the existing method
Figure FDA0002784132030000016
Then call AMCovering by a compound dependency relationship of M;
Figure FDA0002784132030000017
representing an empty set; n represents the sequence number of the migration sequence, and l represents the sequence number of the ith migration sequence;
and (3) according to the definition, a method for generating a composite dependency migration pair set is provided: firstly, selecting a corresponding control dependency relationship according to the termination of the model to calculate a control dependency pair and a data dependency pair, and finally generating a composite dependency migration pair set;
analyzing variables on two migrations in the composite dependency migration pair set, and removing the migration pairs with condition conflict from the composite dependency migration pair set, specifically:
because the condition conflict pair is judged when the path is generated, if the conflict migration pair exists in the composite dependency pair set, the corresponding path cannot cover the conflict migration pair; therefore, conflict judgment is carried out on each dependency pair in the composite dependency migration pair set, if a conflict exists between a certain pair of dependency pairs, the dependency pairs are removed from the dependency pair set, and finally the rest non-conflict dependency pairs form a composite non-conflict dependency pair set;
in the test path generation part, a depth-first traversal method is used for generating a test path set meeting a composite dependency relationship coverage criterion, and in the path generation process, four path generation rules are provided, specifically:
the path generation adopts an algorithm of depth-first traversal, in the algorithm, a coverage criterion meeting the composite dependency relationship is taken as a stopping criterion of the path generation, and four path generation rules are provided;
rule 1: if the condition conflict exists in the path, the path is not added into the path set;
rule 2: when selecting the subsequent migration, selecting the subsequent migration with the least occurrence frequency in the path to be added into the path;
rule 3: for the non-termination model, each node in the control trap is given a certain termination probability so that the node can be terminated at any node in the control trap;
rule 4: for the control dependency pair, the generated test path only needs to cover the control dependency pair; for a data-dependent pair, a variable analysis needs to be performed on the migration between two migrations with data dependence in the path to decide whether the data-dependent pair can be overwritten.
CN201810363831.3A 2018-04-22 2018-04-22 EFSM test method based on composite dependency coverage criterion Active CN108536606B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810363831.3A CN108536606B (en) 2018-04-22 2018-04-22 EFSM test method based on composite dependency coverage criterion

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810363831.3A CN108536606B (en) 2018-04-22 2018-04-22 EFSM test method based on composite dependency coverage criterion

Publications (2)

Publication Number Publication Date
CN108536606A CN108536606A (en) 2018-09-14
CN108536606B true CN108536606B (en) 2021-01-19

Family

ID=63479030

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810363831.3A Active CN108536606B (en) 2018-04-22 2018-04-22 EFSM test method based on composite dependency coverage criterion

Country Status (1)

Country Link
CN (1) CN108536606B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111274142B (en) * 2020-01-20 2023-04-21 中国人民解放军国防科技大学 Software communication system architecture conformance test modeling method based on extended finite state machine

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101901188A (en) * 2010-07-23 2010-12-01 哈尔滨工程大学 Reachable path-based software testing method
CN102323906A (en) * 2011-09-08 2012-01-18 哈尔滨工程大学 MC/DC test data automatic generation method based on genetic algorithm
CN102368226A (en) * 2011-10-10 2012-03-07 南京大学 Method for automatically generating test cases based on analysis on feasible paths of EFSM (extended finite state machine)
CN102404167A (en) * 2011-11-03 2012-04-04 清华大学 Protocol test generating method of parallel expansion finite-state machine based on variable dependence
CN103559122A (en) * 2013-10-14 2014-02-05 西安交通大学 Test case reduction method based on program behavior slices
CN104077228A (en) * 2014-07-08 2014-10-01 浙江理工大学 EFSM performable test sequence generating method based on predicate dependency graph
WO2016036813A4 (en) * 2014-09-02 2016-08-11 Ab Initio Technology Llc Controlling data processing tasks
CN106502892A (en) * 2016-10-20 2017-03-15 杭州电子科技大学 A kind of test case prioritization method based on uml model
CN106708739A (en) * 2016-12-30 2017-05-24 桂林电子科技大学 Extended finite state machine (EFSM) model-based Web service case generation method and system

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3966518B2 (en) * 2004-03-12 2007-08-29 インターナショナル・ビジネス・マシーンズ・コーポレーション Program analysis apparatus, analysis method thereof, and program
JP2009129179A (en) * 2007-11-22 2009-06-11 Toshiba Corp Program parallelization support device and program parallelization support method

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101901188A (en) * 2010-07-23 2010-12-01 哈尔滨工程大学 Reachable path-based software testing method
CN102323906A (en) * 2011-09-08 2012-01-18 哈尔滨工程大学 MC/DC test data automatic generation method based on genetic algorithm
CN102368226A (en) * 2011-10-10 2012-03-07 南京大学 Method for automatically generating test cases based on analysis on feasible paths of EFSM (extended finite state machine)
CN102404167A (en) * 2011-11-03 2012-04-04 清华大学 Protocol test generating method of parallel expansion finite-state machine based on variable dependence
CN103559122A (en) * 2013-10-14 2014-02-05 西安交通大学 Test case reduction method based on program behavior slices
CN104077228A (en) * 2014-07-08 2014-10-01 浙江理工大学 EFSM performable test sequence generating method based on predicate dependency graph
WO2016036813A4 (en) * 2014-09-02 2016-08-11 Ab Initio Technology Llc Controlling data processing tasks
CN106502892A (en) * 2016-10-20 2017-03-15 杭州电子科技大学 A kind of test case prioritization method based on uml model
CN106708739A (en) * 2016-12-30 2017-05-24 桂林电子科技大学 Extended finite state machine (EFSM) model-based Web service case generation method and system

Also Published As

Publication number Publication date
CN108536606A (en) 2018-09-14

Similar Documents

Publication Publication Date Title
CN110245496B (en) Source code vulnerability detection method and detector and training method and system thereof
Nazif et al. Low level image segmentation: an expert system
US7627543B2 (en) Automated anomaly detection
CN110210227A (en) Risk checking method, device, equipment and storage medium
Higo et al. Refactoring support based on code clone analysis
CN109991951B (en) Multi-source fault detection and diagnosis method and device
US20100050155A1 (en) Method, computer program product, and hardware product for providing program individuality analysis for source code programs
KR20060045568A (en) Method and system for probe optimization while instrumenting a program
CN101794224B (en) Software run-time property monitoring method based on property specification mode
CN108491228A (en) A kind of binary vulnerability Code Clones detection method and system
CN111679657A (en) Attack detection method and system based on industrial control equipment signals
CN108875317A (en) Software clone detection method and device, detection device and storage medium
CN108536606B (en) EFSM test method based on composite dependency coverage criterion
KR102114547B1 (en) Testing method and apparatus of target function incluede in target program
Balbo et al. First passage time computation in tagged GSPNs with queue places
CN116627804A (en) Test method, system, electronic equipment and storage medium based on artificial intelligence
CN102982282A (en) Program bug detection system and method
CN109002716A (en) A kind of malicious code intrusion detection of mobile application and prevention method
CN113704519B (en) Data set determining method and device, computer equipment and storage medium
CN109597744A (en) Data unusual fluctuation analysis method and device
CN114153881A (en) High-recall cause and effect discovery method, device and equipment based on time sequence operation and maintenance big data
KR102217092B1 (en) Method and apparatus for providing quality information of application
CN112988327A (en) Container safety management method and system based on cloud edge cooperation
Chilenski et al. Observability properties of colored graphs
CN103914381A (en) Method for generating function summary information related to temporal security attribute defect modes

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant