Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Annabelle McIver"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2019)
Hidden Markov Models, HMM's, are mathematical models of Markov processes with state that is hidden, but from which information can leak. They are typically represented as 3-way joint-probability distributions. We use HMM's as denotations of probabil
Externí odkaz:
https://doaj.org/article/d7c385d3b33b4485ba84a65c73b4b875
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 117, Iss Proc. QAPL 2013, Pp 97-115 (2013)
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automat
Externí odkaz:
https://doaj.org/article/2fe1f5c2834b482487bcc7711e063f7c
Autor:
Annabelle McIver, Ukachukwu Ndukwu
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 55, Iss Proc. Refine 2011, Pp 101-120 (2011)
The role played by counterexamples in standard system analysis is well known; but less common is a notion of counterexample in probabilistic systems refinement. In this paper we extend previous work using counterexamples to inductive invariant proper
Externí odkaz:
https://doaj.org/article/d15d951c4dde48cb96f6914914ef9675
Autor:
Ukachukwu Ndukwu, Annabelle McIver
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 28, Iss Proc. QAPL 2010, Pp 129-143 (2010)
In this paper we revisit the well-known technique of predicate abstraction to characterise performance attributes of system models incorporating probability. We recast the theory using expectation transformers, and identify transformer properties whi
Externí odkaz:
https://doaj.org/article/5ee1f27d8a134e0cad21136d90fa2131
Autor:
Maurice H. ter Beek, Annabelle McIver
Publikováno v:
Formal Methods in System Design
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::912bd1feab86b796a007f648872331b2
https://doi.org/10.1007/s10703-021-00380-6
https://doi.org/10.1007/s10703-021-00380-6
Publikováno v:
2022 IEEE 35th Computer Security Foundations Symposium (CSF)
2022 IEEE 35th Computer Security Foundations Symposium (CSF), Aug 2022, Haifa, Israel. pp.348-363, ⟨10.1109/CSF54842.2022.9919647⟩
CSF 2022-35th IEEE Computer Security Foundations Symposium
CSF 2022-35th IEEE Computer Security Foundations Symposium, Aug 2022, Haifa, Israel. pp.348-363, ⟨10.1109/CSF54842.2022.9919647⟩
2022 IEEE 35th Computer Security Foundations Symposium (CSF), Aug 2022, Haifa, Israel. pp.348-363, ⟨10.1109/CSF54842.2022.9919647⟩
CSF 2022-35th IEEE Computer Security Foundations Symposium
CSF 2022-35th IEEE Computer Security Foundations Symposium, Aug 2022, Haifa, Israel. pp.348-363, ⟨10.1109/CSF54842.2022.9919647⟩
International audience; We study the privacy-utility trade-off in the context of metric differential privacy. Ghosh et al. introduced the idea of universal optimality to characterise the “best” mechanism for a certain query that simultaneously sa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7b8f5dff3df3394a5ae1c90eab23b3b
https://inria.hal.science/hal-03909798
https://inria.hal.science/hal-03909798
A formal quantitative study of privacy in the publication of official educational censuses in Brazil
Publikováno v:
Anais do XXXV Concurso de Teses e Dissertações (CTD 2022).
We present a summary of the work done in the dissertation "A formal quantitative study of privacy in the publication of official educational censuses in Brazil", including its contributions and impacts so far. The dissertation presents a systematic r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::263e91c00bba09e7810b19cd5864357a
https://doi.org/10.5753/ctd.2022.223158
https://doi.org/10.5753/ctd.2022.223158
We present a systematic refactoring of the conventional treatment of privacy analyses, basing it on mathematical concepts from the framework of Quantitative Information Flow (QIF ). The approach we suggest brings three principal advantages: it is fle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::028add7bedf3315fc4d1afc5cf59c693
http://arxiv.org/abs/2204.13734
http://arxiv.org/abs/2204.13734
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 106:55-77
Models for quantitative information flow traditionally assume that the secret, once set, never changes. More recently, however, Hidden Markov Models (HMM's) have been used to describe program features that include both state updates and information f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0eaf07d79ddd0fc9349cf7cedb0314ff
https://doi.org/10.1016/j.jlamp.2019.04.002
https://doi.org/10.1016/j.jlamp.2019.04.002
Autor:
Konstantinos Chatzikokolakis, Catuscia Palamidessi, Carroll Morgan, Mário S. Alvim, Geoffrey Smith, Annabelle McIver
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, 777, pp.32-54. ⟨10.1016/j.tcs.2018.10.016⟩
Theoretical Computer Science, 2019, 777, pp.32-54. ⟨10.1016/j.tcs.2018.10.016⟩
Theoretical Computer Science, Elsevier, 2019, 777, pp.32-54. ⟨10.1016/j.tcs.2018.10.016⟩
Theoretical Computer Science, 2019, 777, pp.32-54. ⟨10.1016/j.tcs.2018.10.016⟩
International audience; Quantitative information flow aims to assess and control the leakage of sensitive information by computer systems. A key insight in this area is that no single leakage measure is appropriate in all operational scenarios; as a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5de8d59d210d31a2b09f5c63a352e030
https://doi.org/10.1016/j.tcs.2018.10.016
https://doi.org/10.1016/j.tcs.2018.10.016