• Publications
  • Influence
Abstraction, Refinement and Proof for Probabilistic Systems
TLDR
Probabilistic guarded commands and their refinement logic.- to pGCL: Its logic and its model. Expand
  • 355
  • 50
  • PDF
Probabilistic predicate transformers
TLDR
Probabilistic predicates generalize standard predicates over a state space; with Probabilistic predicate transformers one thus reasons about imperative programs in terms of probabilistic pre- and postconditions. Expand
  • 313
  • 18
  • PDF
Partial correctness for probabilistic demonic programs
TLDR
We provide an operational and axiomatic framework for both partial and total correctness of probabilistic and demonic sequential programs; among other things, that provides the theory to support our earlier---and practical---publication on demonic nondeterminism. Expand
  • 52
  • 10
  • PDF
Probabilistic Models for the Guarded Command Language
TLDR
We provide two different semantics for an extension of Dijkstra's language of guarded commands and give two alternative semantic models for this language. Expand
  • 177
  • 9
  • PDF
Results on the quantitative μ-calculus qMμ
TLDR
The μ-calculus is a powerful tool for specifying and verifying transition systems, including those with both demonic (universal) and angelic (existential) choice; its quantitative generalization qMμ extends to include probabilistic choice. Expand
  • 57
  • 8
Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods
TLDR
We present a constraint-based method for automatically generating quantitative invariants for linear probabilistic programs, and we show how it can be used, in combination with proof-based methods, to verify properties of probabilism programs that cannot be analysed using existing automated methods. Expand
  • 70
  • 6
Using Probabilistic Kleene Algebra for Protocol Verification
TLDR
We describe pKA, a probabilistic Kleene-style algebra, based on a well known model of probabilism/demonic computation [3,16,10]. Expand
  • 41
  • 6
  • PDF
Compositional Closure for Bayes Risk in Probabilistic Noninterference
TLDR
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 consistent with an "elementary" order based on Bayes Risk. Expand
  • 69
  • 5
  • PDF
Automated Analysis of AODV Using UPPAAL
TLDR
This paper describes an automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in wireless mesh networks. Expand
  • 66
  • 5
  • PDF