#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2009

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Tahiry M. Rabehaja, Jeff W. Sanders
- 2009 Third IEEE International Symposium on…
- 2009

Refinement algebra provides axioms for the stepwise removal of abstraction, in the form of demonic nondeterminism, in a first-order system that supports reasoning about loops. It has been extended by Solin and Meinecke to computations involving implicit probabilistic choices: demonic nondeterminism then satisfies weaker properties. In this paper their axiom… (More)

- Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja
- 2015 30th Annual ACM/IEEE Symposium on Logic in…
- 2015

Hidden Markov Models, HMM's, are mathematical models of Markov processes whose state is hidden but from which information can leak via channels. They are typically represented as 3-way joint probability distributions. We use HMM's as denotations of probabilistic hidden-state sequential programs, after recasting them as “abstract” HMM's, i.e.… (More)

- Annabelle McIver, Tahiry M. Rabehaja, Georg Struth
- QAPL
- 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 automata modulo probabilistic simulation. We use the resulting algebra to generalise the algebraic formulation of a… (More)

- Annabelle McIver, Tahiry M. Rabehaja, Georg Struth
- RAMICS
- 2011

We show that a class of automata modulo simulation equivalence forms a model of probabilistic Kleene algebra. We prove completeness of this model with respect to continuous probabilistic Kleene algebras. Hence an identity is valid in continuous probabilistic Kleene algebras if and only if the associated automata are simulation equivalent.

- Annabelle McIver, Tahiry M. Rabehaja, Georg Struth
- LPAR
- 2013

We give a new true-concurrent model for probabilistic concurrent Kleene algebra. The model is based on probabilistic event structures , which combines ideas from Katoen's work on probabilistic con-currency and Varacca's probabilistic prime event structures. The event structures are compared with a true-concurrent version of Segala's prob-abilistic… (More)

- Annabelle McIver, Tahiry M. Rabehaja, Georg Struth
- ArXiv
- 2013

We propose a generalisation of concurrent Kleene algebra [5] that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted η-simulation equivalence. Applicability is demonstrated by algebraic treatments of two examples: algebraic may testing and… (More)

- Annabelle McIver, Tahiry M. Rabehaja, Georg Struth
- ICTAC
- 2016

In quantitative information flow we say that program Q is " at least as secure as " P just when the amount of secret information flowing from Q is never more than flows from P , with of course a suitable quantification of " flow ". This secure-refinement order is compositional just when P Q implies C(P)C(Q) for any context C, again with a suitable… (More)

- Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja
- RAMiCS
- 2017

A core property of program semantics is that local reasoning about program fragments remains sound even when the fragments are executed within a larger system. Mathematically this property corresponds to monotonicity of refinement : if A refines B then C(A) refines C(B) for any (valid) context defined by C(·). In other work we have studied a refines order… (More)