A kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism

McIver, Annabelle, Meinicke, Larissa and Morgan, Carroll (2012). A kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, (461-470). 25 - 28 June 2012. doi:10.1109/LICS.2012.56

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author McIver, Annabelle
Meinicke, Larissa
Morgan, Carroll
Title of paper A kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism
Conference name 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012
Conference location Dubrovnik, Croatia
Conference dates 25 - 28 June 2012
Proceedings title Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science
Journal name Annual Symposium on Logic in Computer Science
Place of Publication Los Alamitos, CA United States
Publisher IEEE Computer Society
Publication Year 2012
Year available 2012
Sub-type Fully published paper
DOI 10.1109/LICS.2012.56
Open Access Status
ISBN 9780769547695
9781467322638
ISSN 1043-6871
Start page 461
End page 470
Total pages 10
Collection year 2013
Language eng
Abstract/Summary We propose a novel domain-theoretic model for nondeterminism, probability and hidden state, with relations on it that compare information flow. One relation is Smyth-like, based on a structural, refinement-like order between semantic elements; the other is a testing order that generalises several extant entropy-based techniques. Our principal theorem is that the two orders are equivalent. The model is based on the Giry/Kantorovich monads, and it abstracts Partially Observable Markov Decision Processes by discarding observables' actual values but retaining the effect they had on an observer's knowledge. We illustrate the model, and its orders, on some small examples, where we find that our formalism provides the apparatus for comparing systems in terms of the information they leak.
Subjects 1701 Psychology
2609 Logic
Keyword Probabilistic domains
Probabilistic monads
Quantitative information flow
Refinement orders
Semantics
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 3 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 4 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Thu, 28 Nov 2013, 08:30:19 EST by System User on behalf of School of Information Technol and Elec Engineering