Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 8 of 8.

Add to Quick Collection   All 8 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/309368
Description: The Shadow Semantics (Morgan, Math Prog Construction, vol 4014, pp 359-378, 2006; Morgan, Sci Comput Program 74(8):629-653, 2009) is a possibilistic (qualitative) model for noninterference security. S ... More
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/149146
Description: A truly secure protocol is one which never violates its security requirements, no matter how bizarre the circumstances, provided those circumstances are within its terms of reference. Such cast-iron g ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/120153
Description: Chaum’s Dining Cryptographers protocol crystallises the essentials of security just as other famous diners once demonstrated deadlock and livelock: it is a benchmark for security models and their asso ... More
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148339
Description: We consider the issue of finding and presenting counterexamples to a claim “this spec is implemented by that imp”, that is spec⊑imp (refinement), in the context of probabilistic systems: using a geome ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/81836
Description: We propose a method for verification of probabilistic distributed systems in which a variation of Kozen’s Kleene Algebra with Tests [Dexter Kozen, Kleene algebra with tests, ACM Trans. Programming Lan ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/14605
Description: Formal proofs of functional correctness and rigorous analyses of fault tolerance have, traditionally, been separate processes. In the former a programming logic (proof) or computational model (model c ... More
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/12091
Description: We describe pKA, a probabilistic Kleene-style algebra, based on a well known model of probabilistic/demonic computation. Our technical aim is to express probabilistic versions of Cohen’s separation th ... More
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/9807
Description: The μ-calculus is a powerful tool for specifying and verifying transition systems, including those with demonic (universal) and angelic (existential) choice; its quantitative generalisation qMμ extend ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last