| Publication | Date of Publication | Type |
|---|
A generic type system for higher-order \(\Psi\)-calculi
Information and Computation | 2024-10-08 | Paper |
| Silence is golden: Branching bisimilarity is decidable for context-free processes | 2024-04-29 | Paper |
A generic type system for higher-order \(\Psi\)-calculi
(available as arXiv preprint) | 2024-02-06 | Paper |
| A generic type system for higher-order \(\Psi\)-calculi | 2024-02-06 | Paper |
| scientific article; zbMATH DE number 7447771 (Why is no real title available?) | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7447771 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-17 | Paper |
| Using session types for reasoning about boundedness in the \(\pi\)-calculus | 2021-12-08 | Paper |
Behavioural types for memory and method safety in a core object-oriented language
(available as arXiv preprint) | 2021-07-08 | Paper |
Using session types for reasoning about boundedness in the \(\pi\)-calculus
Acta Informatica | 2020-12-16 | Paper |
Binary session types for psi-calculi
Programming Languages and Systems | 2016-12-21 | Paper |
Types for resources in \(\psi\)-calculi
Trustworthy Global Computing | 2016-11-09 | Paper |
A logical characterisation of static equivalence
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Verification of correspondence assertions in a calculus for mobile ad hoc networks
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Decidable fragments of a higher order calculus with locations
Electronic Notes in Theoretical Computer Science | 2014-07-23 | Paper |
Type Inference for Correspondence Types
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
Types for access control in a calculus of mobile resources
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
| Deciding framed bisimilarity | 2013-08-16 | Paper |
Modal logics for cryptographic processes
Electronic Notes in Theoretical Computer Science | 2013-08-15 | Paper |
Type-based automated verification of authenticity in asymmetric cryptographic protocols
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Typed ψ-calculi
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
| Transitions and trees. An introduction to structural operational semantics. | 2010-05-17 | Paper |
Undecidable equivalences for basic parallel processes
Information and Computation | 2009-07-15 | Paper |
Decidability issues for extended ping-pong protocols
Journal of Automated Reasoning | 2007-01-30 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Aliasing models for mobile objects
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1507234 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1479629 (Why is no real title available?) | 2000-07-20 | Paper |
| scientific article; zbMATH DE number 1231588 (Why is no real title available?) | 1998-12-21 | Paper |
Actions speak louder than words: proving bisimilarity for context-free processes
Journal Of Logic And Computation | 1998-09-27 | Paper |
Undecidable equivalences for basic process algebra
Information and Computation | 1995-02-16 | Paper |
SnS can be modally characterized
Theoretical Computer Science | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4118343 (Why is no real title available?) | 1989-01-01 | Paper |
