Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 10 of 10.

Add to Quick Collection   All 10 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/190328
Description: 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, refin ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148088
Description: We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compositional relation con ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/91338
Description: We identify a refinement algebra for reasoning about probabilistic program transformations in a total-correctness setting. The algebra is equipped with operators that determine whether a program is en ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/347116
Description: In this paper we focus on the relationship between a number of specification models. The models are formulated in the Unifying Theories of Programming of Hoare and He, but correspond to widely used sp ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148619
Description: Security and probability are both artefacts that we hope to bring increasingly within the reach of refinement-based Formal Methods; although we have worked on them separately, in the past, the goal ha ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146712
Description: Back and von Wright have developed algebraic laws for reasoning about loops in a total correctness framework using the refinement calculus. We extend their work to reasoning about probabilistic loops ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/150071
Description: The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tests, that are suitable for reasoning about programs in a total-correctness framework. Abstract algebr ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/149800
Description: This paper investigates the use of the probabilistic and continuous extensions of action systems in the development and calculation of reliability of continuous, real-time systems. Rather than develop ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148855
Description: Action systems are a framework for reasoning about discrete reactive systems. Back, Petre and Porres have extended these action systems to continuous action systems, which can be used to model hybrid ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/150065
Description: Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calculus. We extend their work to reasoning about probabilistic loops in the probabilistic refinement calc ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last