CN103019934B - Test case generation method based on data code separation technology - Google Patents
Test case generation method based on data code separation technology Download PDFInfo
- Publication number
- CN103019934B CN103019934B CN201210496043.4A CN201210496043A CN103019934B CN 103019934 B CN103019934 B CN 103019934B CN 201210496043 A CN201210496043 A CN 201210496043A CN 103019934 B CN103019934 B CN 103019934B
- Authority
- CN
- China
- Prior art keywords
- path
- linear
- predicate
- matrix
- test
- 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
Links
- 238000012360 testing method Methods 0.000 title claims abstract description 54
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000005516 engineering process Methods 0.000 title claims abstract description 12
- 238000000926 separation method Methods 0.000 title claims abstract description 8
- 239000011159 matrix material Substances 0.000 claims abstract description 41
- 238000012886 linear function Methods 0.000 claims description 23
- 230000008569 process Effects 0.000 claims description 9
- 239000000203 mixture Substances 0.000 claims description 4
- 230000007704 transition Effects 0.000 claims description 4
- 238000004458 analytical method Methods 0.000 abstract description 5
- 238000013461 design Methods 0.000 abstract description 4
- 230000005284 excitation Effects 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000013522 software testing Methods 0.000 description 1
Landscapes
- Debugging And Monitoring (AREA)
Abstract
The invention provides a test case generation method based on the data code separation technology. The test case generation method comprises the following steps: S1, pre-processing program source codes and generating a program control flow graph; S2, generating a path matrix A according to the program control flow graph and setting corresponding priority factors Beta to all predicates in all paths P; S3, reversely ordering the paths according to the priority factors Beta to obtain a matrix A'; S4, as for the matrix A', selecting a path Pi to calculate test data, and finishing path selection when the order of a matrix A'' constituted by the selected path Pi equals to the order of the path matrix A; S5, generating test data according to the types of predicates in the path Pi; and S6, generating a test case according to the test data and the path Pi. The test case generation method realizes intelligent code analysis, reduces working hours for manual design of both test cases and test data, shortens the test script writing time and improves the test efficiency.
Description
Technical field
The present invention relates to software testing technology, particularly a kind of method for generating test case based on data code separation technology.
Background technology
Along with the time restriction of software development cycle, resource restriction and the increasingly complex of software, the white-box testing work of general large-scale application software only by hand can not be completely competent.Especially, in iterative development process, each assembly under each version needs continuous checking.Thereby produce data code piece-rate system and robotization white-box testing technology.Due to script compilation work, a comparatively loaded down with trivial details job, usually the white-box testing script automatic generating calculation based on Controlling model is used at present, the benefit of this kind of design mainly contains following two aspects: 1, based on the minimal path covering algorithm of figure, can under the condition meeting coverage rate requirement, improve testing efficiency, saving resource; 2, based on Controlling model generating test use case, ensure that the timing of logic integrality and function.
But this design is higher for safety requirements, and intelligent analysis is not carried out to source code, have impact on the efficiency of Test cases technology.
Summary of the invention
(1) technical matters solved
The technical matters that the present invention solves is: the problem of code intelligent analysis and automatic generating test case.
(2) technical scheme
The present invention proposes a kind of method for generating test case based on data code separation technology, described method comprises:
S1, pre-service is carried out to program source code, and generator program controlling stream graph;
S2, according to described program control flowchart generation pass matrix A, and corresponding priority factors β is set for each predicate in every paths P;
S3, to be sorted according to described priority factors β backward in described path, obtain matrix A ';
S4, for described matrix A ', path selection P
i, when the path P chosen
ithe matrix A of composition " order when equaling the order of path matrix A, then end is chosen in path;
S5, according to described path P
ithe type of middle predicate, generates test data;
S6, according to described test data and described path P
i, generating test use case.
Preferably, in the A of path matrix described in step S2, often the limit of capable expression one paths process is gathered, and the number of times of every paths through limit is shown in every list.
Preferably, before step S3, described method also comprises generation pass priority factor, and described path priority coefficient is the product of the priority factors that the access times of predicate during path matrix A often goes are corresponding with predicate in described often row.
Preferably, also comprise before step S5: the initial input I of setting program
0and iterations upper limit T, if I
0can through path P
i, then obtain through path P
iprogram input I
f, i.e. I
f=I
0; If I
0can not through path P
i, then jump procedure S5.
Preferably, if described path P in described step S5
ithe type of middle predicate is non-linear, then described method comprises:
S51, calculate linear function L (Ni, the I of described non-linear predicate
k, P
i), wherein I
kfor input variable, P
ifor the path chosen, Ni is P
ion node;
S52, use path P
iin all linear functions and L (Ni, I
k, P
i) structure input variable linear constraint system, described all linear functions are described path P
imiddle predicate type is linear function;
S53, calculate described linear constraint system, obtain inputting I
k+1;
If S54 is I
k+1can through path P
i, then I
f=I
k+1; Otherwise, repeat step S51 ~ S53, until obtain can through path P
iinput, the iterations upper limit of described repetition step is T.
Preferably, linear function L (Ni, the I of described non-linear predicate is calculated described in step S51
k, P
i) method specifically comprise: according to path P
ion predicate node Ni about input variable I
k, obtain General Linear function L (Ni, I
k, P
i), calculate described linear function L (Ni, I
k, P
i), make L (Ni, I
k, P
i)=0, then described linear function L (Ni, I
k, P
i) represent predicate function at I
kthe section at place, then claim L (Ni, I
k, P
i) for the predicate function of Ni is about I
klinear arithmetic represent.
Preferably, if described path P in described step S5
ithe type of middle predicate is linear, then described method comprises:
S52 ', use path P
iin linear function structure input variable linear constraint system;
S53 ', calculate described linear constraint system, obtain inputting I
k+1;
S54 ' is if I
k+1can through path P
i, then I
f=I
k+1; Otherwise, repeat step S52 ' ~ S53 ', until obtain can through path P
iinput, the iterations upper limit of described repetition step is T.
Preferably, after step S6, described method also comprises: map the set of program output state, and the transition probability corresponding according to each program output state, program output state is mapped to interval 0 ~ 1.
Preferably, the described test case in step S6 refer to from path start node to stop node the sequence on limit of process.
Preferably, implementation of test cases generative process, when described matrix A " order be greater than the order of path matrix A, and P (p|A) for A condition time, check the probability of excitation p
wherein, A is input state, and namely path matrix A is as input state, and p is excitation.
(3) beneficial effect
The present invention carries out code intellectual analysis when generating test data, by automatically extracting the test data in path in predicate conditions, form predicate linear constraint system, achieve code intelligent analysis, simplify the man-hour of Personnel design test case and test data, simplify test script and write the time, improve testing efficiency.
Accompanying drawing explanation
Fig. 1 is the method flow diagram that the present invention proposes;
Fig. 2 is Program controlling stream graph of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described.
The present invention proposes a kind of method for generating test case based on data code separation technology, participate in Fig. 1, described method comprises:
S1, pre-service is carried out to program source code, and generator program controlling stream graph;
S2, according to described program control flowchart generation pass matrix A, and corresponding priority factors β is set for each predicate in every paths P;
S3, to be sorted according to described priority factors β backward in described path, obtain matrix A ';
S4, for described matrix A ', path selection P
i, when the path P chosen
ithe matrix A of composition " order when equaling the order of path matrix A, then end is chosen in path;
S5, according to described path P
ithe type of middle predicate, generates test data;
S6, according to described test data and described path P
i, generating test use case.
A kind of method for generating test case based on data code separation technology that the present invention proposes is specially following content:
Carry out pre-service to program source code, described pre-service comprises deletes annotation, null, extracts statement and control flow check information, and the definition of variable and service condition in program.
In structured testing, for given coverage criterion C, generate one group of path P, make this group path P can reach coverage requirement described by C.The desired base path obtained herein, refers to and can close the minimum P set of E by set of covering edges.
In graph theory, cyclomatic complexity is defined as V (G)=E-N+p, and wherein E represents that limit is gathered, and the quantity of node in N representation program controlling stream graph (Program flow graph, PFG), p represents number connected component.If do not consider the directivity of PFG, then V (G)=E-N+1.But PFG is not strongly connected, solution is increase by limit from the inlet to the outlet, and the cyclomatic complexity of such PFG is exactly V(G)=E-N+2.
If E is in PFG, { e1, e2...en}, then can be converted into matrix A by PFG, and wherein often the limit of capable expression one paths process is gathered, and the number of times of every paths through limit is shown in every list.Because arbitrary rank of matrix is unique and be less than or equal to columns.Namely no matter have how many possible paths, rank of matrix can not exceed the limit number in program control flowchart.Theoretical based on McCabe, namely rank of matrix is the cyclomatic complexity of programming flowchart.
For program control flowchart as shown in Figure 2, the set that can obtain path P according to Fig. 2 is:
p1=<S,1,2,3,4,E>
p2=<S,1,3,4,E>
p3=<S,1,2,3,4,5,4,E>
p4=<S,1,3,4,5,4,E>
p5=<S,1,2,3,4,5,4,5,4,E>
p6=<S,1,3,4,5,4,5,4,E>
PFG is converted into path matrix A by the set according to path P,
Conditional expression path had in the judgement statement of clear and definite value requirement is called branch's predicate.On Macabe cyclomatic complexity test basis, priority factors β is increased, in order to choose high priority coordinates measurement test case to each predicate.
Use path matrix A, often in row, the access times of predicate calculate product with the priority factors β of corresponding predicate, obtain the priority factor of this row respective path, and by path according to the sequence of priority factors backward, acquisition matrix A '.
For path matrix A, because arbitrary rank of matrix is unique and be less than or equal to columns.Namely no matter have how many possible paths, rank of matrix can not exceed the limit number in program control flowchart.Theoretical based on McCabe, the order of path matrix is exactly the cyclomatic complexity λ of programming flowchart.
For matrix A ', according to top-down principle, path selection P
iin order to calculate test data, and make P
iwhen the order of composition matrix A ", when matrix A " equals λ, end is chosen in path.
If because path P
iin the function of predicate be linear, then its linear arithmetic represents to be exactly predicate function itself.
According to the path P obtained after screening
i, the initial input I of setting program
0and iterations upper limit T, if I
0can through path P
i, then obtain through path P
iprogram input I
f, i.e. I
f=I
0; If I
0can not through path P
i, then P is analyzed
iupper predicate type, and generate test data according to predicate type, step is as follows:
Work as path P
ithe function of upper predicate is nonlinear function, then:
1, the linear arithmetic calculating this predicate function represents L (Ni, I
k, P
i).
2, according to path P
ion predicate node n about given input I
kinput variable, write out General Linear function L (Ni, an I
k, P
i), then calculate this function, make L (Ni, I
k, P
i)=0, described linear function L (Ni, I
k, P
i) represent predicate function F at I
kthe section at place, then claim L (Ni, I
k, P
i) for the predicate function F of node Ni is about I
klinear arithmetic represent.
3, P is used
iin all linear predicates functions and L (Ni, I
k, P
i) structure input variable linear constraint system, described all linear predicates functions are path P
imiddle predicate type is linear function.
4, solve linear constraint system, obtain new input I
k+1.
If 5 I
k+1can through path P
i, then I
f=I
k+1; Otherwise, repeat step 1 ~ 4, until obtain can through path P
iinput, the iterations upper limit of described repetition step is T.
When predicate function in path P is linear function, then: S52 ', use path P
iin linear function structure input variable linear constraint system;
S53 ', calculate described linear constraint system, obtain inputting I
k+1;
S54 ' is if I
k+1can through path P
i, then I
f=I
k+1; Otherwise, repeat step S52 ' ~ S53 ', until obtain can through path P
iinput, the iterations upper limit of described repetition step is T.
For program:
0:read(a,b,c)
1:m=a+b
P1:if(2*a+b≥6)then
2:n=m
3:else n=b end if
P2:if(n-c)≥4 then
4:n=a*b*c
5:m++
P3:else if(a
2+c
2>100)then
6:m=a*c+1 end if
P4:if(n≥0)then
7:write(m)
P5:else if(b-Sin(c))>0 then
8:write(n) end if
When choosing path P={ 0,1, P1,2, P2,4,5, P4,7}, I
0=(1,2,3).
Because of I
0can not make through path P, therefore continue execution algorithm step below.The function of structure predicate is about input variable I
0linear constraint system:
2*a+b-6≥0，
a+b-c-4≥0，
a*b*c≥0。
Solve linear constraint system:
One group of solution a=2, b=2, c=0 can be tried to achieve.Then new input I
1=(2,2,0).Because of I
1can through path P, therefore algorithm terminates.
Path selection P={0,1, P1,3, P2,4,5, P4, P5,8}, I
0=(1,2,3).
Because of I
0through path P, therefore execution algorithm step below can not be continued.Because in P, predicate function P5 is nonlinear, therefore the linear arithmetic of P5F=b-sin (c) is asked to represent:
Its linear arithmetic can be made to be expressed as L (B P5, I
k, P) and=kb+lc+p, utilize inequality approximate derivative, can k=1 be obtained, l=0.89792, p=-2.83488,
So predicate function F=b-sin (c) is about I
0linear arithmetic be expressed as L (B P5, I
0, P) and=b+0.89792c-2.83488.
Structure linear constraint system:
2*a+b-6≥0，
a+b-c-4≥0，
a*b*c≥0，
b+0.89792*c-2.83488>0。
Solve linear constraint system:
Obtain I
1=(2,2,1) can be passed through path P, and algorithm terminates.
The next adjacent states of program input state and the set of program output state are mapped.The transition probability corresponding according to each program output state, is mapped to interval (because transition probability and be 1, then interval is selected in 0 ~ 1) by output state.
The function F (A, p) of definition input state A and excitation p, p ∈ P, P (A) are excitation set when current input state is A.Output state collection E (A) can be obtained by function F (A, p).
According to generation test data I
iwith P
istructure test case, after obtaining test case, arrives final state.Until final state stops.
Test case be from from path start node to stop node the sequence on limit (or excitation) of process.Constantly from the initial node state of Software Usage Model, the generative process of implementation of test cases, until the order of the test path array chosen exceedes cyclomatic complexity, and P (p|A) for A condition time, check the probability of excitation p
Above embodiment is only for illustration of the present invention; and be not limitation of the present invention; the those of ordinary skill of relevant technical field; without departing from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all equivalent technical schemes also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (8)
1. based on a method for generating test case for data code separation technology, it is characterized in that, described method comprises:
S1, pre-service is carried out to program source code, and generator program controlling stream graph;
S2, according to described program control flowchart generation pass matrix A, and corresponding priority factors β is set for each predicate in every paths P;
S3, to be sorted according to described priority factors β backward in described path, obtain matrix A ';
S4, for described matrix A ', path selection P
i, when the path P chosen
ithe matrix A of composition " order when equaling the order of path matrix A, then end is chosen in path;
S5, according to described path P
ithe type of middle predicate, generates test data;
S6, according to described test data and described path P
i, generating test use case;
Wherein, in the A of path matrix described in step S2, often the limit of capable expression one paths process is gathered, and the number of times of every paths through limit is shown in every list.
2. method according to claim 1, it is characterized in that, described method also comprises generation pass priority factor upon step s 2 and before step S3, described path priority coefficient be path matrix A often in row predicate access times with described often capable in the product of priority factors corresponding to predicate.
3. method according to claim 1, is characterized in that, after step s4 and also comprised before step S5: the initial input I of setting program
0and iterations upper limit T, if I
0can through path P
i, then obtain through path P
iprogram input I
f, i.e. I
f=I
0; If I
0can not through path P
i, then jump procedure S5.
4. the method according to any one of claim 1 or 3, is characterized in that, if described path P in described step S5
ithe type of middle predicate is non-linear, then described method comprises:
S51, calculate linear function L (Ni, the I of described non-linear predicate
k, P
i), wherein I
kfor input variable, P
ifor the path chosen, Ni is P
ion node;
S52, use path P
iin all linear functions and L (Ni, I
k, P
i) structure input variable linear constraint system, described all linear functions are described path P
imiddle predicate type is linear function;
S53, calculate described linear constraint system, obtain inputting I
k+1;
If S54 is I
k+1can through path P
i, then I
f=I
k+1; Otherwise, repeat step S51 ~ S53, until obtain can through path P
iinput, the iterations upper limit of described repetition step is T.
5. method according to claim 4, is characterized in that, calculates linear function L (Ni, the I of described non-linear predicate described in step S51
k, P
i) method specifically comprise: according to path P
ion predicate node Ni about input variable I
k, obtain General Linear function L (Ni, I
k, P
i), calculate described linear function L (Ni, I
k, P
i), make L (Ni, I
k, P
i)=0, then described linear function L (Ni, I
k, P
i) represent predicate function at I
kthe section at place, then claim L (Ni, I
k, P
i) for the predicate function of Ni is about I
klinear arithmetic represent.
6. the method according to any one of claim 1 or 3, is characterized in that, if described path P in described step S5
ithe type of middle predicate is linear, then described method comprises:
S52 ', use path P
iin linear function structure input variable linear constraint system;
S53 ', calculate described linear constraint system, obtain inputting I
k+1;
S54 ' is if I
k+1can through path P
i, then I
f=I
k+1; Otherwise, repeat step S52 ' ~ S53 ', until obtain can through path P
iinput, the iterations upper limit of described repetition step is T.
7. method according to claim 1, it is characterized in that, after step S6, described method also comprises: map the set of program output state, and the transition probability corresponding according to each program output state, program output state is mapped to interval 0 ~ 1.
8. method according to claim 1, is characterized in that, the described test case in step S6 refer to from path start node to stop node the sequence on limit of process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210496043.4A CN103019934B (en) | 2012-11-28 | 2012-11-28 | Test case generation method based on data code separation technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210496043.4A CN103019934B (en) | 2012-11-28 | 2012-11-28 | Test case generation method based on data code separation technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103019934A CN103019934A (en) | 2013-04-03 |
| CN103019934B true CN103019934B (en) | 2015-05-27 |
Family
ID=47968559
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210496043.4A Active CN103019934B (en) | 2012-11-28 | 2012-11-28 | Test case generation method based on data code separation technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103019934B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104484162B (en) * | 2014-10-31 | 2018-04-03 | 国云科技股份有限公司 | A kind of software test case designs write method |
| CN104731587A (en) * | 2015-03-12 | 2015-06-24 | 用友网络科技股份有限公司 | Unit testing data generating method and unit testing data generating system |
| CN104809067B (en) * | 2015-05-07 | 2017-11-17 | 北京邮电大学 | Towards the method for generating test case and device of equality constraint |
| CN106775913B (en) * | 2016-12-16 | 2019-07-09 | 华东师范大学 | A kind of object code controlling stream graph generation method |
| CN108170602B (en) * | 2017-12-28 | 2021-04-02 | 上海璞恒新能源科技有限公司 | Test case generation method and device, terminal and computer readable medium |
| CN108446220B (en) * | 2018-03-02 | 2022-04-05 | 国网吉林省电力有限公司信息通信公司 | Test case generation method and device |
| CN109359039B (en) * | 2018-09-30 | 2023-01-31 | 福建星瑞格软件有限公司 | Method for improving Sahi automatic testing efficiency |
| CN110716869B (en) * | 2019-09-18 | 2024-05-14 | 平安科技（深圳）有限公司 | Test case generation method and device, electronic equipment and computer readable storage medium |
| CN113127366B (en) * | 2021-04-28 | 2023-08-15 | 芜湖雄狮汽车科技有限公司 | Matrix automatic test method based on model and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1402133A (en) * | 2002-09-13 | 2003-03-12 | 中国人民解放军国防科学技术大学 | Method for automatic generating route-oriented test data |
| CN1555014A (en) * | 2003-12-26 | 2004-12-15 | 中兴通讯股份有限公司 | Human-machine order testing method |
-
2012
- 2012-11-28 CN CN201210496043.4A patent/CN103019934B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1402133A (en) * | 2002-09-13 | 2003-03-12 | 中国人民解放军国防科学技术大学 | Method for automatic generating route-oriented test data |
| CN1555014A (en) * | 2003-12-26 | 2004-12-15 | 中兴通讯股份有限公司 | Human-machine order testing method |
Non-Patent Citations (2)
| Title |
|---|
| Directed Test Suite Augmentation;Zhihong Xu ET AL;《2009 16th Asia-Pacific Software Engineering Conference》;20091203;第406页到第413页 * |
| 基于约束求解的测试用例生成器的研究与设计;赖思佳;《中国优秀硕士学位论文全文数据库•信息科技辑》;20120815(第8期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103019934A (en) | 2013-04-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103019934B (en) | Test case generation method based on data code separation technology | |
| Hoos | Programming by optimization | |
| Prosvirnova et al. | The AltaRica 3.0 project for model-based safety assessment | |
| CN105320806B (en) | Method for summarizing nuclear power process pipeline material by combining PML (polymethylene diamine) with Excel-VBA (Excel-VBA) processing data | |
| CN103198015A (en) | Embedded software reliability test data generating method based on using probability | |
| Kang et al. | A new carbon capture proxy model for optimizing the design and time-varying operation of a coal-natural gas power station | |
| CN103065000A (en) | MDE (model driven engineering)-based method for analyzing and verifying SysML state machine diagram | |
| CN101271397A (en) | Recognition method of nested loop structure | |
| Song et al. | FBDTester 2.0: Automated test sequence generation for FBD programs with internal memory states | |
| CN104360906B (en) | A kind of High Level Synthesis dispatching method based on difference constrained system Yu iteration mould | |
| Yoo et al. | Verification of PLC programs written in FBD with VIS | |
| Keskin | Process integration and automated multi-objective optimization supporting aerodynamic compressor design | |
| Golas | Analysis and correctness of algebraic graph and model transformations | |
| Song et al. | Automated test sequence generation for function block diagram programs | |
| Bogdanov et al. | DAEDALED: A GUI Tool for the optimization of Smart City LED street lighting networks | |
| Karniel et al. | Simulating design processes with self-iteration activities based on DSM planning | |
| CN104657542A (en) | MSVL (Modeling, Simulation and Verification Language)-based Petri network model detection method | |
| Miao et al. | A formal specification-based integration testing approach | |
| Thomas et al. | Customizable continuous building simulation using the design performance toolkit and Kepler scientific workflows | |
| CN104050084A (en) | Modification impact analysis method based on software route analysis result | |
| Kleijn et al. | A process algebra based verification of a production system | |
| Kim et al. | A class testing technique based on data bindings | |
| Pfenninger | Calliope documentation | |
| Itsykson et al. | Source code modification technology based on parameterized code patterns | |
| Yogesh et al. | Test-driven development of automotive software functionality |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100070 Beijing science and Technology Park of Fengtai District Haiying Road No. 6 hospital of Beijing, the headquarters of the International 2 Building No. 3 Patentee after: TRAFFIC CONTROL TECHNOLOGY Co.,Ltd. Address before: 100070 Beijing science and Technology Park of Fengtai District Haiying Road No. 6 hospital of Beijing, the headquarters of the International 2 Building No. 3 Patentee before: Beijing Traffic Control Technology Co., Ltd. |
|
| CP03 | Change of name, title or address |
Address after: 100070 Beijing science and Technology Park of Fengtai District Seahawks Hospital No. 6 2, No. 3 (Park) Patentee after: TRAFFIC CONTROL TECHNOLOGY Co.,Ltd. Address before: 100070 Beijing science and Technology Park of Fengtai District Haiying Road No. 6 hospital of Beijing, the headquarters of the International 2 Building No. 3 Patentee before: TRAFFIC CONTROL TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20191203 Address after: Room 302-5, building C02, North Fuyuan Road, Wuqing Development Zone, Wuqing District, Tianjin (centralized office area) Patentee after: Tianjin jiaokong Haohai Technology Co., Ltd Address before: 100070 Beijing science and Technology Park of Fengtai District Seahawks Hospital No. 6 2, No. 3 (Park) Patentee before: TRAFFIC CONTROL TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| CP03 | Change of name, title or address |
Address after: Room 302-5, building C02, North Fuyuan Road, Wuqing Development Zone, Tianjin 301700 (centralized office area) Patentee after: Traffic control technology equipment Co., Ltd Address before: Room 302-5, building C02, North Fuyuan Road, Wuqing Development Zone, Wuqing District, Tianjin (centralized office area) Patentee before: Tianjin jiaokong Haohai Technology Co., Ltd |
|
| CP03 | Change of name, title or address |