| Publication | Date of Publication | Type |
|---|
| A graphical proof theory of logical time | 2024-05-27 | Paper |
| A proof assistant for PSF | 2024-04-29 | Paper |
Refinement in Interworkings
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
Theoretical Computer Science | 2023-05-12 | Paper |
Active Re-identification Attacks on Periodically Released Dynamic Social Graphs
1511.94073 | 2022-12-22 | Paper |
| Automated identification of desynchronisation attacks on shared secrets | 2022-08-25 | Paper |
| Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity | 2022-03-31 | Paper |
A formalization of anonymity and onion routing
Computer Security – ESORICS 2004 | 2022-03-07 | Paper |
scientific article; zbMATH DE number 7379295 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-05 | Paper |
An algorithm for the asynchronous \textit{Write-All} problem based on process collision
Distributed Computing | 2020-12-03 | Paper |
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing | 2020-11-30 | Paper |
Semantics for specialising attack trees based on linear logic
Fundamenta Informaticae | 2018-01-05 | Paper |
Attack-defense trees
Journal Of Logic And Computation | 2014-04-01 | Paper |
Privacy and verifiability in voting systems: methods, developments and trends
Computer Science Review | 2014-01-29 | Paper |
| Analysing the BKE-security protocol with \(\mu\)CRL | 2013-10-02 | Paper |
| A syntactic criterion for injectivity of authentication protocols | 2013-09-26 | Paper |
Quantitative questions on attack-defense trees
Lecture Notes in Computer Science | 2013-06-04 | Paper |
Probabilistic model checking of the PDGF signaling pathway
Lecture Notes in Computer Science | 2013-04-03 | Paper |
Operational semantics and verification of security protocols.
Information Security and Cryptography | 2010-12-08 | Paper |
Attack-defense trees and two-player binary zero-sum extensive form games are equivalent
Lecture Notes in Computer Science | 2010-11-23 | Paper |
A formal framework for quantifying voter-controlled privacy
Journal of Algorithms | 2009-07-24 | Paper |
Formal Approaches to Software Testing
Lecture Notes in Computer Science | 2009-06-04 | Paper |
A framework for compositional verification of security protocols
Information and Computation | 2008-04-16 | Paper |
Task allocation in a multi-server system
Journal of Scheduling | 2007-12-20 | Paper |
Information Security and Cryptology - ICISC 2005
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Injective synchronisation: An extension of the authentication hierarchy
Theoretical Computer Science | 2007-01-09 | Paper |
A hierarchy of communication models for message sequence charts
Science of Computer Programming | 2002-10-16 | Paper |
Impossible futures and determinism
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1728523 (Why is no real title available?) | 2002-04-15 | Paper |
| A process algebra for interworkings. | 2001-01-01 | Paper |
UNIFORM ALGEBRAIC SPECIFICATIONS OF FINITE SETS WITH EQUALITY
International Journal of Foundations of Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4157900 (Why is no real title available?) | 1990-01-01 | Paper |
