135
click to vote
AFP
9 years 9 months ago
2015 Springer 
The necessary and sufficient condition for CSP noninterference security stated by the Ipurge Unwinding Theorem is expressed in terms of a pair of event lists varying over the set ...
120
click to vote
AFP
9 years 9 months ago
2015 Springer 
In this work, we formally proved Descartes Rule of Signs, which relates the number of positive real roots of a polynomial with the number of sign changes in its coefficient list. ...
117
click to vote
AFP
9 years 9 months ago
2015 Springer 
Applicative functors augment computations with effects by lifting function application to types which model the effects [5]. As the structure of the computation cannot depend on...
113
click to vote
AFP
9 years 9 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...
|
Formal Methods