Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Communication and Concurrency
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Information Flow Analysis in a Discrete-Time Process Algebra
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A static analysis for quantifying information flow in a simple imperative language
Journal of Computer Security
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Quantifying information flow with beliefs
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Gained and Excluded Private Actions by Process Observations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
Process testing as a way to obtain information on confidential data is investigated. Our working formalism is based on an appropriate probabilistic process algebra and probabilistic testing. We define testing noninterference as well as sets of private actions which execution is guaranteed by a given test and sets of actions which execution could be excluded by a given test. Moreover, we relate obtained information to a size of the test.