CN106959890B - System is verified based on the interruption for weighting lower pushing system - Google Patents
System is verified based on the interruption for weighting lower pushing system Download PDFInfo
- Publication number
- CN106959890B CN106959890B CN201710139023.4A CN201710139023A CN106959890B CN 106959890 B CN106959890 B CN 106959890B CN 201710139023 A CN201710139023 A CN 201710139023A CN 106959890 B CN106959890 B CN 106959890B
- Authority
- CN
- China
- Prior art keywords
- pattern
- weighting
- interruption
- pushing system
- lower pushing
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
- G06F9/4831—Task transfer initiation or dispatching by interrupt, e.g. masked with variable priority
Abstract
System is verified based on the interruption for weighting lower pushing system the invention discloses a kind of, which includes object code modeling module, reachable pattern acquisition module, up to pattern spider module, current pattern backtracking module, result output module.The interruption of real-time system can be verified the pushing system under weighting and combined by system of the invention, verified in a manner of formalization to real-time system interruption, improved the reliability and robustness of verifying；Verifying simultaneously has high efficiency, while also saving cost in relation to the sequential logic, Priority Inversion, memory access conflict and the timeout issue that interrupt under the same model.
Description
Technical field
The invention belongs to the static analysis of program and model testing fields, are related to a kind of based in pushing system under weighting
Disconnected verification technique.
Background technique
With the rapid development of computer and mobile Internet, embedded real time system is widely used in various industries:
The various industries such as manufacture, medical treatment, traffic and communication all have close ties with embedded real time system.It is calculated relative to common
Machine system, embedded real time system have higher requirement for reliability, especially when a real time system application is concerning life
When the field of life, any unreliable factor or certain hard real-time tasks are more than the regulation time limit, all may cause it is difficult to predict it is tight
Weight consequence.In embedded real time system, in order to interact system with external environment in time, people are introduced
" interrupt mechanism ": interruption is a pith of real-time system, and when there is demand, it temporarily ceases processor
The program for going to execute processing new situation is transferred in the execution of present procedure.However, interrupt the randomness generated and it is uncertain can be to being
The memory safety of system and time safety etc. generate no small hidden danger.And by the technology of formalization method to the correlation of interruption
Property carries out research verifying, not only ensure that the normal operation of interrupt mechanism, but also the safety that can also improve such system refers to
Mark.
Have some verification methods for this problem both at home and abroad at present, but can not all be verified with the same method related
The major issue of interruption, for example describe to have using break period automatic machine (Interrupt TimedAutomata, ITA)
Real-time system is converted to break period automatic machine by the multitask system of interruption, is verified by carrying out approachability analysis to ITA
Whether system meets certain or certain several property, but when system is excessively huge, the break period automatic machine changed into can be produced
The relevant issues such as raw state explosion；By adding the controlling stream graph of color, for carrying out static check to the software for interrupting driving,
Length and type and the deadline of execution time mainly for stack are analyzed.And pass through abstract middle off line (The
Abstract Interrupt Machine, AIM), by program abstraction to one layer of thread, regard simultaneously operating as atomic operation,
The interaction before program interrupt processing and sequence non-process code is described using abstract middle off line, passes through the rule in programmed logic
Model language to determine whether exist interrupt caused by relevant issues, by AIM can solve shared resource access conflict and
The problems such as storehouse caused by interruption, memory overflow.
Summary of the invention
In view of the above problems, the object of the present invention is to provide system is verified based on the interruption for weighting lower pushing system, by program
Object code is converted to the lower pushing system of weighting, finds out the reachable pattern for weighting lower pushing system, then basis is up to pattern to program
It is analyzed, sequential logic, Priority Inversion, memory access conflict and timeout issue is carried out for the reachable pattern found out
Verifying.
In order to achieve the above object, and solving the problems, such as to interrupt several classes present in the embedded real time system of driving, this hair
It is bright to adopt the technical scheme that: a kind of that system is verified based on the interruption for weighting lower pushing system, comprising:
Object code modeling module: it is used to extract the object code for needing the program for the different task verified, by its turn
It is changed to the lower pushing system of weighting；
Obtain module up to pattern: it is used for according to the accessibility algorithm of pushing system under the weighting and the demand of problem
Pre weighting automatic machine or Post weighting automatic machine are calculated, Pre weights automatic machine or Post weights the acceptable language of automatic machine
As up to pattern；
Up to pattern spider module: its all reachable pattern for being used to traverse acquisition, during traversal, judgement is worked as
Whether preceding pattern information meets verifying demand property, if conditions are not met, interpretation type of error, jumps to current pattern backtracking mould
Block returns correctly if having traversed all patterns is all satisfied verifying demand property, then jumps to result output module；
Current pattern backtracking module: it is used to be recalled according to current pattern, finds out verifying property needed for being unsatisfactory for
Path, provide the program be unsatisfactory for verifying demand property as a result, and provide counter-example path, algorithm terminates；
As a result output module: it is used to provide the result that described program meets verifying demand property.
Preferably, pushing system includes triple W=(P, S, f) under the weighting, and wherein P=(P, Γ, Δ) is pushed away under being is
System,For bounded Idempotent Semirings, f: Δ → D is that push rule is mapped to weight.
Preferably, in the lower pushing system P=(P, Γ, Δ), P is limited control location sets, and Γ is limited stack
Character set, Δ are limited the form of the aggregation rules of migration rules are as follows:<p,v→q,w>, wherein (p, v, q, w) ∈ Δ.
Preferably, the bounded Idempotent SemiringsIn, D is weight sets, 0,1 ∈ D,For on D
Dual operation:
1)(D,) be with 0 for neutral element tradable semigroup, andIt is idempotent；
2) (D,) be with 1 for neutral element semigroup；
3)It is rightIt can distribute, i.e., have for all a, b, c ∈ D
4) 0 isThe annihilator of operation, i.e., for all a ∈ D,
5) partial ordering relation < is defined as on DB ∈ D, a < b is and if only if a ⊕ b=a, and there is no infinite under this relationship
Descending chain.
Preferably, can the accessibility from initial lattice including a given initial configuration and a target pattern, judgement
Office sets out, and reaches target pattern by the pattern migration of limited step.
Preferably, the Pre weighting automatic machine is to receive all pre that can be reached from current pattern up to pattern
Automatic machine, all pre up to pattern be it is all can pass through the pattern of limited step migration reach the pattern pattern set.
Preferably, the Post weighting automatic machine is to receive all post that can be reached from current pattern up to lattice
The automatic machine of office, all post are up to the pattern set that pattern is that the pattern can be reached by the pattern migration of limited step.
Preferably, whether meet defined sequential logic when the verifying demand property includes: the operation of 1. programs；2. journey
Whether sequence will appear because interrupting the case where generating Priority Inversion, i.e., the low task of priority can interrupt the high task of priority
And its subtask；3. whether program operation meets real-time, a certain task can be completed before the deadline；4. program is transported
Whether have when row because interrupting the memory access conflict generated.
The beneficial effect comprise that
1. by the interruption verifying of real-time system, pushing system is combined under weighting, in real-time system in a manner of formalization
It is disconnected to be verified, improve the reliability and robustness of verifying.
2. verified simultaneously under the same model sequential logic of related interruption, Priority Inversion, memory access conflict and
Timeout issue has high efficiency, while also saving cost.
Detailed description of the invention
Fig. 1 is that the present invention is based on the frame diagrams for the interruption verification method for weighting lower pushing system；
Fig. 2 is the step of the present invention is based on the interruption verification methods for weighting lower pushing system figure；
Fig. 3 is the algorithm pattern that pre automatic machine is solved in the present invention；
Fig. 4 is the algorithm pattern that post automatic machine is solved in the present invention；
Fig. 5 is using the present invention is based on the frame diagrams for interrupting verification method verifying timeout issue for weighting lower pushing system.
Fig. 6 is the frame diagram based on the interruption verifying system for weighting lower pushing system.
Specific embodiment
In conjunction with attached drawing in detail below, the present invention is described in further detail.Implement process of the invention, condition etc.,
In addition to what is specifically mentioned below, it is among the general principles and common general knowledge in the art, the present invention is not particularly limited interior
Hold.
The purpose of the present invention is combining the interruption verifying of embedded real time system with the lower pushing system of weighting, will be in real time
The object code of system is modeled as weighting lower pushing system model, information needed is added in model, under the same model simultaneously
Verify a few class major issues in relation to interrupting.
The invention discloses a kind of based on the interruption verification method for weighting lower pushing system, and this method is using pushing system under weighting
Come indicate in embedded real time system in relation to interrupt object code between jump relationship, pass through what is be modeled as to object code
It weights lower pushing system and carries out approachability analysis, to judge whether the interruption of system meets safety and reliability.
As shown in Figure 1, the bright interruption verification method based on pushing system under weighting of we includes: first according to program object
The relationship that jumps instructed in code is modeled as weighting lower pushing system, in this process, precedence information is pressed into one
Storehouse, then by weighting the accessibility algorithm of lower pushing system, obtains all reachable lattice using instruction cycle information as weight
Office；Finally traverse resulting reachable pattern, judge current pattern information whether meet demand, if conditions are not met, then judging incorrectly
Type returns to erroneous path, if having traversed all reachable patterns does not find mistake, returns correct.
As shown in Fig. 2, proposed by the present invention described based on the interruption verification method for weighting lower pushing system, specific steps are as follows:
Step 1: extracting the object code for needing the program verified, be converted into the lower pushing system of weighting；Preferably, at this
In step, the object code for needing the program for the different task verified is extracted, is the object code of the program of the different task
Precedence information and instruction cycle information are added respectively, i.e., precedence information are pressed into a storehouse, by instruction cycle information
As weight, the object code is modeled as pushing away under weighting it is according to the relationship that jumps instructed in described program object code
System；
Step 2: according to the demand of the accessibility algorithm and problem that weight lower pushing system calculate Pre weighting automatic machine or
Post weights automatic machine, and the acceptable language of weighting automatic machine is constituted up to pattern；
Step 3: the reachable pattern that traversal step 2 obtains judges whether traversed pattern meets during traversal
The property of required verifying, if the completely rear all patterns of traversal are all satisfied property, carries out step if not satisfied, then carrying out step 4
5；
Step 4: being recalled according to current pattern, find out the path of verifying property needed for being unsatisfactory for, provide the program not
Meet demand property as a result, and provide counter-example path, algorithm terminates；
Step 5: providing the result of the program meet demand property.
The lower pushing system is in P=(P, Γ, Δ), and P is limited control location sets, and Γ is limited stack character set
It closes, Δ is limited the form of the aggregation rules of migration rules are as follows:<p,v→q,w>, wherein (p, v, q, w) ∈ Δ.
The bounded Idempotent Semirings areIn, D is weight sets, 0,1 ∈ D,For the binary on D
Operation:
1)(D,) be with 0 for neutral element tradable semigroup, andIt is idempotent (for example, for all a
∈ D,)；
2) (D,) be with 1 for neutral element semigroup；
3)It is rightIt can distribute, i.e., have for all a, b, c ∈ D
4) 0 isThe annihilator of operation, i.e., for all a ∈ D,
5) partial ordering relation < is defined as on DB ∈ D, a < b and if only ifThere is no infinite under this relationship
Descending chain.
Can the accessibility is defined as a given initial configuration and a target pattern, judgement go out from initial configuration
Hair reaches target pattern by the pattern migration of limited step.
The Pre weighting automatic machine is to receive all pre that can be reached from current pattern up to the automatic of pattern
Machine.
The pre is defined as all pattern collection that the arrival pattern can be migrated by the pattern of limited step up to pattern
It closes.
As shown in figure 3, proposed by the present invention described based in the interruption verification method for weighting lower pushing system, the Pre adds
Weigh automatic machine method for solving the following steps are included:
1. weighted input system W=(P, S, f), wherein P=(P, Γ, Δ),And it can receive
The automatic machine A=(Q, Γ, → 0, P, F) of initial configuration set C；
2. initialization → :=→ 0；Workset:=→ 0；T.0, wherein t.0 λ indicates null element in S to l:=λ；For all t
∈ → 0, to l (t) :=1, for strictly all rules in ΔIt is update (p, γ, p '), f (r))；
3. checking whether workset is sky, if it is sky, carries out step 5, otherwise carries out step 4；
4. selecting migration t=(q, γ, q ') from workset, and it is moved out workset, to rule all in Δ
Then it isBe update ((p1, γ 1, q '),)；It is to strictly all rules in ΔIn all t '=(q ', γ 2, q ") ∈ → be update ((p1, γ 1, q "),)；It is for strictly all rules in Δ In meet t '=(p ', γ 2,
Q) ∈ → be update ((p1, γ 1, q '), ), return step 3；
5. returning to Pre weighting automatic machine A=(Q, Γ, → 0, P, F).
Post weighting automatic machine be receive all post that can be reached from current pattern up to pattern oneself
Motivation.
The post is defined as the pattern up to pattern and migrates the pattern set that can be reached by the pattern of limited step.
As shown in figure 4, proposed by the present invention described based in the interruption verification method for weighting lower pushing system, the Post adds
Weigh automatic machine method for solving the following steps are included:
The verifying property are as follows: whether 1. programs meet defined sequential logic when running；2. whether program will appear
Because interrupting the case where generating Priority Inversion, i.e., the low task of priority can interrupt the high task of priority and its subtask；
3. whether program operation meets real-time, a certain task can be completed before the deadline；4. whether program has when running
Because interrupting the memory access conflict generated.
It specifically tells about below of the present invention based on the interruption verification method for weighting lower pushing system.
Embodiment 1
The present embodiment is that the present invention is based on the interruption verification method verifying object code time-out for weighting lower pushing system with application
For problem.
Fig. 5 is using the present invention is based on the frame diagrams for interrupting verification method verifying timeout issue for weighting lower pushing system.It tests
The specific steps of card are as follows:
1. the object code verified as needed is converted into across process control flow graph (Interprocedural
Control Graph,ICFG)；
2. finding out the supremum of each circulation in ICFG, when being converted to WPDS, supremum time is done to the circulation
WeightOperation；
3. the object code verified as needed will be in bounded Idempotent Semirings using its instruction cycle as weight
OperatorIt is defined as being minimized, by operatorBe defined as the addition that counts, identical element 1 is defined as it is infinite, by zero
Member 0 is defined as integer 1；
4. information required by 2,3 obtains the lower pushing system of weighting according to step 1；
Automatic machine is weighted 5. finding out according to the algorithm of Fig. 4 and weighting the Post of lower pushing system, and is obtained according to it all reachable
Pattern；
6. finding out the weight in required path according to up to pattern, i.e., with of the present invention based in pushing system under weighting
The target code run-time that disconnected verification method is found out；
7. judging whether required target code run-time is less than the stipulated time, if it is less, carrying out step 8, otherwise
Carry out step 9；
8. system has not timed out, returns and meet verifying requirement.
9. system is overtime, migration path is recalled, return to counter-example path.
In addition, as shown in fig. 6, verifying system based on the interruption for weighting lower pushing system invention additionally discloses a kind of, comprising:
Object code modeling module: it is used to extract the object code for needing the program for the different task verified, by its turn
It is changed to the lower pushing system of weighting；
Obtain module up to pattern: it is used for according to the accessibility algorithm of pushing system under the weighting and the demand of problem
Pre weighting automatic machine or Post weighting automatic machine are calculated, Pre weights automatic machine or Post weights the acceptable language of automatic machine
As up to pattern；
Up to pattern spider module: its all reachable pattern for being used to traverse acquisition, during traversal, judgement is worked as
Whether preceding pattern information meets verifying demand property, if conditions are not met, interpretation type of error, jumps to current pattern backtracking mould
Block returns correctly if having traversed all patterns is all satisfied verifying demand property, then jumps to result output module；
Current pattern backtracking module: it is used to be recalled according to current pattern, finds out verifying property needed for being unsatisfactory for
Path, provide the program be unsatisfactory for verifying demand property as a result, and provide counter-example path, algorithm terminates；
As a result output module: it is used to provide the result that described program meets verifying demand property.
In a preferred embodiment, object code modeling module includes: for extracting the different task for needing to verify
Program object code, add precedence information and instruction cycle respectively for the object code of program of the different task
The object code is modeled as weighting lower pushing system by information according to the relationship that jumps instructed in described program object code.
In a preferred embodiment, obtaining module up to pattern includes: for according to pushing system under the weighting
The demand of accessibility algorithm and problem calculates Pre weighting automatic machine or Post weighting automatic machine, and obtains all reachable
Pattern.
In above-mentioned interruption verifying system, pushing system includes triple W=(P, S, f) under the weighting, wherein P=
(P, Γ, Δ) is lower pushing system,For bounded Idempotent Semirings, f: Δ → D is to be mapped to push rule
Weight.
In the lower pushing system P=(P, Γ, Δ), P is limited control location sets, and Γ is limited stack character set
It closes, Δ is limited the form of the aggregation rules of migration rules are as follows:<p,v→q,w>, wherein (p, v, q, w) ∈ Δ.
The bounded Idempotent SemiringsIn, D is weight sets, 0,1 ∈ D,For the binary behaviour on D
Make:
1)(D,) be with 0 for neutral element tradable semigroup, andIt is idempotent；
2) (D,) be with 1 for neutral element semigroup；
3)It is rightIt can distribute, i.e., have for all a, b, c ∈ D
4) 0 isThe annihilator of operation, i.e., for all a ∈ D,
5) partial ordering relation < is defined as on DB ∈ D, a < b and if only ifThere is no infinite under this relationship
Descending chain.
The accessibility includes a given initial configuration and a target pattern, judgement can from initial configuration,
Target pattern is reached by the pattern migration of limited step.
Pre weighting automatic machine include receive all pre that can be reached from current pattern up to pattern from
Motivation, all pre are defined as all pattern set that the arrival pattern can be migrated by the pattern of limited step up to pattern.
Proposed by the present invention described based in the interruption verifying system for weighting lower pushing system, the Pre weights automatic machine
It calculates to solve to use and be realized with lower module:
1. weighted input system W=(P, S, f) of module, wherein P=(P, Γ, Δ),And it can be with
Receive the automatic machine A=(Q, Γ, → 0, P, F) of initial configuration set C；
The initialization of module 2. → :=→ 0；Workset:=→ 0；T.0, wherein t.0 λ indicates null element in S to l:=λ；
For all ∈ → 0 t, to l (t) :=1, for strictly all rules in ΔIt is update
(p,γ,p'),f(r))；
Module 3. checks whether workset is sky, if it is sky, carries out step 5, otherwise carries out step 4；
Module 4. selects a migration t=(q, γ, q ') from workset, and is moved out workset, to institute in Δ
It is regular to beBe update ((p1, γ 1, q '),)；It is to strictly all rules in ΔIn all t '=(q ', γ 2, q ") ∈ → be update ((p1, γ 1, q "),)；It is for strictly all rules in Δ In meet t '=(p ', γ 2,
Q) ∈ → be update ((p1, γ 1, q '), ), return step 3；
Module 5. returns to Pre weighting automatic machine A=(Q, Γ, → 0, P, F).
The Post weighting automatic machine includes receiving all post that can be reached from current pattern up to pattern
Automatic machine, all post are defined as the pattern up to pattern and migrate the pattern set that can be reached by the pattern of limited step.
Proposed by the present invention described based in the interruption verifying system for weighting lower pushing system, the Post weights automatic machine
It calculates to solve to use and be realized with lower module:
Whether the verifying demand property of the system meets defined sequential logic when including: the operation of 1. programs；2. program is
It is no will appear because interrupt generate Priority Inversion the case where, i.e., the low task of priority can interrupt the high task of priority and its
Subtask；3. whether program operation meets real-time, a certain task can be completed before the deadline；4. program is run
Whether have because interrupting the memory access conflict generated.
It should state, just for illustrating for possible embodiments of the present invention, the embodiment is not to limit
The scope of the patents of the invention is made, the present invention should include but are not limited to above-mentioned detailed description and specific example.The present invention should include core
All adjustment and modification, all equivalence enforcements or change without departing from carried out by the present invention in heart context, are intended to be limited solely by this
In the scope of the patents of case.
Claims (6)
1. a kind of verify system based on the interruption for weighting lower pushing system characterized by comprising
Object code modeling module: it is used to extract the object code for needing the program for the different task verified, and is converted into
Weight lower pushing system；
Obtain module up to pattern: it is used to be calculated according to the accessibility algorithm of pushing system under the weighting and the demand of problem
Pre weights automatic machine out or Post weights automatic machine, and Pre weights automatic machine or Post weights the acceptable language conduct of automatic machine
Up to pattern；
Up to pattern spider module: its all reachable pattern for being used to traverse acquisition judges current lattice during traversal
Whether office's information meets verifying demand property, if conditions are not met, interpretation type of error, jumps to current pattern backtracking module, if
It has traversed all patterns and has been all satisfied verifying demand property, returned correctly, then jump to result output module；
Current pattern backtracking module: it is used to be recalled according to current pattern, finds out the path of verifying property needed for being unsatisfactory for,
Provide the program be unsatisfactory for verifying demand property as a result, and provide counter-example path, algorithm terminates；
As a result output module: it is used to provide the result that described program meets verifying demand property.
2. according to claim 1 verify system based on the interruption for weighting lower pushing system, which is characterized in that under the weighting
Pushing system includes triple W=(P, S, f), and wherein P=(P, Γ, Δ) is lower pushing system, For bounded
Idempotent Semirings, f: Δ → D is that push rule is mapped to weight；
In the lower pushing system P=(P, Γ, Δ), P is limited control location sets, and Γ is limited stack character set, Δ
It is limited the form of the aggregation rules of migration rules are as follows:<p,v→q,w>, wherein (p, v, q, w) ∈ Δ；
The bounded Idempotent SemiringsIn, D is weight sets, 0,1 ∈ D, For the dual operation on D:
1)For with 0 for neutral element tradable semigroup, andIt is idempotent；
2)For with 1 for neutral element semigroup；
3)It is rightIt can distribute, i.e., have for all a, b, c ∈ D
4) 0 isThe annihilator of operation, i.e., for all a ∈ D,
5) partial ordering relation < is defined as on DB ∈ D, a < b and if only ifInfinite descending sequence is not present under this relationship.
3. according to claim 1 verify system based on the interruption for weighting lower pushing system, which is characterized in that the accessibility
It can be moved from initial configuration by the pattern of limited step including a given initial configuration and a target pattern, judgement
It moves on to up to target pattern.
4. according to claim 1 verify system based on the interruption for weighting lower pushing system, which is characterized in that the Pre adds
Power automatic machine is to receive all pre that can be reached from current pattern up to the automatic machine of pattern, and all pre are up to pattern
For all pattern set that can migrate the arrival pattern by the pattern of limited step.
5. according to claim 1 verify system based on the interruption for weighting lower pushing system, which is characterized in that the Post adds
Power automatic machine is to receive all post that can be reached from current pattern up to the automatic machine of pattern, and all post are up to lattice
Office is the pattern set that the pattern can be reached by the pattern migration of limited step.
6. according to claim 1 verify system based on the interruption for weighting lower pushing system, which is characterized in that the verifying
Demand property includes:
1) whether meet defined sequential logic when program is run；
2) whether program will appear because interrupting the case where generating Priority Inversion, i.e. the low task of priority can interrupt priority
High task and its subtask；
3) whether program operation meets real-time, can complete a certain task before the deadline；
4) whether have when program is run because interrupting the memory access conflict generated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710139023.4A CN106959890B (en) | 2017-03-09 | 2017-03-09 | System is verified based on the interruption for weighting lower pushing system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710139023.4A CN106959890B (en) | 2017-03-09 | 2017-03-09 | System is verified based on the interruption for weighting lower pushing system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106959890A CN106959890A (en) | 2017-07-18 |
| CN106959890B true CN106959890B (en) | 2019-06-14 |
Family
ID=59471266
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710139023.4A Active CN106959890B (en) | 2017-03-09 | 2017-03-09 | System is verified based on the interruption for weighting lower pushing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106959890B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104503837A (en) * | 2015-01-15 | 2015-04-08 | 南京大学 | Method for bounded model checking of interrupt-driven system based on partial order reduction |
| CN104699620A (en) * | 2015-04-01 | 2015-06-10 | 山东华芯半导体有限公司 | System and method for accelerating chip interrupt controller verification |
| CN105183552A (en) * | 2015-09-25 | 2015-12-23 | 东华大学 | System for positioning potential interruption safety hazard in operation system and application of system |
-
2017
- 2017-03-09 CN CN201710139023.4A patent/CN106959890B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104503837A (en) * | 2015-01-15 | 2015-04-08 | 南京大学 | Method for bounded model checking of interrupt-driven system based on partial order reduction |
| CN104699620A (en) * | 2015-04-01 | 2015-06-10 | 山东华芯半导体有限公司 | System and method for accelerating chip interrupt controller verification |
| CN105183552A (en) * | 2015-09-25 | 2015-12-23 | 东华大学 | System for positioning potential interruption safety hazard in operation system and application of system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106959890A (en) | 2017-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wen et al. | Correct-by-synthesis reinforcement learning with temporal logic constraints | |
| CN112433819A (en) | Heterogeneous cluster scheduling simulation method and device, computer equipment and storage medium | |
| CN107016175A (en) | It is applicable the Automation Design method, device and the optimization method of neural network processor | |
| CN106940659B (en) | Interruption verification method based on the lower pushing system of weighting | |
| CN110263988A (en) | A kind of data run optimization method based on power plant desulphurization system | |
| CN106095654A (en) | Performance verification device, the system with performance verification device and method | |
| CN105302719B (en) | A kind of mutation testing method and device | |
| CN106021816B (en) | A kind of implementation method of the distributed system behavior simulation analysis tool of Behavior-based control tree | |
| CN103885826B (en) | Real-time task scheduling implementation method of multi-core embedded system | |
| CN106411635A (en) | Formal analysis and verification method for real-time protocol | |
| CN101853201A (en) | Software parallel test method and tool based on coloring petri net | |
| CN109684190A (en) | Software testing device and method | |
| CN103065166A (en) | Open type frequency identification device (RFID) experiment platform and tag | |
| WO2022188895A1 (en) | Det and relap5 coupled dynamic characteristic analysis method based on universal auxiliary variable method | |
| CN106446341A (en) | Process algebra-based real-time protocol analysis and verification system | |
| CN102663191B (en) | SAT (satisfiability) based method for bounded model checking (BMC) for propositional projection temporal logic (PPTL) | |
| CN102780583A (en) | Method for service description, service combination and service quality assessment of Internet of Things | |
| CN104267936B (en) | Based on network analysis method of reachability of being pushed net under the semantic asynchronous dynamical of tree | |
| CN105373424A (en) | Speculative multithreading division method based on machine learning | |
| CN103294482B (en) | Web service method for packing and system for PWscf concurrent computational system | |
| CN108769105A (en) | A kind of scheduling system of knowledge services multi-task scheduling optimization method and its structure under cloud environment | |
| Wu et al. | A heuristic speculative execution strategy in heterogeneous distributed environments | |
| CN106959890B (en) | System is verified based on the interruption for weighting lower pushing system | |
| CN113168552A (en) | Artificial intelligence application development system, computer device and storage medium | |
| JP2012509546A (en) | Method and data processing system for simulating embedded systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210806 Address after: Room 801, no.6, Lane 600, Yunling West Road, Putuo District, Shanghai 200062 Patentee after: SHANGHAI FORMAL TECH INFORMATION TECHNOLOGY Co.,Ltd. Address before: 200062 Putuo District, Shanghai No. 3663, Zhongshan North Road, Putuo District, Shanghai Patentee before: EAST CHINA NORMAL University Patentee before: SHANGHAI FORMAL TECH INFORMATION TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |