Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Communication and Concurrency
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Information Flow Analysis in a Discrete-Time Process Algebra
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A simple framework for real-time cryptographic protocol analysis with compositional proof rules
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
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)
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Opacity generalised to transition systems
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Real-time information flow analysis
IEEE Journal on Selected Areas in Communications
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
Formalisms for analysis of systems of various nature specified by process algebras are proposed. They allow us to formalize security properties based on an absence of information flow and properties on system's integrity. Resulting properties are compared and discussed. We present also quantification of these properties by means of information theory.