| Publication | Date of Publication | Type |
|---|
| Enhanced induction in behavioural relations (invited talk) | 2024-09-25 | Paper |
| CONCUR test-of-time award 2022 (invited paper) | 2024-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6124960 | 2024-04-10 | Paper |
| Asynchronous $$\pi $$ -calculus at Work: The Call-by-Need Strategy | 2024-03-14 | Paper |
| Playing with bisimulation in Erlang | 2024-02-23 | Paper |
| On bisimulations for the asynchronous π-calculus | 2023-06-28 | Paper |
| An investigation into functions as processes | 2023-04-28 | Paper |
| From π-calculus to higher-order π-calculus — and back | 2022-11-02 | Paper |
| πI: A symmetric calculus based on internal mobility | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089301 | 2022-07-18 | Paper |
| Eager functions as processes | 2022-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384919 | 2021-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155688 | 2021-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4963998 | 2021-02-24 | Paper |
| Eager Functions as Processes | 2021-01-20 | Paper |
| Unique solutions of contractions, CCS, and their HOL formalisation | 2020-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111623 | 2020-05-27 | Paper |
| Towards `up to context' reasoning about higher-order processes | 2020-01-22 | Paper |
| Bisimulation and coinduction enhancements: a historical perspective | 2019-12-18 | Paper |
| Barbed bisimulation | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5228882 | 2019-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4619824 | 2019-02-07 | Paper |
| Internal mobility and agent-passing calculi | 2019-01-10 | Paper |
| Trees from Functions as Processes | 2018-09-06 | Paper |
| The name discipline of uniform receptiveness (extended abstract) | 2018-07-04 | Paper |
| On the discriminating power of passivation and higher-order interaction | 2018-04-23 | Paper |
| A fully abstract semantics for causality in the π-calculus | 2017-12-04 | Paper |
| Session types revisited | 2017-09-28 | Paper |
| Equations, Contractions, and Unique Solutions | 2017-07-13 | Paper |
| Name-Passing Calculi: From Fusions to Preorders and Types | 2017-07-03 | Paper |
| Light logics and higher-order processes | 2017-04-04 | Paper |
| Name-passing calculi: from fusions to preorders and types | 2016-11-18 | Paper |
| Environmental bisimulations for probabilistic higher-order languages | 2016-10-24 | Paper |
| Equations, contractions, and unique solutions | 2016-09-29 | Paper |
| The Proof Technique of Unique Solutions of Contractions | 2016-02-25 | Paper |
| On Applicative Similarity, Sequentiality, and Full Abstraction | 2015-11-04 | Paper |
| Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) | 2015-09-11 | Paper |
| Symmetries and Dualities in Name-Passing Process Calculi | 2015-09-08 | Paper |
| Bisimulation and Co-induction: Some Problems | 2015-07-10 | Paper |
| Extensionality and intensionality of the ambient logics | 2015-03-17 | Paper |
| Controlling interference in ambients | 2015-03-17 | Paper |
| Trees from Functions as Processes | 2014-09-15 | Paper |
| Bisimulations Up-to: Beyond First-Order Transition Systems | 2014-09-15 | Paper |
| Enhancements of the bisimulation proof method | 2014-04-25 | Paper |
| Origins of bisimulation and coinduction | 2014-04-24 | Paper |
| On coinductive equivalences for higher-order probabilistic functional programs | 2014-04-10 | Paper |
| Towards a calculus for wireless systems | 2013-10-10 | Paper |
| Duality and i/o-Types in the π-Calculus | 2012-09-25 | Paper |
| Strong Normalisation in λ-Calculi with References | 2012-06-29 | Paper |
| Introduction to Bisimulation and Coinduction | 2012-03-07 | Paper |
| On the expressiveness and decidability of higher-order process calculi | 2011-02-21 | Paper |
| Termination in higher-order concurrent calculi | 2010-10-22 | Paper |
| On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi | 2010-09-07 | Paper |
| Termination in Impure Concurrent Languages | 2010-08-31 | Paper |
| On the proof method for bisimulation | 2010-06-17 | Paper |
| An operational semantics for a calculus for wireless systems | 2010-04-22 | Paper |
| Termination in Higher-Order Concurrent Calculi | 2010-01-28 | Paper |
| Mobile Processes and Termination | 2009-10-22 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Separability in the Ambient Logic | 2008-11-13 | Paper |
| A Hybrid Type System for Lock-Freedom of Mobile Processes | 2008-07-15 | Paper |
| Logical Bisimulations and Functional Languages | 2008-07-01 | Paper |
| On the Expressiveness of the Ambient Logic | 2007-10-11 | Paper |
| Beyond Bisimulation: The “up-to” Techniques | 2007-09-11 | Paper |
| An efficient abstract machine for safe ambients | 2007-05-23 | Paper |
| Behavioral equivalence in the polymorphic pi-calculus | 2006-09-12 | Paper |
| Ensuring termination by typability | 2006-08-16 | Paper |
| Termination of processes | 2006-05-22 | Paper |
| Towards an algebraic theory of typed mobile processes | 2006-03-20 | Paper |
| Safe ambients: Abstract machine and distributed implementation | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673437 | 2005-04-29 | Paper |
| On asynchrony in name-passing calculi | 2005-02-28 | Paper |
| On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484478 | 2003-06-12 | Paper |
| A partition refinement algorithm for the \(\pi\)-calculus | 2003-01-14 | Paper |
| Imperative objects as mobile processes | 2002-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535034 | 2002-06-12 | Paper |
| A fully abstract model for the \(\pi\)-calculus. | 2002-01-01 | Paper |
| The \(\pi\)-calculus: A theory of mobile processes | 2001-08-15 | Paper |
| Asynchronous process calculi: The first- and higher-order paradigms | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4490739 | 2000-07-20 | Paper |
| The name discipline of uniform receptiveness | 2000-01-12 | Paper |
| From λ to π; or, Rediscovering continuations | 1999-11-25 | Paper |
| An interpretation of typed objects into typed \(\pi\)-calculus | 1999-06-21 | Paper |
| On the bisimulation proof method | 1999-03-22 | Paper |
| A fully abstract semantics for causality in the \(\pi\)-calculus | 1999-03-14 | Paper |
| On bisimulations for the asynchronous \(\pi\)-calculus | 1999-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219055 | 1998-11-15 | Paper |
| Some congruence properties for \(\pi\)-calculus bisimilarities | 1998-08-13 | Paper |
| Bisimulation for higher-order process calculi | 1997-11-18 | Paper |
| \(\pi\)-calculus, internal mobility, and agent-passing calculi | 1997-02-27 | Paper |
| Locality and interleaving semantics in calculi for mobile processes | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3837262 | 1996-12-08 | Paper |
| Algebraic theories for name-passing calculi | 1996-05-02 | Paper |
| A theory of bisimulation for the \(\pi\)-calculus | 1995-11-15 | Paper |
| The lazy lambda calculus in a concurrency scenario | 1995-01-22 | Paper |
| Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata | 1994-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028142 | 1993-03-28 | Paper |
| SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361899 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206409 | 1989-01-01 | Paper |
