CN106886417A - A kind of universal parallel method for digging of linear temporal specification - Google Patents

A kind of universal parallel method for digging of linear temporal specification Download PDF

Info

Publication number
CN106886417A
CN106886417A CN201710139684.7A CN201710139684A CN106886417A CN 106886417 A CN106886417 A CN 106886417A CN 201710139684 A CN201710139684 A CN 201710139684A CN 106886417 A CN106886417 A CN 106886417A
Authority
CN
China
Prior art keywords
event
track
canonical
canonical example
digging
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710139684.7A
Other languages
Chinese (zh)
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.)
Shanghai Fenglei Information Technology Co Ltd
East China Normal University
Original Assignee
Shanghai Fenglei Information Technology Co Ltd
East China Normal University
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 Shanghai Fenglei Information Technology Co Ltd, East China Normal University filed Critical Shanghai Fenglei Information Technology Co Ltd
Priority to CN201710139684.7A priority Critical patent/CN106886417A/en
Publication of CN106886417A publication Critical patent/CN106886417A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/70Software maintenance or management
    • G06F8/75Structural analysis for program understanding

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The invention discloses a kind of universal parallel method for digging of linear temporal specification, the method includes:Pre-treatment step, canonical example generation step, canonical example verification step, result screening step.Wherein, pre-treatment step is realized carrying out journal file dividing processing, obtains the event sets occurred in daily record, and collect appearance positional information of these events in daily record;Canonical example generation step, using the specification masks of input, with reference to the event sets in daily record, generates specific linear temporal canonical example.Canonical example checking procedure, is responsible for utilizing pretreated event position information, calculates support, confidence level of the canonical example in daily record;Result screens step, is responsible for screening the results set for excavating, and removal support, confidence level do not meet the canonical example for excavating and requiring.The method for digging takes full advantage of multithreading and carries out parallel computation, can efficiently excavate any type of linear temporal specification.

Description

