CSFW
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—This paper studies the foundations of informationflow security for interactive programs. Previous research assumes that the environment is total, that is, it must alway...
SCP
2010
13 years 3 months ago
2010
Several scienti c bottlenecks have been identi ed in existing component-based approaches. em, we focus on the identi cation of a relevant abstraction for the component expression ...
EPEW
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. Th...
ACRI
2010
Springer
13 years 6 months ago
2010
Springer
A method of constructing asynchronous cellular automata (ACA model) as a parallel composition of two interacting ACA is presented. The resulting ACA is intended to simulate a proce...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical model...
CSFW
1995
IEEE
13 years 8 months ago
1995
IEEE
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...
ARTS
1999
Springer
13 years 9 months ago
1999
Springer
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplifie...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...