Sciweavers

CSFW
2012
IEEE
12 years 19 days ago
Securing Interactive Programs
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...
Willard Rafnsson, Daniel Hedin, Andrei Sabelfeld
SCP
2010
126views more  SCP 2010»
13 years 8 months ago
Component simulation-based substitutivity managing QoS and composition issues
Several scientic bottlenecks have been identied in existing component-based approaches. em, we focus on the identication of a relevant abstraction for the component expression ...
Pierre-Cyrille Héam, Olga Kouchnarenko, J&e...
EPEW
2010
Springer
13 years 11 months ago
Composing Systems While Preserving Probabilities
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...
Sonja Georgievska, Suzana Andova
ACRI
2010
Springer
13 years 11 months ago
Parallel Composition of Asynchronous Cellular Automata Simulating Reaction Diffusion Processes
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...
Olga L. Bandman
ATVA
2008
Springer
148views Hardware» more  ATVA 2008»
14 years 6 days ago
Decidable Compositions of O-Minimal Automata
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...
Alberto Casagrande, Pietro Corvaja, Carla Piazza, ...
CSFW
1995
IEEE
14 years 1 months ago
Composing and decomposing systems under security properties
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...
A. W. Roscoe, L. Wulf
ARTS
1999
Springer
14 years 2 months ago
Process Algebra with Probabilistic Choice
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...
Suzana Andova
FOSSACS
2004
Springer
14 years 3 months ago
Angelic Semantics of Fine-Grained Concurrency
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...
Dan R. Ghica, Andrzej S. Murawski
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
Composition Does Not Imply Adaptive Security
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...
Krzysztof Pietrzak
BIRTHDAY
2005
Springer
14 years 3 months ago
Compositional Reasoning for Probabilistic Finite-State Behaviors
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...
Yuxin Deng, Catuscia Palamidessi, Jun Pang