We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the secur...
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
In the relational model it has been shown that the flat relational algebra has the same expressive power as the nested relational algebra, as far as queries over flat relations ...
Wim Le Page, Jan Hidders, Philippe Michiels, Jan P...
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...