LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1

Discovery Projects - Grant ID: DP140101119

Title
Discovery Projects - Grant ID: DP140101119
Funding
ARC | Discovery Projects
Contract (GA) number
DP140101119
Start Date
2014/01/01
End Date
2016/12/31
Open Access mandate
no
Organizations
-
More information
http://purl.org/au-research/grants/arc/DP140101119

 

  • A New Proof Rule for Almost-Sure Termination

    McIver, Annabelle; Morgan, Carroll; Kaminski, Benjamin Lucien; Katoen, Joost-Pieter (2017)
    Projects: ARC | Discovery Projects - Grant ID: DP140101119 (DP140101119)
    An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be hard, and this paper presents a new method for doing so; it is expressed in a program logic, and so applies directly to source code. The programs may contain both probabilistic- and demonic choice, and the probabilistic choices may depend on the current state. As do other researchers, we use variant functions (a.k....

    An Algebraic Approach for Reasoning About Information Flow

    Américo, Arthur; Alvim, Mário S.; McIver, Annabelle (2018)
    Projects: ARC | Discovery Projects - Grant ID: DP140101119 (DP140101119)
    This paper concerns the analysis of information leaks in security systems. We address the problem of specifying and analyzing large systems in the (standard) channel model used in quantitative information flow (QIF). We propose several operators which match typical interactions between system components. We explore their algebraic properties with respect to the security-preserving refinement relation defined by Alvim et al. and McIver et al. We show how the algebra can be used to simplify lar...

    Axioms for Information Leakage

    Alvim , Mário S.; Chatzikokolakis , Konstantinos; McIver , Annabelle; Morgan , Carroll; Palamidessi , Catuscia; Smith , Geoffrey (2016)
    Projects: ARC | Discovery Projects - Grant ID: DP140101119 (DP140101119), NSF | TC: Small: Theory and Applications of Min-Entropy Leakage (1116318)
    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 result, many leakage measures have been proposed, with many different properties. To clarify this complex situation, this paper studies information leakage axiomatically, showing important dependencies among different axioms. It also establishes a...
  • No project research data found
  • Scientific Results

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    PUBLICATIONS BY ACCESS MODE

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Publications in Repositories

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark

App Box