SAS
2015
Springer
8 years 8 months ago
2015
Springer
We present a novel static analysis to infer the parallel cost of distributed systems. Parallel cost differs from the standard notion of serial cost by exploiting the truly concurr...
SAS
2015
Springer
8 years 8 months ago
2015
Springer
Early work in implicit information flow detection applied only to flat, procedureless languages with structured control-flow (e.g., if statements, while loops). These techniques...
AFP
2015
Springer
8 years 8 months ago
2015
Springer
We formalize new decision procedures for WS1S, M2L(Str), and Presburger Arithmetics. Formulas of these logics denote regular languages. Unlike traditional decision procedures, we ...
AFP
2015
Springer
8 years 8 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. ...
AFP
2015
Springer
8 years 8 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 ...
AFP
2015
Springer
8 years 8 months ago
2015
Springer
Among the various mathematical tools introduced in his outstanding work on Communicating Sequential Processes, Hoare has defined ”interleaves” as the predicate satisfied by ...
AFP
2015
Springer
8 years 8 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...
AFP
2015
Springer
8 years 8 months ago
2015
Springer
We provide a framework for registering automatic methods to derive class instances of datatypes, as it is possible using Haskell’s “deriving Ord, Show, . . . ” feature. We f...
AFP
2015
Springer
8 years 8 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...
AFP
2015
Springer
8 years 8 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.