Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 40.

Add to Quick Collection   All 40 Results

Sort:
 Add All Items to Quick Collection
Date: 2016
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1151908
Description: 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 op ... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1215541
Description: Jones' rely-guarantee calculus for shared variable concurrency is extended to include probabilistic behaviours. We use an algebraic approach that is based on a combination of probabilistic Kleene alge ... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1202739
Description: It is well known that every trace of a transition system can be generated using a scheduler. However, this basic completeness result does not hold in event structure models. The reason for this failur ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1049188
Description: 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 probabili ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1054394
Description: In this paper, we investigate the semantic intricacies of conditioning in probabilistic programming, a major feature, e.g., in machine learning. We provide a quantitative weakest pre-condition semanti ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/328102
Description: We use hidden Markov models to motivate a quantitative compositional semantics for noninterference-based security with iteration, including a refinement- or 'implements' relation that compares two pro ... More
Reviewed: Reviewed
Date: 2014
Subject Keyword: 080300 Computer Software
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/303620
Description: The observable output of a probabilistic system that processes a secret input might reveal some information about that input. The system can be modelled as an information-theoretic channel that specif ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/339851
Description: Protecting sensitive information from improper disclosure is a fundamental security goal. It is complicated, and difficult to achieve, often because of unavoidable or even unpredictable operating cond ... More
Reviewed: Reviewed
Date: 2014
Subject Keyword: Routing | Semiring | Kleene algebra | Path algebra
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/331893
Description: Concrete and abstract relation algebras have widespread applications in computer science. One of the most famous is graph theory. Classical relations, however, only reason about connectivity, not abou ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/309781
Description: This paper proposes a simple operational semantics of pGCL, Dijkstra's guarded command language extended with probabilistic choice, and relates this to pGCL's wp-semantics by McIver and Morgan. Parame ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/303641
Description: Electronic voting is rich with paradoxes. How can a voter verify that his own vote has been correctly counted, but at the same time be prevented from revealing his vote to a third party? Not only is t ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/281038
Description: 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 concurre ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/262217
Description: Prinsys (pronounced "princess") is a new software-tool for probabilistic invariant synthesis. In this paper we discuss its implementation and improvements of the methodology which was set out in previ ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/262839
Description: 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 soun ... More
Reviewed: Reviewed