Hidden-Markov program algebra with iteration

DOI10.1017/S0960129513000625zbMath1362.68052OpenAlexW3102249367MaRDI QIDQ5740625

Larissa A. Meinicke, Carroll Morgan, Annabelle McIver

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129513000625

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Algebra for Quantitative Information Flow, A better composition operator for quantitative information flow analyses, An axiomatization of information flow measures, Abstractions of non-interference security: probabilistic versus possibilistic, Quantifying information leakage of randomized protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shadow knows: refinement and security in sequential programs
• A probabilistic PDL
• A ratio limit theorem for the finite nonhomogeneous Markov chains
• Probabilistic models for the guarded command language
• Lexicon development for speech and language processing
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• A lattice-theoretical fixpoint theorem and its applications
• Quantitative Notions of Leakage for One-try Attacks
• Information Flow in Interactive Systems
• Compositional Closure for Bayes Risk in Probabilistic Noninterference
• Refinement Calculus
• Abstraction, Refinement and Proof for Probabilistic Systems
• Termination of Probabilistic Concurrent Program
• Real Analysis and Probability
• An Alternative Order for the Failures Model
• Compositional Methods for Information-Hiding
• Program development by stepwise refinement
• The Legend of John Von Neumann
• Jensen’s inequality