Abstract hidden Markov models: a monadic account of quantitative information flow
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
- Abstract hidden Markov models: a monadic account of quantitative information flow
- Program algebra for quantitative information flow
- Hidden-Markov program algebra with iteration
- A Kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- A note on distances between probabilistic and quantum distributions
- A better composition operator for quantitative information flow analyses
- Program algebra for quantitative information flow
- A Kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism
- Distances between states and between predicates
- A formal semantics of influence in Bayesian reasoning
- Algebra for quantitative information flow
- Abstract hidden Markov models: a monadic account of quantitative information flow
- Hidden-Markov program algebra with iteration
- Proving that programs are differentially private
- Probabilistic datatypes
- Composition theorems for f-differential privacy
- Probabilistic predicate transformers. II: Partially observable probability
This page was built for publication: Abstract hidden Markov models: a monadic account of quantitative information flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635839)