A kind of universal parallel method for digging of linear temporal specification
Technical field
The present invention relates to a kind of specification of the linear temporal in field of computer technology, especially model inspection field A kind of digging technology, and in particular to universal parallel method for digging of linear temporal specification.
Background technology
From unlike Other Engineering product, software product can constantly change evolution in its whole life cycle.And During being safeguarded to software, being updated, to keep the correctness of system original function, attendant generally needs to pay Significant effort.According to statistics, the maintenance cost of software occupies the 90% of software development cost.Therefore, how research reduces soft Part maintenance cost has very real meaning.
And the overwhelming majority among software maintenance cost, all originate from understanding the cost produced by absorbing to leaving source code. There are some researches show to understand that the cost that original code is paid has exceeded the 50% of total maintenance cost.Generally, developer can select Ocr software specification document aids in the understanding of software program.However, in many enterprises, developer applies under the pressure of market It is ageing, neglected specification document write with maintenance so that significant portion of software specifications document does not have with software The evolution of program is timely updated.So, by Evolutionary Cycles several times, the software program of latest edition already with it is original Specification document it is far from each other.Therefore, how software specifications are updated in time, become a problem for being worth exploring.
In addition, the correctness in order to ensure software systems, there has been proposed model inspection technology.Such as Application No. 201510395404.X, the Chinese invention patent of entitled secure exchange protocol model detection method, discloses a kind of peace The step of total exchange protocol model detection method, the method, includes:1) secure exchange protocol model is built;2) security attribute is built Model;3) the Attacker Model is built;4) state yojan and model inspection.
Model inspection technology mainly by the way that software systems are carried out with abstract modeling, and using a series of formalization property come Whether whether checking model meets special properties, has certain property with Study system, or violate certain constraint.Linear Temporal is patrolled Volume it is generally used for the formal definitions model property that possesses and constraint.However, the difficulty of construction formalization property hinders always The extensive use of model inspection technology is hindered.
Therefore, it is necessary to find a kind of method, the property that software systems possess can be automatically obtained from software systems Or constraint.Understand the natural law as people's observation of nature phenomenon, can be using the method for certain automation, according to software system The running log of system, running orbit learns, excavates the property that software systems possess.
The content of the invention
It is main the invention discloses a kind of universal parallel method for digging of linear temporal specification to solve problem above It is used for the linear temporal relation possessed between various events in excavation daily record from the journal file of software systems, for obtaining The rule between event in daily record is taken, to deduce the Linear Temporal property that may possess in software program, so as to aid in journey The understanding analysis of sequence, it can also be used to Protocol Analysis.
Specifically, the invention discloses a kind of universal parallel method for digging of linear temporal specification, including following step Suddenly:
Pre-treatment step, splits to journal file, isolates the independent track in journal file, obtains journal file In all events set and the position that occurs in independent track of each event;
Canonical example generation step, according to the specification masks set of input, by variable therein and log event set Event bound successively, to obtain canonical example candidate collection;
Canonical example verification step, verifies to the canonical example in canonical example candidate collection successively, calculate its Support, confidence level situation in daily record;
Result screens step, the excavation requirement according to input, and support, confidence level are removed from canonical example candidate collection Undesirable canonical example.
Preferably, the universal parallel method for digging of linear temporal specification as described above, the pre-treatment step bag Include following sub-step:
Track separating step, by text-processing, by the digital independent in daily record to internal memory, is divided according to separator From the set that one element of acquisition is made up of wall scroll track;
Event sets obtaining step, scans every track respectively, and dividing processing is carried out to track with above-mentioned separator, obtains Atomic event set;
Event position information obtaining step, scans every track, the positional information that record event occurs in track.
Preferably, the universal parallel method for digging of linear temporal specification as described above, the pre-treatment step Implementation process is:Character string is sequentially read from journal file, when separator is run into, recognizes and judge that the separator is thing Part separator or track separator, if track separator, then current track terminates and a newly-built track storage object; If event separator, then new event position information is recorded, and the event is added among event sets.
Preferably, the universal parallel method for digging of linear temporal specification as described above, the canonical example generation Step includes following three sub-step:
Specification masks analytical procedure, the specification masks to being input into carry out syntactic analysis, obtain the variable in specification masks;
Variable-Bindings step, with the event in event sets, is replaced to the variable in specification masks, will specification mould Variable-Bindings in plate are specific event;
Example generation step, after the variable all binding events in specification masks, then as a specific canonical example, no With the different event of specification masks Variable-Bindings, to generate different canonical examples.
Preferably, the universal parallel method for digging of linear temporal specification as described above, the canonical example checking Step includes following three sub-step:
Initialization step, is one validator thread instance of every Track Pick-up;
Parallel proof step, is performed in parallel each thread instance, according to the semanteme of linear temporal, checks that each is advised Whether model example meets on each track;
Statistical summaries step, the result of parallel computation is collected, and counts each canonical example on all tracks Meet situation, obtain a statistics mapping table with the key-value pair of canonical example and statistics as element.
Preferably, the universal parallel method for digging of linear temporal specification as described above, the result set screening step Suddenly traveled through by the statistics mapping table that the statistical summaries step is produced, it is undesirable to remove statistics Canonical example.
It is an advantage of the current invention that compared with prior art, a kind of linear temporal specification disclosed by the invention is general P mining method, has the advantages that:The method constructs linear temporal according to linear temporal specification masks Canonical example, then parallel proof is carried out by multithreading, can extremely efficiently obtain correct linear temporal rule Model.
Brief description of the drawings
By reading the detailed description of hereafter preferred embodiment, various other advantages and benefit is common for this area Technical staff will be clear understanding.Accompanying drawing is only used for showing the purpose of preferred embodiment, and is not considered as to the present invention Limitation.And in whole accompanying drawing, identical part is denoted by the same reference numerals.In the accompanying drawings:
Accompanying drawing 1 shows linear temporal specification universal parallel method for digging flow chart element according to embodiments of the present invention Figure;
Accompanying drawing 2 shows the pre- place in linear temporal specification universal parallel method for digging according to embodiments of the present invention Manage the FB(flow block) of step;
Accompanying drawing 3 shows specification reality in linear temporal specification universal parallel method for digging according to embodiments of the present invention The FB(flow block) of example generation step;
Accompanying drawing 4 shows the specification reality of linear temporal specification universal parallel method for digging according to embodiments of the present invention The FB(flow block) of example verification step.
Specific embodiment
The illustrative embodiments of the disclosure are more fully described below with reference to accompanying drawings.Although showing this public affairs in accompanying drawing The illustrative embodiments opened, it being understood, however, that may be realized in various forms the disclosure without the reality that should be illustrated here The mode of applying is limited.Conversely, there is provided these implementation methods are able to be best understood from the disclosure, and can be by this public affairs The scope opened it is complete convey to those skilled in the art.
As shown in figure 1, including step with the linear temporal specification universal parallel method for digging that said system is realized:
S110, pre-treatment step:Journal file is split, (track is for the independent track for isolating in journal file Event arranges constituted sequence sequentially in time), obtain journal file in all events set (EVENT) and each Position (the MAP that event occurs in independent track<Event,Position>).Journal file is to operate thing for record system The log file or file set of part, operating system have operating system journal file, and Database Systems have Database Systems daily record File, etc..
S120, canonical example generation step:According to the specification masks set of input, by variable therein and log event collection Event in conjunction is bound successively, to obtain canonical example candidate collection SIC (Specification Instance Candidates)。
S130, canonical example verification step:The canonical example in canonical example candidate collection is verified successively, is calculated Its support, confidence level situation in daily record.
The formula of support (Support) is:Support(A->B)=P (A ∪ B).Support discloses A and B while going out Existing probability.If the probability that A and B occurs is small simultaneously, illustrate that the relation of A and B is little;If the very frequency that A and B occurs simultaneously It is numerous, then illustrate that A is always related to B.
The formula of confidence level (Confidence) is:Confidence(A->B)=P (A | B).Confidence level discloses A appearance When, whether B also occurs or has many maximum probabilities to occur.If confidence level can be with bundle sale for 100%, A and B.If Confidence level is too low, then illustrating the appearance of A, whether relation occur with B little.
Example:In the market of certain sale mobile phone, the sale comprising charger in 70% mobile phone sale, and in All Activity In 56% sale simultaneously include mobile phone and charger.Then in this instance, support is 56%, and confidence level is 70%.
Support:The probability that P (A ∪ B), i.e. A and B the two item collections occur simultaneously in transaction set D.
Confidence level:P (B | A), i.e., in the transaction set D for item collection A occur, the probability that item collection B also occurs simultaneously.
S140, result set screening step:Excavation requirement according to input, removes from canonical example candidate collection and supports Degree, the undesirable canonical example of confidence level.
A minimum support threshold value and minimal confidence threshold can be set generally in excavation, while meeting the two branch The rule of degree of holding is referred to as strong rule.Confidence level represents the intensity of rule, and support represents the frequency occurred in rule.Given one Individual transaction set D, Mining Association Rules problem is exactly the minimum support for producing support and confidence level respectively greater than user to give With the correlation rule of Minimum support4, that is, the problem for producing strong rule.
As shown in Fig. 2 the pre-treatment step S110 includes following three sub-step:
S111, track separating step:One journal file is made up of many bar tracks, by certain text-processing, By in the digital independent in daily record to internal memory, separated according to specific separator, it to obtain by wall scroll track an element The set of composition;The separator includes event separator or track separator, if being separated to the data of daily record, Often use event separator.
S112, event sets obtaining step:Every track is scanned respectively, and segmentation portion is carried out to track with specific separator Reason, obtains atomic event set;The separator includes event separator or track separator, if being divided track Cut, often use track separator.Closely the program module of processing generation terminating data is referred to as atomic event.Daily record is by flow In each task processed as an atomic event.
S113, event position information obtaining step:Every track of scanning, the position letter that record event occurs in track Breath.
Wherein, the above three sub-step of the pre-treatment step S110 can be carried out simultaneously, i.e., sequentially from daily record text Character string is read in part, when separator is run into, recognizes and judge that the separator is event separator or track separator, If track separator, then current track terminates and a newly-built track storage object;If event separator, then record new Event position information, and the event is added among event sets.In this manner it is possible to be completed by the single pass to daily record The pretreatment of input data, is greatly enhanced operational efficiency.
As shown in figure 3, the canonical example generation step S120 includes following three sub-step:
S121, specification masks analytical procedure:Specification masks to being input into carry out syntactic analysis, obtain the change in specification masks Amount.
S122, Variable-Bindings step:With the event in event sets, the variable in template is replaced, will template In Variable-Bindings be specific event.
S123, example generation step:After variable all binding events in specification masks, then as a specific specification reality Example.Different specification template variable binds different events, you can to generate different canonical examples.If becoming in a specification masks The number of amount is N, and the size of event sets is M in journal file, by permutation and combination, will generate the Nth power kind specification reality of M Example.
As shown in figure 4, the canonical example verification step S130 includes following three sub-step:
S131, initialization step:Because verification process of the canonical example on every track is separate, therefore it is every One validator thread instance of Track Pick-up.
S132, parallel proof step:Each thread is performed in parallel, according to the semanteme of linear temporal, each is checked Whether canonical example meets on each track.
S133, statistical summaries step:The result of parallel computation is collected, each canonical example is counted in all tracks On meet situation, obtain one with (canonical example, statistics) key-value pair (Key-Value Pair) for element mapping Table M.
Key-value pair can obtain a corresponding value according to a key assignments.For example, in general object-oriented editor, often Form.Enable=True or False can be used, is exactly to an encapsulation for value with a series of api functions.
Finally, in the result set screening step S140, by the statistical number produced to canonical example verification step S130 Traveled through according to mapping table M, whether the statistics for investigating each canonical example one by one meets the requirements, removal statistics is not inconsistent Close desired canonical example.So, remaining canonical example is all the canonical example for meeting excavation condition.
By means of the invention it is also possible to obtain the linear temporal relation of event from software systems running log. Can be used for aid in software systems analysis and understanding, and communication protocol analysis.
It should be noted that:
Algorithm and display be not inherently related to any certain computer, virtual bench or miscellaneous equipment provided herein. Various fexible units can also be used together with based on teaching in this.As described above, construct required by this kind of device Structure be obvious.Additionally, the present invention is not also directed to any certain programmed language.It is understood that, it is possible to use it is various Programming language realizes the content of invention described herein, and the description done to language-specific above is to disclose this hair Bright preferred forms.
In specification mentioned herein, numerous specific details are set forth.It is to be appreciated, however, that implementation of the invention Example can be put into practice in the case of without these details.In some instances, known method, structure is not been shown in detail And technology, so as not to obscure the understanding of this description.
Similarly, it will be appreciated that in order to simplify that the disclosure and helping understands in each inventive aspect one or more, Above to the description of exemplary embodiment of the invention in, each feature of the invention is grouped together into single implementation sometimes In example, figure or descriptions thereof.However, the method for the disclosure should be construed to reflect following intention:I.e. required guarantor The application claims of shield features more more than the feature being expressly recited in each claim.More precisely, such as following Claims reflect as, inventive aspect is all features less than single embodiment disclosed above.Therefore, Thus the claims for following specific embodiment are expressly incorporated in the specific embodiment, and wherein each claim is in itself All as separate embodiments of the invention.
Those skilled in the art are appreciated that can be carried out adaptively to the module in the equipment in embodiment Change and they are arranged in one or more equipment different from the embodiment.Can be the module or list in embodiment Unit or component be combined into a module or unit or component, and can be divided into addition multiple submodule or subelement or Sub-component.In addition at least some in such feature and/or process or unit exclude each other, can use any Combine to all features disclosed in this specification (including adjoint claim, summary and accompanying drawing) and so disclosed appoint Where all processes or unit of method or equipment are combined.Unless expressly stated otherwise, this specification (including adjoint power Profit is required, summary and accompanying drawing) disclosed in each feature can the alternative features of or similar purpose identical, equivalent by offer carry out generation Replace.
Although additionally, it will be appreciated by those of skill in the art that some embodiments described herein include other embodiments In included some features rather than further feature, but the combination of the feature of different embodiments means in of the invention Within the scope of and form different embodiments.For example, in the following claims, embodiment required for protection is appointed One of meaning mode can be used in any combination.
All parts embodiment of the invention can be realized with hardware, or be run with one or more processor Software module realize, or with combinations thereof realize.It will be understood by those of skill in the art that can use in practice Microprocessor or digital signal processor (DSP) are come in the creating device for realizing virtual machine according to embodiments of the present invention The some or all functions of a little or whole parts.The present invention is also implemented as performing method as described herein Some or all equipment or program of device (for example, computer program and computer program product).Such realization Program of the invention can be stored on a computer-readable medium, or can have the form of one or more signal.This The signal of sample can be downloaded from internet website and obtained, or be provided on carrier signal, or be carried in any other form For.
It should be noted that above-described embodiment the present invention will be described rather than limiting the invention, and ability Field technique personnel can design alternative embodiment without departing from the scope of the appended claims.In the claims, Any reference symbol being located between bracket should not be configured to limitations on claims.Word "comprising" is not excluded the presence of not Element listed in the claims or step.Word "a" or "an" before element is not excluded the presence of as multiple Element.The present invention can come real by means of the hardware for including some different elements and by means of properly programmed computer It is existing.If in the unit claim for listing equipment for drying, several in these devices can be by same hardware branch To embody.The use of word first, second, and third does not indicate that any order.These words can be explained and run after fame Claim.
The above, the only present invention preferably specific embodiment, but protection scope of the present invention is not limited thereto, Any one skilled in the art the invention discloses technical scope in, the change or replacement that can be readily occurred in, Should all be included within the scope of the present invention.Therefore, protection scope of the present invention should be with the protection model of the claim Enclose and be defined.

