Sciweavers

ENTCS
2007
135views more  ENTCS 2007»
13 years 5 months ago
Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems
We introduce a hybrid variant of a dynamic logic with continuous state transitions along differential equations, and we present a sequent calculus for this extended hybrid dynami...
André Platzer
ENTCS
2007
110views more  ENTCS 2007»
13 years 5 months ago
Data Anonymity in the FOO Voting Scheme
We study one of the many aspects of privacy, which is referred to as data anonymity, in a formal context. Data anonymity expresses whether some piece of observed data, such as a v...
Sjouke Mauw, Jan Verschuren, Erik P. de Vink
ENTCS
2007
121views more  ENTCS 2007»
13 years 5 months ago
Audit-Based Access Control for Electronic Health Records
Traditional access control mechanisms aim to prevent illegal actions a-priori occurrence, i.e. before granting a request for a document. There are scenarios however where the secu...
M. A. C. Dekker, Sandro Etalle
ENTCS
2007
112views more  ENTCS 2007»
13 years 5 months ago
A Holistic Approach to Security Policies - Policy Distribution with XACML over COPS
The potentials of modern information technology can only be exploited, if the underlying infrastructure and the applied applications sufficiently take into account all aspects of ...
Jan Peters, Roland Rieke, Taufiq Rochaeli, Bjö...
ENTCS
2007
131views more  ENTCS 2007»
13 years 5 months ago
Architecting Fault-tolerant Component-based Systems: from requirements to testing
Fault tolerance is one of the most important means to avoid service failure in the presence of faults, so to guarantee they will not interrupt the service delivery. Software testi...
Antonio Bucchiarone, Henry Muccini, Patrizio Pelli...
ENTCS
2007
96views more  ENTCS 2007»
13 years 5 months ago
Cryptographic Pattern Matching
We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
ENTCS
2007
140views more  ENTCS 2007»
13 years 5 months ago
Admissible Representations of Probability Measures
In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 T...
Matthias Schröder
ENTCS
2007
153views more  ENTCS 2007»
13 years 5 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
ENTCS
2007
91views more  ENTCS 2007»
13 years 5 months ago
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
George Barmpalias, Antonio Montalbán
ENTCS
2007
65views more  ENTCS 2007»
13 years 5 months ago
Effective Randomness for Computable Probability Measures
Laurent Bienvenu, Wolfgang Merkle