[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
. .gstateDQctrace-absActionfDQState → DQGState
. .gstateDurQfDurQState → DurQGState
. .gstate:= .DQctrace-absActionfDQState × DQGState → DQState
. .gstate:= .DurQfDurQState × DurQGState → DurQState
. .headlist-datapflist → elem with λ x. x ≠ []
. .ivalDQctrace-absActionfDQLState → elem
. .ivalDurQfDurQLState → elem
. .ival:= .DQctrace-absActionfDQLState × elem → DQLState
. .ival:= .DurQfDurQLState × elem → DurQLState
. .lastlist-lastpflist → elem with λ x. x ≠ []
. .lsfDQctrace-absActionfDQState → Tid → DQLState
. .lsfDurQfDurQState → Tid → DurQLState
. .lsf:= .DQctrace-absActionfDQState × (Tid → DQLState) → DQState
. .lsf:= .DurQfDurQState × (Tid → DurQLState) → DurQState
. .nextNodefNode → Ref
. .next:= .NodefNode × Ref → Node
. .obsEmptyDQctrace-absActionpDQLState
. .obsEmpty:= .DQctrace-absActionfDQLState × bool → DQLState
. .optvalDQctrace-absActionfDQLState → OptElem
. .optvalDurQfDurQLState → OptElem
. .optvalDQctrace-absActionpfDQAction → OptElem with λ a. ∃ tid, optval. a = RetDeq(tid, optval)
. .optvalDurQpfDurQAction → OptElem with λ a. ∃ tid, optval. a = ARetDeq(tid, optval)
. .optvalDQctrace-absActionpfabsAction → OptElem with λ aa. ∃ tid, optval. aa = ResDEQ(tid, optval)
. .optval:= .DQctrace-absActionfDQLState × OptElem → DQLState
. .optval:= .DurQfDurQLState × OptElem → DurQLState
. .ovalDQctrace-absActionfDQLState → OptElem
. .ovalDurQfDurQLState → OptElem
. .oval:= .DQctrace-absActionfDQLState × OptElem → DQLState
. .oval:= .DurQfDurQLState × OptElem → DurQLState
. .pcfDQctrace-absActionfDQState → Tid → DQPC
. .pcfDurQfDurQState → Tid → DurQPC
. .pcf:= .DQctrace-absActionfDQState × (Tid → DQPC) → DQState
. .pcf:= .DurQfDurQState × (Tid → DurQPC) → DurQState
. .queueDQctrace-absActionfDQGState → list
. .queueDurQfDurQGState → list
. .queue:= .DQctrace-absActionfDQGState × list → DQGState
. .queue:= .DurQfDurQGState × list → DurQGState
. .taillist-datapflist → list with λ x. x ≠ []
. .tidDQctrace-absActionfDQLState → Tid
. .tidDurQfDurQLState → Tid
. .tidopttidpfOptTid → Tid with λ opttid. weak?(opttid) ∨ some?(opttid)
. .tidDQctrace-absActionpfDQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalCrash
. .tidDurQpfDurQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalACrash
. .tidDQctrace-absActionpfabsAction → Tid with λ aa. aa ≠ globalCRASH ∧ aa ≠ τ
. .tid:= .DQctrace-absActionfDQLState × Tid → DQLState
. .tid:= .DurQfDurQLState × Tid → DurQLState
. .tid:= .opttidpfOptTid × Tid → OptTid with λ opttid, tid. weak?(opttid) ∨ some?(opttid)
. .valNodefNode → elem
. .valoptelempfOptElem → elem with λ optval. optval ≠ Empty
. .valDQctrace-absActionpfDQAction → elem with λ a. ∃ tid, val. a = InvEnq(tid, val)
. .valDurQpfDurQAction → elem with λ a. ∃ tid, val. a = AInvEnq(tid, val)
. .valDQctrace-absActionpfabsAction → elem with λ aa. ∃ tid, val. aa = InvENQ(tid, val)
. .val:= .NodefNode × elem → Node
. .valueDQctrace-absActionfDQLState → elem
. .valueDurQfDurQLState → elem
. .value:= .DQctrace-absActionfDQLState × elem → DQLState
. .value:= .DurQfDurQLState × elem → DurQLState
. < .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
τDQctrace-absActioncDQAction
τDurQcDurQAction
τDQctrace-absActioncabsAction
∅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 :
CHECKEMPDQctrace-absActionprlist : bool
CallRUNDQctrace-absActionfTid → absAction
CheckEmpDQctrace-absActionfTid → DQAction
CrashDQctrace-absActionpr : (Tid → DQPC)
DODEQDQctrace-absActionpr : OptElem × list
DODEQEMPTYDQctrace-absActionprbool : OptElem
DOENQDQctrace-absActionprelem : list
DQActionDQctrace-absActions
DQGInvDQctrace-absActionpDQGState
DQGStateDQctrace-absActions
DQInvDQctrace-absActionpDQGState × (Tid → DQLState) × (Tid → DQPC)
DQLInvDQctrace-absActionpDQGState × DQLState × DQPC
DQLStateDQctrace-absActions
DQPCDQctrace-absActions
DQStateDQctrace-absActions
DQstepDQctrace-absActionpDQState × DQAction × DQState
DoDeqDQctrace-absActionfTid → DQAction
DoDeqEmptyDQctrace-absActionfTid → DQAction
DoEnqDQctrace-absActionfTid → DQAction
DurQActionDurQs
DurQGInvDurQpDurQGState
DurQGStateDurQs
DurQInvDurQpDurQGState × (Tid → DurQLState) × (Tid → DurQPC)
DurQLInvDurQpDurQGState × DurQLState × DurQPC
DurQLStateDurQs
DurQPCDurQs
DurQStateDurQs
DurQstepDurQpDurQState × DurQAction × DurQState
EmptyoptelemcOptElem
INVDEQDQctrace-absActionpr : bool
INVENQDQctrace-absActionprelem : elem
InvDEQDQctrace-absActionfTid → absAction
InvDeqDQctrace-absActionfTid → DQAction
InvENQDQctrace-absActionfTid × elem → absAction
InvEnqDQctrace-absActionfTid × elem → DQAction
NodeNodes
NoneopttidcOptTid
OptElemoptelems
OptTidopttids
RETDEQDQctrace-absActionprOptElem : : OptElem
RETENQDQctrace-absActionpr :
RefRefs
ResDEQDQctrace-absActionfTid × OptElem → absAction
ResENQDQctrace-absActionfTid → absAction
RetDeqDQctrace-absActionfTid × OptElem → DQAction
RetEnqDQctrace-absActionfTid → DQAction
RunDQctrace-absActionpr :
SomeopttidfTid → OptTid
Tidtids
Valoptelemfelem → OptElem
WeakopttidfTid → OptTid
absActionDQctrace-absActions
butlastnlist-lastpfnat × list → list with λ n, x. n ≤ # x
callARunDurQfTid → DurQAction
callRunDQctrace-absActionfTid → DQAction
crashedDQctrace-absActioncDQPC
crashedDurQcDurQPC
disjlist-dupplist × list
dummytidtidcTid
dupslist-dupplist
elemelems
fillfirstlist-lastfnat × elem × list → list
globalACrashDurQcDurQAction
globalCRASHDQctrace-absActioncabsAction
globalCrashDQctrace-absActioncDQAction
gstepfDQctrace-absActionfDQGState × DQLState × DQPC × DQAction → DQGState
gstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQGState
heapNode-heaps
idleDQctrace-absActioncDQPC
idleDurQcDurQPC
invDeqDQctrace-absActioncDQPC
invDeqDurQcDurQPC
invEnqDQctrace-absActioncDQPC
invEnqDurQcDurQPC
listlist-datas
lstepDQctrace-absActionpDQGState × DQLState × DQPC × DQAction × DQGState × DQLState × DQPC
lstepDurQpDurQGState × DurQLState × DurQPC × DurQAction × DurQGState × DurQLState × DurQPC
lstepfDQctrace-absActionfDQGState × DQLState × DQPC × DQAction → DQLState
lstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQLState
mkNodefelem × OptTid × Ref → Node
mkdgsDQctrace-absActionflist → DurQGState
mkgsDQctrace-absActionflist → DQGState
mklistlist-lastfelem × nat → list
mklsDQctrace-absActionfTid × bool × elem × OptElem × elem × OptElem → DQLState
mklsDurQfTid × elem × OptElem × elem × OptElem → DurQLState
mkstateDQctrace-absActionfDQGState × (Tid → DQLState) × (Tid → DQPC) → DQState
mkstateDurQfDurQGState × (Tid → DurQLState) × (Tid → DurQPC) → DurQState
natnat-basics
nullRefcRef
pcstepfDQctrace-absActionfDQGState × DQLState × DQPC × DQAction → DQPC
pcstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQPC
preDQctrace-absActionpDQGState × DQLState × DQPC × DQAction
preDurQpDurQGState × DurQLState × DurQPC × DurQAction
readyDQctrace-absActioncDQPC
readyDurQcDurQPC
resDeqDQctrace-absActioncDQPC
resDeqDurQcDurQPC
resEnqDQctrace-absActioncDQPC
resEnqDurQcDurQPC
revlist-lastflist → list
rmduplist-dupflist → list
some?opttidpOptTid
weak?opttidpOptTid