Claims (6)

1. a kind of universal parallel method for digging of linear temporal specification, comprises the following steps:
Pre-treatment step, splits to journal file, isolates the independent track in journal file, obtains institute in journal file The position that the set and each event for having event occur in independent track;
Canonical example generation step, according to the specification masks set of input, by the thing in variable therein and log event set Part is bound successively, to obtain canonical example candidate collection;
Canonical example verification step, verifies to the canonical example in canonical example candidate collection successively, calculates it in daily record In support, confidence level situation;
Result screens step, the excavation requirement according to input, and removing support, confidence level from canonical example candidate collection is not inconsistent Close desired canonical example.
2. the universal parallel method for digging of linear temporal specification as claimed in claim 1, it is characterised in that the pre- place Reason step includes following three sub-step:
Track separating step, by text-processing, by the digital independent in daily record to internal memory, is separated according to separator, Obtain the set that an element is made up of wall scroll track;
Event sets obtaining step, scans every track respectively, and dividing processing is carried out to track using above-mentioned separator, obtains former Gather subevent;
Event position information obtaining step, scans every track, the positional information that record event occurs in track.
3. the universal parallel method for digging of linear temporal specification as claimed in claim 2, it is characterised in that its feature exists In:
The implementation process of the pre-treatment step is:Character string is sequentially read from journal file, when separator is run into, is known Not and judge the separator for event separator or track separator, if track separator, then current track termination simultaneously A newly-built track storage object;If event separator, then new event position information is recorded, and the event is added to thing Among part set.
4. the universal parallel method for digging of linear temporal specification as claimed in claim 1, it is characterised in that the specification Example generation step includes following three sub-step:
Specification masks analytical procedure, the specification masks to being input into carry out syntactic analysis, obtain the variable in specification masks;
Variable-Bindings step, is replaced with the event in event sets to the variable in specification masks, will be in specification masks Variable-Bindings be specific event;
Example generation step, the variable in specification masks after binding event, as specific a canonical example, different specification Template variable binds different events, to generate different canonical examples.
5. the universal parallel method for digging of linear temporal specification as claimed in claim 1, it is characterised in that the specification Case verification step includes following three sub-step:
Initialization step, is one validator thread instance of every Track Pick-up;
Parallel proof step, is performed in parallel each thread instance, according to the semanteme of linear temporal, checks each specification reality Whether example meets on each track;
Statistical summaries step, the result of parallel computation is collected, and counts satisfaction of each canonical example on all tracks Situation, obtains a statistics mapping table with the key-value pair of canonical example and statistics as element.
6. the universal parallel method for digging of linear temporal specification as claimed in claim 5, it is characterised in that:
The result set screening step is traveled through by the statistics mapping table that the statistical summaries step is produced, to go Except the undesirable canonical example of statistics.
CN201710139684.7A 2017-03-09 2017-03-09 A kind of universal parallel method for digging of linear temporal specification Pending CN106886417A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710139684.7A CN106886417A (en) 2017-03-09 2017-03-09 A kind of universal parallel method for digging of linear temporal specification

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710139684.7A CN106886417A (en) 2017-03-09 2017-03-09 A kind of universal parallel method for digging of linear temporal specification

