137
click to vote
AFP
2015
Springer
9 years 12 months ago
2015
Springer
The definition of noninterference security for Communicating Sequential Processes requires to consider any possible future, i.e. any indefinitely long sequence of subsequent eve...
132
click to vote
AFP
2015
Springer
9 years 12 months ago
2015
Springer
We analyze the amortized complexity of dynamic tables with arbitrary minimal and maximal load factors and arbitrary expansion and contraction factors.
129
click to vote
AFP
2015
Springer
9 years 12 months ago
2015
Springer
Euler’s Partition Theorem states that the number of partitions with only distinct parts is equal to the number of partitions with only odd parts. The combinatorial proof follows...
135
click to vote
AFP
2015
Springer
9 years 12 months ago
2015
Springer
The classical definition of noninterference security for a deterministic state machine with outputs requires to consider the outputs produced by machine actions after any trace, ...
120
click to vote
AFP
2015
Springer
9 years 12 months ago
2015
Springer
Isabelle/Isar provides named cases to structure proofs. This article contains an implementation of a proof method casify, which can be used to easily extend proof tools with suppo...