Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
We present a user-oriented description of features and characteristics of the High Performance Erlang (HiPE) native code compiler, which nowadays is part of Erlang/OTP. In particu...
Konstantinos F. Sagonas, Mikael Pettersson, Richar...
: In this paper a comparison is provided between the membrane computing systems and the graphical interfaces of operating systems. A membrane computing system is a computing model ...
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...