| Publication | Date of Publication | Type |
|---|
| Proving that programs are differentially private | 2024-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6124928 | 2024-04-10 | Paper |
| Categorical Information Flow | 2024-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4965811 | 2021-03-10 | Paper |
| Quantitative Information Flow with Monads in Haskell | 2021-02-16 | Paper |
| Program algebra for quantitative information flow | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376651 | 2019-05-17 | Paper |
| Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow | 2018-04-23 | Paper |
| A demonic lattice of information | 2018-03-26 | Paper |
| Algebra for Quantitative Information Flow | 2017-07-21 | Paper |
| Results on the quantitative μ-calculus qM μ | 2017-07-12 | Paper |
| A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism | 2017-05-16 | Paper |
| Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency | 2016-10-27 | Paper |
| How to Brew-up a Refinement Ordering | 2016-08-01 | Paper |
| Hidden-Markov program algebra with iteration | 2016-07-27 | Paper |
| Abstractions of non-interference security: probabilistic versus possibilistic | 2015-03-25 | Paper |
| Real-reward testing for probabilistic processes | 2014-06-06 | Paper |
| Remarks on testing probabilistic processes | 2013-12-06 | Paper |
| Memoryless strategies for stochastic games via domain theory | 2013-09-26 | Paper |
| Probabilistic guarded commands mechanized in HOL | 2013-09-20 | Paper |
| Elementary Probability Theory in the Eindhoven Style | 2012-09-05 | Paper |
| Compositional refinement in agent-based security protocols | 2012-07-03 | Paper |
| Compositional noninterference from first principles | 2012-07-03 | Paper |
| The Thousand-and-One Cryptographers | 2010-10-26 | Paper |
| Linear-Invariant Generation for Probabilistic Programs: | 2010-10-01 | Paper |
| Compositional Closure for Bayes Risk in Probabilistic Noninterference | 2010-09-07 | Paper |
| An elementary proof that Herman's ring is \(\Theta (N^{2})\) | 2009-12-04 | Paper |
| Testing Finitary Probabilistic Processes | 2009-10-22 | Paper |
| The shadow knows: refinement and security in sequential programs | 2009-07-24 | Paper |
| Characterising Testing Preorders for Finite Probabilistic Processes | 2009-04-29 | Paper |
| The Shadow Knows: Refinement of Ignorance in Sequential Programs | 2009-04-02 | Paper |
| Scalar Outcomes Suffice for Finitary Probabilistic Testing | 2007-09-04 | Paper |
| Probabilistic guarded commands mechanized in HOL | 2005-12-29 | Paper |
| Communicating Sequential Processes. The First 25 Years | 2005-11-29 | Paper |
| ZB 2005: Formal Specification and Development in Z and B | 2005-11-10 | Paper |
| ZB 2005: Formal Specification and Development in Z and B | 2005-11-10 | Paper |
| Abstraction, Refinement and Proof for Probabilistic Systems | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436971 | 2003-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436969 | 2003-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428307 | 2003-09-15 | Paper |
| Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL | 2003-07-01 | Paper |
| Partial correctness for probabilistic demonic programs | 2002-03-03 | Paper |
| Almost-certain eventualities and abstract probabilities in the temporal logic PTL | 2001-05-08 | Paper |
| Hierarchical reasoning in probabilistic CSP | 2001-04-26 | Paper |
| Demonic, angelic and unbounded probabilistic choices in sequential programs | 2001-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250666 | 1999-06-17 | Paper |
| An expectation-transformer model for probabilistic temporal logic | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370249 | 1998-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370248 | 1998-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370247 | 1998-01-14 | Paper |
| Refinement-oriented probability for CSP | 1997-03-31 | Paper |
| Unifying wp and wlp | 1997-02-27 | Paper |
| Exits in the refinement calculus | 1995-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4301161 | 1994-07-13 | Paper |
| A single complete rule for data refinement | 1993-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3996918 | 1993-01-23 | Paper |
| Data refinement of predicate transformers | 1992-06-26 | Paper |
| The specification statement | 1992-06-25 | Paper |
| Data refinement by calculation | 1990-01-01 | Paper |
| Types and invariants in the refinement calculus | 1990-01-01 | Paper |
| Auxiliary variables in data refinement | 1988-01-01 | Paper |
| Procedures, parameters, and abstraction: Separate concerns | 1988-01-01 | Paper |
| Laws of programming | 1987-01-01 | Paper |
| Corrigenda: laws of programming | 1987-01-01 | Paper |
| Specification statements and refinement | 1987-01-01 | Paper |
| Specification of the UNIX Filing System | 1984-01-01 | Paper |
