| 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 |
| Generalised differential privacy for text document processing | 2023-11-24 | Paper |
| Formal analysis of the information leakage of the DC-nets and crowds anonymity protocols | 2022-11-04 | Paper |
| On Privacy and Accuracy in Data Releases (Invited Paper) | 2022-07-18 | Paper |
| Probabilistic concurrent Kleene algebra | 2021-06-09 | Paper |
| Processing text for privacy: an information flow perspective | 2021-05-04 | Paper |
| An algebraic approach for reasoning about information flow | 2021-05-04 | Paper |
| Quantitative Information Flow with Monads in Haskell | 2021-02-16 | Paper |
| An expectation transformer approach to predicate abstraction and data independence for probabilistic programs | 2021-02-16 | Paper |
| Experiments in information flow analysis | 2020-05-05 | Paper |
| Program algebra for quantitative information flow | 2019-06-20 | Paper |
| Abstract hidden Markov models: a monadic account of quantitative information flow | 2019-05-17 | Paper |
| Schedulers and finishers: on generating and filtering the behaviours of an event structure | 2018-09-24 | Paper |
| Abstract hidden Markov models: a monadic account of quantitative information flow | 2018-04-23 | Paper |
| Algebra for quantitative information flow | 2017-07-21 | Paper |
| Results on the quantitative \(\mu\)-calculus \(qM\mu\) | 2017-07-12 | Paper |
| A Kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism | 2017-05-16 | Paper |
| Probabilistic rely-guarantee calculus | 2017-02-06 | Paper |
| Schedulers and finishers: on generating the behaviours of an event structure | 2016-12-21 | Paper |
| Conditioning in probabilistic programming | 2016-12-16 | Paper |
| Hidden-Markov program algebra with iteration | 2016-07-27 | Paper |
| Abstractions of non-interference security: probabilistic versus possibilistic | 2015-03-25 | Paper |
| Hopscotch -- reaching the target hop by hop | 2014-09-08 | Paper |
| An event structure model for probabilistic concurrent Kleene algebra | 2014-01-17 | Paper |
| Memoryless strategies for stochastic games via domain theory | 2013-09-26 | Paper |
| Probabilistic guarded commands mechanized in HOL | 2013-09-20 | Paper |
| A generalisation of stationary distributions, and probabilistic program algebra | 2013-04-26 | Paper |
| Compositional refinement in agent-based security protocols | 2012-07-03 | Paper |
| A process algebra for wireless mesh networks | 2012-06-22 | Paper |
| Towards an algebra of routing tables | 2011-06-17 | Paper |
| On probabilistic Kleene algebras, automata and simulations | 2011-06-17 | Paper |
| The Thousand-and-One Cryptographers | 2010-10-26 | Paper |
| Linear-invariant generation for probabilistic programs: automated support for proof-based methods | 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 |
| The Secret Art of Computer Programming | 2009-08-20 | Paper |
| Quantitative μ-Calculus Analysis of Power Management in Wireless Networks | 2008-09-11 | Paper |
| Towards Automated Proof Support for Probabilistic Distributed Systems | 2008-05-27 | Paper |
| FM 2005: Formal Methods | 2006-01-10 | Paper |
| Probabilistic guarded commands mechanized in HOL | 2005-12-29 | Paper |
| ZB 2005: Formal Specification and Development in Z and B | 2005-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4658722 | 2005-03-18 | 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 |
| Quantitative program logic and expected time bounds in probabilistic distributed algorithms. | 2002-07-15 | 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 |
| Demonic, angelic and unbounded probabilistic choices in sequential programs | 2001-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4255558 | 1999-08-17 | 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 |
| Probabilistic models for the guarded command language | 1997-06-16 | Paper |
| Refinement-oriented probability for CSP | 1997-03-31 | Paper |
| Unifying wp and wlp | 1997-02-27 | Paper |
| Finitely generated non-Hopf modules | 1990-01-01 | Paper |
| ENUMERATING FINITE GROUPS | 1987-01-01 | Paper |
