[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
. .gstateDQatrace-absActionfDQState → DQGState
. .gstate:= .DQatrace-absActionfDQState × DQGState → DQState
. .headlist-datapflist → elem with λ x. x ≠ []
. .ivalDQatrace-absActionfDQLState → elem
. .ival:= .DQatrace-absActionfDQLState × elem → DQLState
. .lastlist-lastpflist → elem with λ x. x ≠ []
. .lsfDQatrace-absActionfDQState → Tid → DQLState
. .lsf:= .DQatrace-absActionfDQState × (Tid → DQLState) → DQState
. .nextNodefNode → Ref
. .next:= .NodefNode × Ref → Node
. .obsEmptyDQatrace-absActionpDQLState
. .obsEmpty:= .DQatrace-absActionfDQLState × bool → DQLState
. .optvalDQatrace-absActionfDQLState → OptElem
. .optvalDQatrace-absActionpfDQAction → OptElem with λ a. ∃ tid, optval. a = RetDeq(tid, optval)
. .optvalDQatrace-absActionpfabsAction → OptElem with λ aa. ∃ tid, optval. aa = ResDEQ(tid, optval)
. .optval:= .DQatrace-absActionfDQLState × OptElem → DQLState
. .ovalDQatrace-absActionfDQLState → OptElem
. .oval:= .DQatrace-absActionfDQLState × OptElem → DQLState
. .pcfDQatrace-absActionfDQState → Tid → DQPC
. .pcf:= .DQatrace-absActionfDQState × (Tid → DQPC) → DQState
. .queueDQatrace-absActionfDQGState → list
. .queue:= .DQatrace-absActionfDQGState × list → DQGState
. .taillist-datapflist → list with λ x. x ≠ []
. .tidDQatrace-absActionfDQLState → Tid
. .tidopttidpfOptTid → Tid with λ opttid. weak?(opttid) ∨ some?(opttid)
. .tidDQatrace-absActionpfDQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalCrash
. .tidDQatrace-absActionpfabsAction → Tid with λ aa. aa ≠ globalCRASH ∧ aa ≠ τ
. .tid:= .DQatrace-absActionfDQLState × Tid → DQLState
. .tid:= .opttidpfOptTid × Tid → OptTid with λ opttid, tid. weak?(opttid) ∨ some?(opttid)
. .valNodefNode → elem
. .valoptelempfOptElem → elem with λ optval. optval ≠ Empty
. .valDQatrace-absActionpfDQAction → elem with λ a. ∃ tid, val. a = InvEnq(tid, val)
. .valDQatrace-absActionpfabsAction → elem with λ aa. ∃ tid, val. aa = InvENQ(tid, val)
. .val:= .NodefNode × elem → Node
. .valueDQatrace-absActionfDQLState → elem
. .value:= .DQatrace-absActionfDQLState × 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
τDQatrace-absActioncDQAction
τDQatrace-absActioncabsAction
∅Node-heapcheap
CHECKEMPDQatrace-absActionprlist : bool
CallRUNDQatrace-absActionfTid → absAction
CheckEmpDQatrace-absActionfTid → DQAction
CrashDQatrace-absActionpr : (Tid → DQPC)
DODEQDQatrace-absActionpr : OptElem × list
DODEQEMPTYDQatrace-absActionprbool : OptElem
DOENQDQatrace-absActionprelem : list
DQActionDQatrace-absActions
DQGInvDQatrace-absActionpDQGState
DQGStateDQatrace-absActions
DQInvDQatrace-absActionpDQGState × (Tid → DQLState) × (Tid → DQPC)
DQLInvDQatrace-absActionpDQGState × DQLState × DQPC
DQLStateDQatrace-absActions
DQPCDQatrace-absActions
DQStateDQatrace-absActions
DQstepDQatrace-absActionpDQState × DQAction × DQState
DoDeqDQatrace-absActionfTid → DQAction
DoDeqEmptyDQatrace-absActionfTid → DQAction
DoEnqDQatrace-absActionfTid → DQAction
EmptyoptelemcOptElem
INVDEQDQatrace-absActionpr : bool
INVENQDQatrace-absActionprelem : elem
InvDEQDQatrace-absActionfTid → absAction
InvDeqDQatrace-absActionfTid → DQAction
InvENQDQatrace-absActionfTid × elem → absAction
InvEnqDQatrace-absActionfTid × elem → DQAction
NodeNodes
NoneopttidcOptTid
OptElemoptelems
OptTidopttids
RETDEQDQatrace-absActionprOptElem : : OptElem
RETENQDQatrace-absActionpr :
RefRefs
ResDEQDQatrace-absActionfTid × OptElem → absAction
ResENQDQatrace-absActionfTid → absAction
RetDeqDQatrace-absActionfTid × OptElem → DQAction
RetEnqDQatrace-absActionfTid → DQAction
RunDQatrace-absActionpr :
SomeopttidfTid → OptTid
Tidtids
Valoptelemfelem → OptElem
WeakopttidfTid → OptTid
absActionDQatrace-absActions
butlastnlist-lastpfnat × list → list with λ n, x. n ≤ # x
callRunDQatrace-absActionfTid → DQAction
crashedDQatrace-absActioncDQPC
disjlist-dupplist × list
dummytidtidcTid
dupslist-dupplist
elemelems
fillfirstlist-lastfnat × elem × list → list
globalCRASHDQatrace-absActioncabsAction
globalCrashDQatrace-absActioncDQAction
gstepfDQatrace-absActionfDQGState × DQLState × DQPC × DQAction → DQGState
heapNode-heaps
idleDQatrace-absActioncDQPC
invDeqDQatrace-absActioncDQPC
invEnqDQatrace-absActioncDQPC
listlist-datas
lstepDQatrace-absActionpDQGState × DQLState × DQPC × DQAction × DQGState × DQLState × DQPC
lstepfDQatrace-absActionfDQGState × DQLState × DQPC × DQAction → DQLState
mkNodefelem × OptTid × Ref → Node
mkgsDQatrace-absActionflist → DQGState
mklistlist-lastfelem × nat → list
mklsDQatrace-absActionfTid × bool × elem × OptElem × elem × OptElem → DQLState
mkstateDQatrace-absActionfDQGState × (Tid → DQLState) × (Tid → DQPC) → DQState
natnat-basics
nullRefcRef
pcstepfDQatrace-absActionfDQGState × DQLState × DQPC × DQAction → DQPC
preDQatrace-absActionpDQGState × DQLState × DQPC × DQAction
readyDQatrace-absActioncDQPC
resDeqDQatrace-absActioncDQPC
resEnqDQatrace-absActioncDQPC
revlist-lastflist → list
rmduplist-dupflist → list
some?opttidpOptTid
weak?opttidpOptTid