CN105468521B - A kind of semantic location of mistake method of pointer correlation based on subgraph search - Google Patents
A kind of semantic location of mistake method of pointer correlation based on subgraph search Download PDFInfo
- Publication number
- CN105468521B CN105468521B CN201510796542.9A CN201510796542A CN105468521B CN 105468521 B CN105468521 B CN 105468521B CN 201510796542 A CN201510796542 A CN 201510796542A CN 105468521 B CN105468521 B CN 105468521B
- Authority
- CN
- China
- Prior art keywords
- program
- statement
- sentence
- pointer
- sparql
- 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.)
- Expired - Fee Related
Links
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/3604—Software analysis for verifying properties of programs
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Machine Translation (AREA)
- Debugging And Monitoring (AREA)
Abstract
A kind of semantic location of mistake method of pointer correlation based on subgraph search, (1) according to the input of the test case of failure, semiology analysis, perform track of the record source program under this input, the RDF files of each program state labyrinth related to pointer are carried out to program；(2) according to perform track, the value of variable is with the inconsistent breakpoint of desired value, reversely generating positioning equation group to each sentence in program track and SPARQL inquiring about file from program；(3) first sentence of positioning equation group or SPARQL inquiries without solution is reversely found by dichotomy, a minimum usability of program fragments is constituted to the sentence related to breakpoint argument this sentence by breakpoint；(4) user can input desired value of the variable under some state in fragment again, the usability of program fragments where mistake is repositioned in this usability of program fragments, this interaction is constantly repeated, until obtained usability of program fragments is sufficiently small, mistake can be precisely positioned to.
Description
Technical field
The present invention relates to a kind of automation location of mistake method in C language process, more particularly to one kind is mainly for finger
Pin semanteme relevant error, the automation location of mistake method based on subgraph search.
Background of invention
According to statistics, in the software systems of pointer and Dram are used, 50% software fault and pointer and dynamic
The management of internal memory is relevant.The research for pointer error positioning is broadly divided into two aspects at present：On the one hand it is that pointer analysis is calculated
The research of method, it is mainly used to determine the memory address collection that a pointer may point to or the alias that one piece of internal memory may be operated
Collection.Because such analysis is typically not confirmable, therefore existing Pointer Analysis Algorithm is often approximate.The opposing party
Face, some certain types of pointer errors of pointer analysis instrument Main Analysis, as null pointer dereference, RAM leakage, pointer be not first
The hidden danger of the secure contexts such as beginningization.At present, the correlative study for the localization method of the semantic error of pointer is less.
In large-scale C/C++ programs, especially in the labyrinth such as figure and tree, the application of pointer is quite varied.And at this
In kind labyrinth, once there is mistake, generally require to debug manually, and efficiency is low.
The content of the invention
The technology of the present invention solves problem：A kind of overcome the deficiencies in the prior art, there is provided pointer phase based on subgraph search
Semantic error localization method is closed, it can realize that the pointer in the labyrinth such as tree or figure is related semantic according to the method for subgraph search
Mistake is automatically positioned, and compared to traditional alias analysis algorithm, has higher accuracy.
The technical solution of the present invention：A kind of semantic location of mistake method of pointer correlation based on subgraph search, it is special
Sign is that step is as follows：
(1) according to the input of the test case of failure, semiology analysis is carried out to program, record source program is under this input
Perform track, the RDF files of each program state labyrinth related to pointer；
(2) according to perform track, from program the value of variable with the inconsistent breakpoint of desired value, reversely to program track
In each sentence generation positioning equation group and SPARQL (simple protocol and RDF query language) inquiry file；
(3) first sentence of positioning equation group or SPARQL inquiries without solution is reversely found by dichotomy, by breaking
Point constitutes a minimum usability of program fragments to the sentence related to breakpoint argument between this sentence；
(4) the usual scope of usability of program fragments that one-time positioning arrives is larger, and user can input in fragment variable again at some
Desired value under state, the usability of program fragments where mistake is repositioned in this usability of program fragments, constantly repeats this interaction,
Until obtained usability of program fragments is sufficiently small, mistake can be precisely positioned to.
According to a further aspect of the invention, wherein step (1) further comprises step：
(a) according to statement type, including assignment statement, sequential statement, conditional statement, Do statement and null statement, use
Different operational semantics rule generation perform tracks；
(b) labyrinth such as tree or figure is converted to the RDF files represented in xml form；
According to a further aspect of the invention, wherein step (2) further comprises：
(a) judge whether operated in current statement containing pointer variable, if so, (b) is turned to, if not provided, turning to
(c)；
(b) according to the type of current statement, use different operating semantic and new SPARQL inquiries, the language are generated for the sentence
The positioning equation group of sentence does not update, identical with the positioning equation group of the latter bar sentence in perform track；
(c) it is semantic using different operating according to the type of current statement, including state initialization, assignment statement, condition language
Sentence, Do statement, input, new positioning equation group is generated for the current statement, and the SPARQL inquiries of the current statement do not update.
According to a further aspect of the invention, wherein step (3) further comprises：
(a) judge whether positioning equation group has solution using Z3 solvers；Z3 is that a can be directed to of Microsoft's research and development can expire
The foot theory of modules (SMT translator of Chinese) solver that problem is efficiently calculated, is widely used in software verification and software
Analysis field, we realize solving equations using Z3 dynamic link library；
(b) plug-in unit of SPARQL inquiries is solved using Apache Jena API generations, with RDF files and SPARQL files
As input, solve with the presence or absence of the subgraph for meeting to constrain in SPARQL in RDF, if it does not exist, then indicating no solution.Apache
Jena is a Java framework increased income, and for establishing semantic net and associated data application, it, which is provided, supports SPARQL inquiries
Relevant interface.
The present invention compared with prior art the advantages of be：The present invention considers that the semantic related mistake of pointer is determined in C language
Position, being automatically positioned for the pointer correlation semantic error in the labyrinth such as tree or figure is realized by the method for subgraph search, compared
In traditional alias analysis algorithm, there is higher accuracy.
Brief description of the drawings
Fig. 1 is the algorithm basic flow sheet of the present invention；
Fig. 2 is the process chart of the pointer assignment statement of the present invention；
Fig. 3 is the conditional statement process chart of the present invention；
The analog node that Fig. 4 is the present invention accesses sentence process chart.
Embodiment
Below with reference to the accompanying drawings, embodiments of the invention are described in detail.
The algorithm principle of the present invention is illustrated first.
The basic ideas of debugging formalization are in function：When there is the test case of failure in program, according to
Program input and output expected from family, find out the minimum usability of program fragments that contradiction is expected with user from program.If this usability of program fragments
Still it is larger, then by continuous and user mutual, allow the wherein correct sentence of user's mark or allowing user further to provide
The desired value of variable under certain conditions in fragment, the scope of sentence fragment is reduced using these new information, until final fixed
Position is to a mistake in program.
Specifically, innovatory algorithm basic procedure proposed by the invention is as shown in Figure 1.
The invention mainly comprises core concept：According to the perform track and desired value of program, every execution language is reversed
Sentence generation positioning equation group and SPARQL inquiries, mainly represent the restriction relation between common variables by positioning equation group, with
SPARQL inquiries represent the dependence between pointer, inquire about to obtain first without solution by solving positioning equation group and SPARQL
Sentence, so as to be inferred to include the minimum usability of program fragments of mistake.
Variable and method are first defined as follows before algorithm is described：
1. state when state σ performs as sentence S is set, with k- tuplesRepresent, whereinRepresent variable xiValue be ni；
2. state σ*It has recorded when generating SPARQL inquiries for sentence S, the pointer variable p in programiTo it in SPARQL
Represent variable riMapping, due to all query interfaces of SPARQL grammatical norms be with question mark start character string, it is therefore desirable to
This pointer state table is mapped.pi→ri, i ∈ N, PV={ p1,…,pk, AD={ r1,…,rk}；
The set of related pointer variable in PV representation programs, AD represent that these pointer variables are reflected in SPARQL inquiries
The variables collection penetrated.pi→riRepresent pointer variable piR is used in SPARQL inquiriesiRepresent.
3. the head sentence that S is an if sentence or while statement is made, such as if (b), state when σ is sentence S execution, two
Tuple<S,σ>It is referred to as a B- environment.B- environment stacks are represented with ε, wherein each element is a B- environment；
4. triple<S,σ,σ*,ε>For a S*- structure, π are track stack, and each element is S in π*- structure, T- knots
Structure is defined as π |<S,σ,σ*,ε>。
5.rq stores SPARQL query statements, eq storage positioning equation groups, every relevant information ternary for performing sentence S
Group (rq, eq,<S,σ,σ*,ε>) represent, ρ*Be one by triple (rq, eq,<S,σ,σ*,ε>) structure composition list, storage
The SPARQL inquiries of all sentences and positioning equation group in perform track.
The arthmetic statement of the present invention is as follows, such as Fig. 1：
1. the generation that perform track and RDF files wherein perform track are generated for error source program follows following operation language
Justice：
(a) assignment statement：The value of x=e, calculation expression e under the state σ of current statement, and with this value more new state σ
Middle x value, by S corresponding to current statement*In-structure press-in track stack π；
(b) sequential statement：If S1And S2For adjacent sequential statement, then according to statement type, to S1Symbol is carried out to hold
OK；
(c) if sentences：if(b){S1；}else{S2；By S corresponding to current statement*In-structure press-in track stack π；Calculate
Conditional expression b value under current statement state σ, if true, then conditional statement head if (b) and its true value true is pressed into environment
In stack ε, next to S1Statement body carries out Track Pick-up；If vacation, then conditional statement head if (b) and its true value false is pressed
Enter in environment stack ε, next to S2Statement body carries out Track Pick-up.
(d) while statement：while(b){S；By S corresponding to current statement*In-structure press-in track stack π；Calculate and work as
Conditional expression b value under preceding sentence state σ, if true, then conditional statement head while (b) and its true value true is pressed into ring
In the stack ε of border, Track Pick-up next is carried out to S statement bodies, when having performed the last item sentence of S statement bodies, checks environment stack
The statement type on top, if Do statement, then repeat this process；If vacation, then by conditional statement head while (b) and its very
In value false press-in environment stacks ε, Track Pick-up next is carried out to the sentence after the circulation.
The generation method of RDF files is as follows：If the labyrinth such as tree or figure in program be present, being denoted as XML (can
Extending mark language) form RDF files.Each node is with one<rdf:Description>Label is described, node
Each attribute can use one<rdf:Description>Under subtab be described.
2. according to perform track, from program the value of variable with the inconsistent breakpoint of desired value, reversely to program track
In each sentence generation positioning equation group and SPARQL inquiry file.It is different according to statement type, there is following operational semantics
Rule：
(a) original state：If breakpoint sentence is pointer correlative, access node r desired value is w, then rq
Initial value is<x,value,w>, σ*Content be<r,x>, represent that pointer r uses symbol in SPARQL inquiriesX expressions,x
Value should be w, eq initial value is sky；If breakpoint sentence is not related to pointer, rq initial value is sky, and eq initial value is
{ y=n }, when representation program terminates, some variable y desired value is n.To sum up, ρ*Initial value for [(rq, eq,<skip,σ*,
(),[]>)]。
(b) assignment statement:If pointer assignment p=w form, then handled by the flow described in Fig. 2.Due to
σ*In only need to store expression symbol of the prefix of pointer expression formula first in SPARQL, obtain the first of pointer expression formula p first
Prefix p', such as pointer expression formula q → left → left the first prefix is q, if σ*In p' be present, then the sentence for correlation
Sentence, first by expression formula p topology update into rq, according to w more new state σ*, and rq is arrived into p and w points relationship expression
In.Supposing expression p structure is ultimately expressed as symbol in rqX_i, w the first prefix are in σ*In be mapped asx_w.Have
Following two situations, if w is single pointer variable, i.e. the first prefix of w is still w, then by all symbols in rqX_i is more
It is newlyx_w；If w is k layer expression formulas, the expression of its k-1 Rotating fields will be first updated into rq, then by kth layer withx_i
Relation be added in rq.If σ*In p' is not present, then the sentence is unrelated sentence, is skipped.If current statement is x=e
The non-pointer assignment statement of form, if x occurs in eq, the sentence is correlative, the institute that will occur in eq equation
There is x all to replace with e；Otherwise this assignment statement is not to cause result and expected inconsistent sentence, can be skipped.
(c) conditional statement and Do statement：If (b)/while (b), handled by flow described in Fig. 3, specifically such as
Under：
1) associated row is determined whether.If outer layer environment of the conditional statement as its substatement, has been labeled as
Correlative, then the sentence be labeled as associated row.Otherwise, it is determined whether the variable influenceed in the presence of the conditional statement is to influence simultaneously
As a result variable, if there is no unrelated row is then labeled as, exit, otherwise labeled as associated row, carry out step 2)；
2) by conditional statement be split as with or the sub- condition that separates of operation, be divided into three set, in A storage only include general
Lead to the sub- condition of variable, the sub- condition for only including pointer is deposited in B, the sub- bar comprising pointer and common variables combination is deposited in C
Part.Such as sentence if (p → value>3&&top<0||q→value>Top), then sub- condition top is deposited in set A<Deposited in 0, B
Put sub- condition p → value>Sub- condition q → value is deposited in 3, C>top.If B and C are sky, illustrate to be free of pointer, then will
Equation b=[b]σAdd in eq, wherein [b]σTrue value of the conditional expression b under state σ is represented, is terminated.Otherwise calculate all full
The subconditional true value combination of the foot sentence true value, it is assumed that the conditional statement be it is false, then sub- condition true value combination have 3 kinds ([0,0,
0], [0,1,0], [1,0,0]), every kind of true value is combined and carries out step 3) operation；
3) each sub- condition in B is added in the FILTER sentences in rq, the pointer variable in C adds rq triples
In, form new rq inquiry files.By taking [0,0,0] as an example, it is assumed that σ*Middle p is mapped asX_i, q are mapped asX_j, then by ternary
Group<x_i≤3>It is added in rq FILTER, by triple<x_j value Z>Add in rq.The rq files are solved, if
There is solution, parse value of each pointer variable in rq solutions in C, replace subconditional pointer variable in C with corresponding value so that C
In each sub- condition in no longer include pointer, use or operate connection when having more class values.For example, herein in C pointer variable only have q →
Value, it is assumed that q → value has two groups of solutions a and b in rq solutions, then sub- condition q → value after replacing in C>Top is changed into a>top
||b>Top, if there is another sub- condition T in C, its true value is V, then two sub- conditions should finally replace with a sub- condition a>
top&&TV(a)||b>Top＆＆TV (b), TV (a) represent sub- condition T T on the premise of true value is V and q → value=a table
Show form.All sub- conditions in sub- condition after being replaced in C and A are added in positioning equation group eq, this sentences [0,0,0] and is
True value combination if equation group has solution, is remained into Q, it is necessary to a≤top＆＆b≤top and top >=0 is added in eq by example
In；
4) after all true value combined authentications are complete, if Q is sky, illustrate that all true value combinations can not all meet the true of the condition
Value, then this conditional statement is without solution, it is meant that all sentences performed before the sentence all should be without solution, will forever to reduce amount of calculation
False equation 0>1 adds in eq, to ensure that being performed before execution sentence in current statement in perform track need not be handled
All without solution.If Q, not for sky, the sub- condition in A or B that true value in Q is uniquely determined is added in rq or eq.Assuming that perform
Afterwards, there are two groups of true value combinations [0,0,0] and [0,1,0] in Q, then illustrate sub- condition p → value in B>3 perseverances are false, then by three
Tuple<x_i≤3>It is added in sentence rq FILTER.Sub- condition top in A<0 true value can not temporarily determine, so can not
It is added in eq, sub- condition q → value in C>Although top can determine true value it is permanent be 0, due to its both comprising pointer or
Comprising common variables, temporarily without processing.
(d) analog node accesses sentence：The flow processing as described in Fig. 4, using a=p → value form simulation to node
P access.Use the unique mark attribute value of particular variables a storage access nodes.If current statement is breakpoint language
Sentence, then p and its mapping are added into σ*In, its desired value is added in rq, otherwise updated with actual identification values of the p under state σ
The value of p value attributes in rq.
(e) input：In the case of not comprising pointer, by the equation group eq ∪ { x of a reflection program input1=m1,
...xk=mkIt is added to ρ*End；In the case of comprising pointer, the value values of the unique mark attribute of head node are added
In rq.
3. first sentence of positioning equation group or SPARQL inquiries without solution is reversely found by dichotomy, by breakpoint
A minimum usability of program fragments is constituted to the sentence related to breakpoint argument between this sentence, specific method for solving is：Use
Z3 solvers judge whether positioning equation group has solution；The relevant interface generation provided using Apache Jena is solved SPARQL and looked into
The plug-in unit of inquiry, using RDF files and SPARQL files as input, solve in RDF with the presence or absence of the son for meeting to constrain in SPARQL
Figure, if it does not exist, then indicating no solution.
4. the usual scope of usability of program fragments that one-time positioning arrives is larger, user can input in fragment variable again in some shape
Desired value under state, the usability of program fragments where mistake is repositioned in this usability of program fragments, constantly repeats this interaction, directly
It is sufficiently small to obtained usability of program fragments, mistake can be precisely positioned to.
The algorithm of the present invention is a difference in that with additional error localization method maximum：The complicated knot such as tree or figure can be handled
The related semantic error of pointer in structure, for the dependence between pointer, the alias set of Maintenance free pointer, expense is small, accurate
Exactness is high.Other advantages and modification can be obviously drawn for the person of ordinary skill of the art.Therefore, have more
Wide aspect illustrates and exemplary embodiment the invention is not limited in herein shown and described.Therefore,
, can be right in the case where not departing from the spirit and scope of general inventive concept as defined in appended claims and its equivalents
Various modification can be adapted for it.
Claims (4)
- A kind of 1. semantic location of mistake method of pointer correlation based on subgraph search, it is characterised in that step is as follows：(1) according to the input of the test case of failure, semiology analysis is carried out to program, records source program holding under this input Row track, the RDF resource description framework files of each program state labyrinth related to pointer；(2) according to perform track, from program the value of variable with the inconsistent breakpoint of desired value, reversely in program track Each sentence generates positioning equation group and SPARQL inquiry files, and SPARQL is a kind of inquiry language specifically for RDF format Speech；(3) reversely found by dichotomy positioning equation group or SPARQL inquiry first sentence without solution, by breakpoint to The sentence related to breakpoint variable between this sentence constitutes a minimum usability of program fragments；(4) the minimum usual scope of usability of program fragments that one-time positioning arrives is too big, and user inputs the minimum usability of program fragments again Desired value of the middle variable under some state, the usability of program fragments where mistake is repositioned in this minimum usability of program fragments, constantly This interaction is repeated, until user can determine the reason for wrong from obtained minimum usability of program fragments.
- 2. the pointer correlation semantic location of mistake method according to claim 1 based on subgraph search, it is characterised in that：Described Step (1) further comprises：(a) according to statement type, including assignment statement, sequential statement, conditional statement, Do statement and null statement, using difference Operational semantics rule generation perform track；(b) tree or figure labyrinth are converted to the RDF files represented in the form of XML extensible markup languages.
- 3. the pointer correlation semantic location of mistake method according to claim 1 based on subgraph search, it is characterised in that：Described Step (2) further comprises：(a) judge whether operated in current statement containing pointer variable, if so, (b) is turned to, if not provided, turning to (c)；(b) according to the type of current statement, use different operating semantic and new SPARQL inquiries are generated for the sentence, the sentence Positioning equation group does not update, identical with the positioning equation group of the latter bar sentence in perform track；(c) it is semantic using different operating according to the type of current statement, including state initialization, assignment statement, conditional statement, Do statement, input, new positioning equation group is generated for the current statement, and the SPARQL inquiries of the current statement do not update.
- 4. the pointer correlation semantic location of mistake method according to claim 1 based on subgraph search, it is characterised in that：Described Step (3) further comprises：(a) judge whether positioning equation group has solution using Z3 solvers；(b) plug-in unit of SPARQL inquiries is solved using Apache Jena generations, using RDF files and SPARQL files as inputting, Solve with the presence or absence of the subgraph for meeting to constrain in SPARQL in RDF, if it does not exist, then indicating no solution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510796542.9A CN105468521B (en) | 2015-11-18 | 2015-11-18 | A kind of semantic location of mistake method of pointer correlation based on subgraph search |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510796542.9A CN105468521B (en) | 2015-11-18 | 2015-11-18 | A kind of semantic location of mistake method of pointer correlation based on subgraph search |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105468521A CN105468521A (en) | 2016-04-06 |
| CN105468521B true CN105468521B (en) | 2018-01-19 |
Family
ID=55606252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510796542.9A Expired - Fee Related CN105468521B (en) | 2015-11-18 | 2015-11-18 | A kind of semantic location of mistake method of pointer correlation based on subgraph search |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105468521B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109814924B (en) * | 2019-01-28 | 2020-10-02 | 华东师范大学 | Software complexity calculation method |
| CN112286824B (en) * | 2020-11-18 | 2022-08-02 | 长江大学 | Test case generation method and system based on binary search iteration and electronic equipment |
| CN116361182B (en) * | 2023-04-03 | 2023-12-05 | 南京航空航天大学 | Symbol execution method for error state guidance |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103019943A (en) * | 2013-01-04 | 2013-04-03 | 北京航空航天大学 | Software error positioning method catering to rare case of failed test cases |
| CN104156308A (en) * | 2014-07-29 | 2014-11-19 | 南京大学 | Mobile application testing method on basis of playback of execution trace of users |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8607094B2 (en) * | 2009-09-29 | 2013-12-10 | Hyundai Motor Company | Operational system test method |
-
2015
- 2015-11-18 CN CN201510796542.9A patent/CN105468521B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103019943A (en) * | 2013-01-04 | 2013-04-03 | 北京航空航天大学 | Software error positioning method catering to rare case of failed test cases |
| CN104156308A (en) * | 2014-07-29 | 2014-11-19 | 南京大学 | Mobile application testing method on basis of playback of execution trace of users |
Non-Patent Citations (1)
| Title |
|---|
| 一个在Horn子句中求解极大缩减的算法;罗杰 等;《中国科学：信息科学》;20111231;第41卷(第2期);第129-143页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105468521A (en) | 2016-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sevilla Ruiz et al. | Inferring versioned schemas from NoSQL databases and its applications | |
| US10324909B2 (en) | Omega names: name generation and derivation utilizing nested three or more attributes | |
| US9330116B2 (en) | Determining hierarchical paths to nodes | |
| US11397575B2 (en) | Microservices graph generation | |
| EP2652645A1 (en) | Extensible rdf databases | |
| CN105335412A (en) | Method and device for data conversion and data migration | |
| CN106874163B (en) | Method and system for displaying software error code information | |
| US10489493B2 (en) | Metadata reuse for validation against decentralized schemas | |
| CN104503816A (en) | System for automatically converting hardware language VHDL (Vhsic Hardware Description Language) into MSVL (Modeling, Simulation and Verification Language) | |
| US20160306736A1 (en) | Translation verification testing | |
| CN105468521B (en) | A kind of semantic location of mistake method of pointer correlation based on subgraph search | |
| US9483508B1 (en) | Omega names: name generation and derivation | |
| CN103473224A (en) | Problem semantization method based on problem solving process | |
| CN109933331A (en) | Data transfer device and associated component between a kind of client-server | |
| CN104731911A (en) | Dynamic mapping and conversion method of data table and entity class | |
| CN110308907A (en) | Data transfer device, device, storage medium and electronic equipment | |
| Liu et al. | Extracting sent message formats from executables using backward slicing | |
| CN116628066A (en) | Data transmission method, device, computer equipment and storage medium | |
| CN103902651A (en) | Cloud code query method and device based on MongoDB | |
| Gardner et al. | Modelling dynamic web data | |
| WO2020248784A1 (en) | Method for realizing mother language programming on computer | |
| CN111475534B (en) | Data query method and related equipment | |
| Hoeller et al. | Efficient XML data and query integration in the wireless sensor network engineering process | |
| Zhang et al. | Automatic extraction rules generation based on xpath pattern learning | |
| Zhu | Creating a NoSQL database for the Internet of Things: Creating a key-value store on the SensibleThings platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180119 Termination date: 20191118 |