We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
We present a constructive authorization logic where the meanings of connectives are defined by their associated inference rules. This ensures that the logical reading of access c...
This paper presents a methodology for agent-oriented analysis and design. The methodology is general, in that it is applicable to a wide range of multi-agent systems, and comprehe...
Michael Wooldridge, Nicholas R. Jennings, David Ki...
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...
: Web-Communities wie Xing, StudiVZ, Facebook oder MySpace sind die erfolgreichsten Vertreter von Web 2.0-Anwendungen. Gerade die junge Generation (Generation 2.0) verwendet Web-Co...
Boris Aljancic, Niki Aljancic, Michael Clasen, Sus...