[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
. .gstateDurQfDurQState → DurQGState
. .gstateDQfDQState → DQGState
. .gstate:= .DurQfDurQState × DurQGState → DurQState
. .gstate:= .DQfDQState × DQGState → DQState
. .headlist-datapflist → elem with λ x. x ≠ []
. .ivalDurQfDurQLState → elem
. .ivalDQfDQLState → elem
. .ival:= .DurQfDurQLState × elem → DurQLState
. .ival:= .DQfDQLState × elem → DQLState
. .lastlist-lastpflist → elem with λ x. x ≠ []
. .lsfDurQfDurQState → Tid → DurQLState
. .lsfDQfDQState → Tid → DQLState
. .lsf:= .DurQfDurQState × (Tid → DurQLState) → DurQState
. .lsf:= .DQfDQState × (Tid → DQLState) → DQState
. .nextNodefNode → Ref
. .next:= .NodefNode × Ref → Node
. .obsEmptyDQpDQLState
. .obsEmpty:= .DQfDQLState × bool → DQLState
. .optvalDurQfDurQLState → OptElem
. .optvalDQfDQLState → OptElem
. .optvalDurQpfDurQAction → OptElem with λ a. ∃ tid, optval. a = ARetDeq(tid, optval)
. .optvalDQpfDQAction → OptElem with λ a. ∃ tid, optval. a = RetDeq(tid, optval)
. .optval:= .DurQfDurQLState × OptElem → DurQLState
. .optval:= .DQfDQLState × OptElem → DQLState
. .ovalDurQfDurQLState → OptElem
. .ovalDQfDQLState → OptElem
. .oval:= .DurQfDurQLState × OptElem → DurQLState
. .oval:= .DQfDQLState × OptElem → DQLState
. .pcfDurQfDurQState → Tid → DurQPC
. .pcfDQfDQState → Tid → DQPC
. .pcf:= .DurQfDurQState × (Tid → DurQPC) → DurQState
. .pcf:= .DQfDQState × (Tid → DQPC) → DQState
. .queueDurQfDurQGState → list
. .queueDQfDQGState → list
. .queue:= .DurQfDurQGState × list → DurQGState
. .queue:= .DQfDQGState × list → DQGState
. .taillist-datapflist → list with λ x. x ≠ []
. .tidDurQfDurQLState → Tid
. .tidDQfDQLState → Tid
. .tidopttidpfOptTid → Tid with λ opttid. weak?(opttid) ∨ some?(opttid)
. .tidDurQpfDurQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalACrash
. .tidDQpfDQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalCrash
. .tid:= .DurQfDurQLState × Tid → DurQLState
. .tid:= .DQfDQLState × Tid → DQLState
. .tid:= .opttidpfOptTid × Tid → OptTid with λ opttid, tid. weak?(opttid) ∨ some?(opttid)
. .valNodefNode → elem
. .valoptelempfOptElem → elem with λ optval. optval ≠ Empty
. .valDurQpfDurQAction → elem with λ a. ∃ tid, val. a = AInvEnq(tid, val)
. .valDQpfDQAction → elem with λ a. ∃ tid, val. a = InvEnq(tid, val)
. .val:= .NodefNode × elem → Node
. .valueDurQfDurQLState → elem
. .valueDQfDQLState → elem
. .value:= .DurQfDurQLState × elem → DurQLState
. .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
τDurQcDurQAction
τDQcDQAction
∅Node-heapcheap
ACrashDurQpr : (Tid → DurQPC)
ADODEQDurQpr : OptElem × list
ADOENQDurQprelem : list
ADoDeqDurQfTid → DurQAction
ADoEnqDurQfTid → DurQAction
AINVDEQDurQpr :
AINVENQDurQprelem : elem
AInvDeqDurQfTid → DurQAction
AInvEnqDurQfTid × elem → DurQAction
ARETDEQDurQprOptElem : : OptElem
ARETENQDurQpr :
ARetDeqDurQfTid × OptElem → DurQAction
ARetEnqDurQfTid → DurQAction
ARunDurQpr :
CHECKEMPDQprlist : bool
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
DurQActionDurQs
DurQGInvDurQpDurQGState
DurQGStateDurQs
DurQInvDurQpDurQGState × (Tid → DurQLState) × (Tid → DurQPC)
DurQLInvDurQpDurQGState × DurQLState × DurQPC
DurQLStateDurQs
DurQPCDurQs
DurQStateDurQs
DurQstepDurQpDurQState × DurQAction × DurQState
EmptyoptelemcOptElem
INVDEQDQpr : bool
INVENQDQprelem : elem
InvDeqDQfTid → DQAction
InvEnqDQfTid × elem → DQAction
NodeNodes
NoneopttidcOptTid
OptElemoptelems
OptTidopttids
RETDEQDQprOptElem : : OptElem
RETENQDQpr :
RefRefs
RetDeqDQfTid × OptElem → DQAction
RetEnqDQfTid → DQAction
RunDQpr :
SomeopttidfTid → OptTid
Tidtids
Valoptelemfelem → OptElem
WeakopttidfTid → OptTid
agsbwabsvDurQGState
alsbwabsvDurQLState
alsfbwabsvTid → DurQLState
apcfbwabsvTid → DurQPC
butlastnlist-lastpfnat × list → list with λ n, x. n ≤ # x
bwabsbwabspDQState × DurQState
bwabsabwabsfDQAction → DurQAction
bwabspcbwabsp(Tid → DQPC) × (Tid → DQLState) × (Tid → DurQPC) × (Tid → DurQLState)
bwabspcfbwabsfDQPC → DurQPC
bwlabsfbwabsfDQLState → DurQLState
callARunDurQfTid → DurQAction
callRunDQfTid → DQAction
crashedDurQcDurQPC
crashedDQcDQPC
disjlist-dupplist × list
dqsbwabsvDQState
dummytidtidcTid
dupslist-dupplist
durqsbwabsvDurQState
elemelems
fillfirstlist-lastfnat × elem × list → list
globalACrashDurQcDurQAction
globalCrashDQcDQAction
gsbwabsvDQGState
gstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQGState
gstepfDQfDQGState × DQLState × DQPC × DQAction → DQGState
heapNode-heaps
idleDurQcDurQPC
idleDQcDQPC
invDeqDurQcDurQPC
invDeqDQcDQPC
invEnqDurQcDurQPC
invEnqDQcDQPC
listlist-datas
lsbwabsvDQLState
lsfbwabsvTid → DQLState
lstepDurQpDurQGState × DurQLState × DurQPC × DurQAction × DurQGState × DurQLState × DurQPC
lstepDQpDQGState × DQLState × DQPC × DQAction × DQGState × DQLState × DQPC
lstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQLState
lstepfDQfDQGState × DQLState × DQPC × DQAction → DQLState
mkNodefelem × OptTid × Ref → Node
mkdgsDurQ-renflist → DurQGState
mkgsDQflist → DQGState
mklistlist-lastfelem × nat → list
mklsDurQfTid × elem × OptElem × elem × OptElem → DurQLState
mklsDQfTid × bool × elem × OptElem × elem × OptElem → DQLState
mkstateDurQfDurQGState × (Tid → DurQLState) × (Tid → DurQPC) → DurQState
mkstateDQfDQGState × (Tid → DQLState) × (Tid → DQPC) → DQState
natnat-basics
nullRefcRef
optvalbwabsvOptElem
pcfbwabsvTid → DQPC
pcstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQPC
pcstepfDQfDQGState × DQLState × DQPC × DQAction → DQPC
preDurQpDurQGState × DurQLState × DurQPC × DurQAction
preDQpDQGState × DQLState × DQPC × DQAction
readyDurQcDurQPC
readyDQcDQPC
resDeqDurQcDurQPC
resDeqDQcDQPC
resEnqDurQcDurQPC
resEnqDQcDQPC
revlist-lastflist → list
rmduplist-dupflist → list
some?opttidpOptTid
tidbwabsvTid
valbwabsvelem
weak?opttidpOptTid