Publications (1)

Publication Number Publication Date
CN106886417A true CN106886417A (en) 2017-06-23

Family

ID=59179581

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710139684.7A Pending CN106886417A (en) 2017-03-09 2017-03-09 A kind of universal parallel method for digging of linear temporal specification

Country Status (1)

Country Link
CN (1) CN106886417A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106970791A (en) * 2017-03-09 2017-07-21 华东师范大学 A kind of universal parallel digging system of linear temporal specification
CN110263082A (en) * 2019-05-27 2019-09-20 东软集团股份有限公司 The data distribution analysis method of database, device, electronic equipment and storage medium
CN112925560A (en) * 2021-03-15 2021-06-08 云南大学 Declarative EFSA inference algorithm and method for declaring kTails and Synoptic
CN113726821A (en) * 2021-11-02 2021-11-30 华东交通大学 Verification method and system for security protocol formalization
CN113778381A (en) * 2021-08-14 2021-12-10 西安电子科技大学 PPTL (Power Point Label) standard mining system and method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104252406A (en) * 2013-06-28 2014-12-31 华为技术有限公司 Method and device for processing data
CN105005585A (en) * 2015-06-24 2015-10-28 上海卓悠网络科技有限公司 Log data processing method and device
CN106970791A (en) * 2017-03-09 2017-07-21 华东师范大学 A kind of universal parallel digging system of linear temporal specification

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104252406A (en) * 2013-06-28 2014-12-31 华为技术有限公司 Method and device for processing data
CN105005585A (en) * 2015-06-24 2015-10-28 上海卓悠网络科技有限公司 Log data processing method and device
CN106970791A (en) * 2017-03-09 2017-07-21 华东师范大学 A kind of universal parallel digging system of linear temporal specification

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
孟庆翔: "《基于 HBase 的日志异常分析与相关算法研究》", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106970791A (en) * 2017-03-09 2017-07-21 华东师范大学 A kind of universal parallel digging system of linear temporal specification
CN110263082A (en) * 2019-05-27 2019-09-20 东软集团股份有限公司 The data distribution analysis method of database, device, electronic equipment and storage medium
CN110263082B (en) * 2019-05-27 2022-04-29 东软集团股份有限公司 Data distribution analysis method and device of database, electronic equipment and storage medium
CN112925560A (en) * 2021-03-15 2021-06-08 云南大学 Declarative EFSA inference algorithm and method for declaring kTails and Synoptic
CN112925560B (en) * 2021-03-15 2023-12-01 云南大学 Declarative EFSA inference algorithm and method for declarating kTails and Synoptic
CN113778381A (en) * 2021-08-14 2021-12-10 西安电子科技大学 PPTL (Power Point Label) standard mining system and method
CN113726821A (en) * 2021-11-02 2021-11-30 华东交通大学 Verification method and system for security protocol formalization

