| Publication | Date of Publication | Type |
|---|
A logical account of subtyping for session types
Journal of Logical and Algebraic Methods in Programming | 2024-10-08 | Paper |
| Diamonds for security: a non-interleaving operational semantics for the applied \(\pi\)-calculus | 2024-08-13 | Paper |
| A graphical proof theory of logical time | 2024-05-27 | Paper |
Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
(available as arXiv preprint) | 2024-02-06 | Paper |
| Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus | 2024-02-06 | 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 |
An Analytic Propositional Proof System on Graphs
Logical Methods in Computer Science | 2023-01-09 | Paper |
| scientific article; zbMATH DE number 7559468 (Why is no real title available?) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559289 (Why is no real title available?) | 2022-07-18 | Paper |
| Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity | 2022-03-31 | Paper |
scientific article; zbMATH DE number 7407774 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407774 (Why is no real title available?) | 2021-10-08 | Paper |
scientific article; zbMATH DE number 7379295 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-05 | Paper |
Logic beyond formulas: a proof system on graphs
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Quasi-open bisimilarity with mismatch is intuitionistic
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| A characterisation of open bisimilarity using an intuitionistic modal logic | 2020-05-27 | Paper |
Global types with internal delegation
Theoretical Computer Science | 2020-01-22 | Paper |
De Morgan dual nominal quantifiers modelling private names in non-commutative logic
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
De Morgan dual nominal quantifiers modelling private names in non-commutative logic
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Constructing weak simulations from linear implications for processes with private names
Mathematical Structures in Computer Science | 2019-10-09 | Paper |
The consistency and complexity of multiplicative additive system virtual
Scientific Annals of Computer Science | 2019-02-08 | Paper |
| scientific article; zbMATH DE number 6851953 (Why is no real title available?) | 2018-03-21 | Paper |
Semantics for specialising attack trees based on linear logic
Fundamenta Informaticae | 2018-01-05 | Paper |
Behavioural analysis of sessions using the calculus of structures
Lecture Notes in Computer Science | 2016-12-21 | Paper |
A descriptive type foundation for RDF Schema
Journal of Logical and Algebraic Methods in Programming | 2016-08-18 | Paper |
Descriptive types for linked data resources
Lecture Notes in Computer Science | 2015-12-03 | Paper |
Minimal type inference for linked data consumers
Journal of Logical and Algebraic Methods in Programming | 2015-06-15 | Paper |
Tracing where and who provenance in linked data: a calculus
Theoretical Computer Science | 2013-01-07 | Paper |
