[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Signature symbols in this unit

Symbol Specification Kind Type
# .Node-heapfheap → nat
# .list-dataflist → nat
. 'listfelem → list
. + .nat-basicfnat × nat → nat
. + .list-datafelem × list → list
. + .listflist × list → list
. + .listflist × elem → list
. ++ .list-dupflist × elem → list
. +1nat-basicfnat → nat
. +2 .listfelem × elem → list
. - .natpfnat × nat → nat with λ n, m. n ≥ m
. -- .Node-heapfheap × Ref → heap
. -1nat-basicpfnat → nat with λ n. n ≠ 0
. .butlastlist-lastpflist → list with λ x. x ≠ []
. .deqIDNodefNode → OptTid
. .deqID:= .NodefNode × OptTid → Node
. .gstateDQfDQState → DQGState
. .gstate:= .DQfDQState × DQGState → DQState
. .headlist-datapflist → elem with λ x. x ≠ []
. .ivalDQfDQLState → elem
. .ival:= .DQfDQLState × elem → DQLState
. .lastlist-lastpflist → elem with λ x. x ≠ []
. .lsfDQfDQState → Tid → DQLState
. .lsf:= .DQfDQState × (Tid → DQLState) → DQState
. .nextNodefNode → Ref
. .next:= .NodefNode × Ref → Node
. .obsEmptyDQpDQLState
. .obsEmpty:= .DQfDQLState × bool → DQLState
. .optvalDQfDQLState → OptElem
. .optvalDQpfDQAction → OptElem with λ a. ∃ tid, optval. a = RetDeq(tid, optval)
. .optvalabsActionpfabsAction → OptElem with λ aa. ∃ tid, optval. aa = ResDEQ(tid, optval)
. .optval:= .DQfDQLState × OptElem → DQLState
. .ovalDQfDQLState → OptElem
. .oval:= .DQfDQLState × OptElem → DQLState
. .pcfDQfDQState → Tid → DQPC
. .pcf:= .DQfDQState × (Tid → DQPC) → DQState
. .queueDQfDQGState → list
. .queue:= .DQfDQGState × list → DQGState
. .taillist-datapflist → list with λ x. x ≠ []
. .tidDQfDQLState → Tid
. .tidopttidpfOptTid → Tid with λ opttid. weak?(opttid) ∨ some?(opttid)
. .tidDQpfDQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalCrash
. .tidabsActionpfabsAction → Tid with λ aa. aa ≠ globalCRASH ∧ aa ≠ τ
. .tid:= .DQfDQLState × Tid → DQLState
. .tid:= .opttidpfOptTid × Tid → OptTid with λ opttid, tid. weak?(opttid) ∨ some?(opttid)
. .valNodefNode → elem
. .valoptelempfOptElem → elem with λ optval. optval ≠ Empty
. .valDQpfDQAction → elem with λ a. ∃ tid, val. a = InvEnq(tid, val)
. .valabsActionpfabsAction → elem with λ aa. ∃ tid, val. aa = InvENQ(tid, val)
. .val:= .NodefNode × elem → Node
. .valueDQfDQLState → elem
. .value:= .DQfDQLState × elem → DQLState
. < .nat-basicpnat × nat
. < .list-dataplist × list
. > .natpnat × nat
. [ . ]Node-heapfheap × Ref × Node → heap
. [ . ]Node-heappfheap × Ref → Node with λ st, a. a ∈ st
. ∈ .Node-heappRef × heap
. ∈ .listpelem × list
. ≤ .natpnat × nat
. ≥ .natpnat × nat
. ⊆ .Node-heappheap × heap
. ⊑ .list-lastplist × list
. ⊒ .list-lastplist × list
[]list-dataclist
τDQcDQAction
τabsActioncabsAction
∅Node-heapcheap
CHECKEMPDQprlist : bool
CallRUNabsActionfTid → absAction
CheckEmpDQfTid → DQAction
CrashDQpr : (Tid → DQPC)
DODEQDQpr : OptElem × list
DODEQEMPTYDQprbool : OptElem
DOENQDQprelem : list
DQActionDQs
DQGInvDQpDQGState
DQGStateDQs
DQInvDQpDQGState × (Tid → DQLState) × (Tid → DQPC)
DQLInvDQpDQGState × DQLState × DQPC
DQLStateDQs
DQPCDQs
DQStateDQs
DQstepDQpDQState × DQAction × DQState
DoDeqDQfTid → DQAction
DoDeqEmptyDQfTid → DQAction
DoEnqDQfTid → DQAction
EmptyoptelemcOptElem
INVDEQDQpr : bool
INVENQDQprelem : elem
InvDEQabsActionfTid → absAction
InvDeqDQfTid → DQAction
InvENQabsActionfTid × elem → absAction
InvEnqDQfTid × elem → DQAction
NodeNodes
NoneopttidcOptTid
OptElemoptelems
OptTidopttids
RETDEQDQprOptElem : : OptElem
RETENQDQpr :
RefRefs
ResDEQabsActionfTid × OptElem → absAction
ResENQabsActionfTid → absAction
RetDeqDQfTid × OptElem → DQAction
RetEnqDQfTid → DQAction
RunDQpr :
SomeopttidfTid → OptTid
Tidtids
Valoptelemfelem → OptElem
WeakopttidfTid → OptTid
aabsaabsfDQAction → absAction
absActionabsActions
butlastnlist-lastpfnat × list → list with λ n, x. n ≤ # x
callRunDQfTid → DQAction
crashedDQcDQPC
disjlist-dupplist × list
dummytidtidcTid
dupslist-dupplist
elemelems
fillfirstlist-lastfnat × elem × list → list
globalCRASHabsActioncabsAction
globalCrashDQcDQAction
gstepfDQfDQGState × DQLState × DQPC × DQAction → DQGState
heapNode-heaps
idleDQcDQPC
invDeqDQcDQPC
invEnqDQcDQPC
listlist-datas
lstepDQpDQGState × DQLState × DQPC × DQAction × DQGState × DQLState × DQPC
lstepfDQfDQGState × DQLState × DQPC × DQAction → DQLState
mkNodefelem × OptTid × Ref → Node
mkgsDQflist → DQGState
mklistlist-lastfelem × nat → list
mklsDQfTid × bool × elem × OptElem × elem × OptElem → DQLState
mkstateDQfDQGState × (Tid → DQLState) × (Tid → DQPC) → DQState
natnat-basics
nullRefcRef
optvalaabsvOptElem
pcstepfDQfDQGState × DQLState × DQPC × DQAction → DQPC
preDQpDQGState × DQLState × DQPC × DQAction
readyDQcDQPC
resDeqDQcDQPC
resEnqDQcDQPC
revlist-lastflist → list
rmduplist-dupflist → list
some?opttidpOptTid
tidaabsvTid
valaabsvelem
weak?opttidpOptTid