Similar Documents

Publication Publication Date Title
US11775637B2 (en) Recurrent neural network based anomaly detection
CN106886417A (en) A kind of universal parallel method for digging of linear temporal specification
WO2019075390A1 (en) Blackbox matching engine
CN109144882A (en) A kind of software fault positioning method and device based on program invariants
CN107111544A (en) History controlling stream visualization in production diagnosis
CN106919555A (en) The system and method that the field of the data for being included in log stream is extracted
US8380654B2 (en) General market prediction using position specification language
CN104598218B (en) For merging and reusing the method and system of gateway information
Kirbas et al. The relationship between evolutionary coupling and defects in large industrial software
CN110674360B (en) Tracing method and system for data
CN108763091A (en) Method, apparatus and system for regression test
CN109918296A (en) Automatic software test method and device
CN105446705A (en) Method and device used for determining configuration file feature
CN103886092A (en) Method and device for providing terminal failure problem solutions
WEI et al. Software defect prediction via deep belief network
CN106970791A (en) A kind of universal parallel digging system of linear temporal specification
Rathee et al. Clustering for software remodularization by using structural, conceptual and evolutionary features
Xu et al. A GitHub-based data collection method for software defect prediction
CN113596043B (en) Attack detection method, attack detection device, storage medium and electronic device
Sotgiu et al. Explainability-based debugging of machine learning for vulnerability discovery
CN117235745B (en) Deep learning-based industrial control vulnerability mining method, system, equipment and storage medium
Khan et al. Analysis of tree-family machine learning techniques for risk prediction in software requirements
CN106681909A (en) Online transaction fault locating method and device
CN108875374A (en) Malice PDF detection method and device based on document node type
CN112464237B (en) Static code security diagnosis method and device

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20170623