AGERE
2015
9 years 9 months ago
2015
Combining the actor-model with shared memory for performance is efficient but can introduce data-races. Existing approaches to static data-race freedom are based on uniqueness an...
AGERE
2015
9 years 9 months ago
2015
Agent-Oriented Programming (AOP) researchers have successfully developed a range of agent programming languages that bridge the gap between theory and practice. Unfortunately, des...
104
click to vote
AFP
2015
Springer
9 years 9 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 ...
120
click to vote
AFP
2015
Springer
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. ...
135
click to vote
AFP
2015
Springer
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 ...
102
click to vote
AFP
2015
Springer
9 years 9 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 ...
117
click to vote
AFP
2015
Springer
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...
111
click to vote
AFP
2015
Springer
9 years 9 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...
113
click to vote
AFP
2015
Springer
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...
108
click to vote
AFP
2015
Springer
9 years 9 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.