Sciweavers

2610 search results - page 2 / 522
» Computational Probabilistic Non-interference
Sort
View
ENTCS
2006
145views more  ENTCS 2006»
13 years 5 months ago
A Classification of Time and/or Probability Dependent Security Properties
In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial studnformation ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
TSE
2010
120views more  TSE 2010»
13 years 3 months ago
Time and Probability-Based Information Flow Analysis
Abstract—In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial stud...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
FOSSACS
2011
Springer
12 years 9 months ago
Coalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Bart Jacobs
TC
2011
13 years 12 days ago
An Architecture for Fault-Tolerant Computation with Stochastic Logic
—Mounting concerns over variability, defects and noise motivate a new approach for digital circuitry: stochastic logic, that is to say, logic that operates on probabilistic signa...
Weikang Qian, Xin Li, Marc D. Riedel, Kia Bazargan...
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 14 days ago
A Class of Probabilistic Automata with a Decidable Value 1 Problem
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Ou...