[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
. .gstate:= .DurQfDurQState × DurQGState → DurQState
. .headlist-datapflist → elem with λ x. x ≠ []
. .ivalDurQfDurQLState → elem
. .ival:= .DurQfDurQLState × elem → DurQLState
. .lastlist-lastpflist → elem with λ x. x ≠ []
. .lsfDurQfDurQState → Tid → DurQLState
. .lsf:= .DurQfDurQState × (Tid → DurQLState) → DurQState
. .nextNodefNode → Ref
. .next:= .NodefNode × Ref → Node
. .optvalDurQfDurQLState → OptElem
. .optvalDurQpfDurQAction → OptElem with λ a. ∃ tid, optval. a = ARetDeq(tid, optval)
. .optval:= .DurQfDurQLState × OptElem → DurQLState
. .ovalDurQfDurQLState → OptElem
. .oval:= .DurQfDurQLState × OptElem → DurQLState
. .pcfDurQfDurQState → Tid → DurQPC
. .pcf:= .DurQfDurQState × (Tid → DurQPC) → DurQState
. .queueDurQfDurQGState → list
. .queue:= .DurQfDurQGState × list → DurQGState
. .taillist-datapflist → list with λ x. x ≠ []
. .tidDurQfDurQLState → Tid
. .tidopttidpfOptTid → Tid with λ opttid. weak?(opttid) ∨ some?(opttid)
. .tidDurQpfDurQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalACrash
. .tid:= .DurQfDurQLState × Tid → DurQLState
. .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)
. .val:= .NodefNode × elem → Node
. .valueDurQfDurQLState → elem
. .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
τDurQcDurQAction
∅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 :
DurQActionDurQs
DurQGInvDurQpDurQGState
DurQGStateDurQs
DurQInvDurQpDurQGState × (Tid → DurQLState) × (Tid → DurQPC)
DurQLInvDurQpDurQGState × DurQLState × DurQPC
DurQLStateDurQs
DurQPCDurQs
DurQStateDurQs
DurQstepDurQpDurQState × DurQAction × DurQState
EmptyoptelemcOptElem
NodeNodes
NoneopttidcOptTid
OptElemoptelems
OptTidopttids
RefRefs
SomeopttidfTid → OptTid
Tidtids
Valoptelemfelem → OptElem
WeakopttidfTid → OptTid
aDurQ-proofsvDurQAction
butlastnlist-lastpfnat × list → list with λ n, x. n ≤ # x
callARunDurQfTid → DurQAction
crashedDurQcDurQPC
disjlist-dupplist × list
dummytidtidcTid
dupslist-dupplist
elemelems
fillfirstlist-lastfnat × elem × list → list
globalACrashDurQcDurQAction
gsDurQ-proofsvDurQGState
gstateDurQ-proofsvDurQGState
gstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQGState
heapNode-heaps
idleDurQcDurQPC
invDeqDurQcDurQPC
invEnqDurQcDurQPC
ivalDurQ-proofsvelem
listlist-datas
lsDurQ-proofsvDurQLState
lsfDurQ-proofsvTid → DurQLState
lstepDurQpDurQGState × DurQLState × DurQPC × DurQAction × DurQGState × DurQLState × DurQPC
lstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQLState
mkNodefelem × OptTid × Ref → Node
mkgsDurQflist → DurQGState
mklistlist-lastfelem × nat → list
mklsDurQfTid × elem × OptElem × elem × OptElem → DurQLState
mkstateDurQfDurQGState × (Tid → DurQLState) × (Tid → DurQPC) → DurQState
natnat-basics
nullRefcRef
optvalDurQ-proofsvOptElem
ovalDurQ-proofsvOptElem
pcDurQ-proofsvDurQPC
pcfDurQ-proofsvTid → DurQPC
pcstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQPC
preDurQpDurQGState × DurQLState × DurQPC × DurQAction
queueDurQ-proofsvlist
readyDurQcDurQPC
resDeqDurQcDurQPC
resEnqDurQcDurQPC
revlist-lastflist → list
rmduplist-dupflist → list
sDurQ-proofsvDurQState
some?opttidpOptTid
tidDurQ-proofsvTid
valDurQ-proofsvelem
valueDurQ-proofsvelem
weak?opttidpOptTid