Formal Models of Operating System Kernels phần 2 pps
Formal Models of Operating System Kernels phần 2 pps
... prop- erty is immediate (the proof is omitted): Proposition 32. The formulæ: ∀ q 1 , q 2 : ProcessQueue • q 1 ⊗ q 2 or: ∀ q 1 , q 2 : ProcessQueue • Catenate[q 1 /q 1 ?, q 2 /q 2 ?] yield a queue with ... performed, the inclusion of IdleProcRef and the ex- clusion of NullProcRef are of some importance. They determine the range of possible values for the domains of the comp...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 5 pps
... representable by the hardware (2 32 − 1 on a 32- bit machine); conversely, the highest possible priority would be the most negative integer representable by the hardware ( 2 32 on a 32- bit machine). 3.4 ... an idea of some of the other things that might need to be handled during termination). If a process is on disk when it is terminated (say, because of system ter- mination or b...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 10 pot
... 22 7 genNextTick 22 6 putDriverToSleep 184 updateSwapperTimes 184, 22 6 CLOCKISR: INIT 177, 22 5 ServiceISR 177, 22 5 Context: INIT 69, 127 , 21 0 RestoreState 69, 128 , 21 2 SaveState 69, 128 , 21 1 SwapIn 69, 129 , 21 2 SwapOut ... number, 24 2, 29 7 mainstore attribute, 25 3 map, 24 3 mapping, 24 0 marking, 24 4 null, 24 3 page fault driver, 24 0 page number logical, 24 2...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 9 potx
... counter are: BIT == {0, 1} N 25 6 == 0 25 5 (N 25 6 is just the naturals 0 2 16 − 1—i.e., a 16-bit unsigned.) The computation of the counter value forms part of the predicate of schema ComputeHitCounts. ... N pgallocstart =0 The value of 0 is completely arbitrary, as is now explained. Some systems map a virtual copy of the operating system onto the vir- tual address space...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 8 pot
... of sharedpages(p)(sg), for some p and sg. Proof. Similar to the previous proof. ✷ Proposition 134. IsLockedPage iff lpno? is a locked page; that is, iff lpno? is an element of lockedpages. Proof. ... of segments. (∀ p : APREF | p ∈ dom pagetable • (∀ sg 1 , sg 2 : SEGMENT • (sg 1 = sg 2 ∧ sg 1 ∈ dom pagetable(p) ∧ sg 2 ∈ dom pagetable(p)) ⇒ dom pagetable(p)(sg 1 ) ∩ dom pagetable(p...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 7 doc
... present purposes—the modelling of kernels that are free from things like file systems—the approach adopted here seems quite reasonable. 5.4 Drivers Using Messages 22 5 5.4.1 The Clock To begin the ... prove some fairly general properties of the message-passing system. Proposition 1 12. The message-passing mechanism is synchronous. Proof. By the predicates of SendMessage and RcvMessa...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 6 pptx
... PRIO > P : PRIO ↔ PRIO ∀ p 1 , p 2 : PRIO • p 1 < P p 2 ⇔ (p 1 ≤ P p 2 ) ∧¬(p 1 = P p 2 ) p 1 > P p 2 ⇔ (p 1 ≥ P p 2 ) ∧¬(p 1 = P p 2 ) For completeness, the definitions of these relations are given, ... the priority of p is not recomputed. Proof. Let procs = s 1 p s 2 with #s 1 = n. By Proposition 21 (case 2iii), s 1 = s 1,1 s m s 1 ,2 ,where#s m = m...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 4 pot
... exists a hole of size n 1 + n 2 . Proof. Since h 1 and h 2 are adjacent, they can be merged. The definition of mergememholes is: ∀ h 1 , h 2 : MEMDESC • (lower hole addr(h 1 , h 2 ), memsize(h 1 )+memsize(h 2 )) The ... merging of adjacent free blocks creates a single new block whose size is the sum of all of the merged blocks. Proposition 80. If h 1 and h 2 are adjacent...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 3 ppt
... 1. Case 2. p = head elts. Therefore: ∃ s 1 , s 2 :iseqAPREF • elts = s 1 p s 2 ∧ elts = s 1 s 2 Therefore: #elts = #(s 1 p s 2 )= #s 1 +#p +#s 2 = #s 1 +1+#s 2 = 1+#s 1 +#s 2 = 1+#elts ✷ Proposition ... ⊆ known procs ran childof ⊆ known procs ∧ ran childof = ran parent childof ∼ = parentof ∧ code owners ⊆ dom parentof (∀ p 1 , p 2 : APREF • p 1 ∈ dom bloc...
Ngày tải lên: 23/07/2014, 23:20
Formal Models of Operating System Kernels phần 1 pdf
... Components 17 2. 1 Introduction 17 2. 2 GenericTables 17 2. 3 QueuesandTheirProperties 21 2. 4 HardwareModel 27 2. 4.1 CCS Model 27 2. 4 .2 Registers 29 2. 4.3 InterruptFlag 31 2. 4.4 Timer Interrupts 32 2.4.5 ... Introduction 20 3 5 .2 Requirements 20 4 5.3 Message-PassingPrimitives 20 5 5.4 DriversUsingMessages 22 4 5.4.1 The Clock 22 5 5.5 SwappingUsingMessages 22 8 5....
Ngày tải lên: 23/07/2014, 23:20