| 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 |
| scientific article; zbMATH DE number 7830381 (Why is no real title available?) | 2024-04-10 | Paper |
| Asynchronous $$\pi $$ -calculus at Work: The Call-by-Need Strategy | 2024-03-14 | Paper |
Playing with bisimulation in Erlang
Models, Languages, and Tools for Concurrent and Distributed Programming | 2024-02-23 | Paper |
On bisimulations for the asynchronous π-calculus
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
An investigation into functions as processes
Lecture Notes in Computer Science | 2023-04-28 | Paper |
From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
Lecture Notes in Computer Science | 2022-11-02 | Paper |
πI: A symmetric calculus based on internal mobility
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
| scientific article; zbMATH DE number 7559490 (Why is no real title available?) | 2022-07-18 | Paper |
Eager functions as processes
Theoretical Computer Science | 2022-04-07 | Paper |
| scientific article; zbMATH DE number 7447778 (Why is no real title available?) | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7407797 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407797 (Why is no real title available?) | 2021-10-08 | Paper |
| Light logics and higher-order processes | 2021-02-24 | Paper |
Light logics and higher-order processes
(available as arXiv preprint) | 2021-02-24 | Paper |
Eager functions as processes
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Unique solutions of contractions, CCS, and their HOL formalisation
Information and Computation | 2020-12-15 | Paper |
| Divergence and unique solution of equations | 2020-05-27 | Paper |
Towards `up to context' reasoning about higher-order processes
Theoretical Computer Science | 2020-01-22 | Paper |
Bisimulation and coinduction enhancements: a historical perspective
Formal Aspects of Computing | 2019-12-18 | Paper |
Barbed bisimulation
Automata, Languages and Programming | 2019-12-04 | Paper |
Divergence and unique solution of equations
(available as arXiv preprint) | 2019-08-13 | Paper |
| scientific article; zbMATH DE number 7015117 (Why is no real title available?) | 2019-02-07 | Paper |
Internal mobility and agent-passing calculi
Automata, Languages and Programming | 2019-01-10 | Paper |
Trees from functions as processes
(available as arXiv preprint) | 2018-09-06 | Paper |
The name discipline of uniform receptiveness (extended abstract)
Automata, Languages and Programming | 2018-07-04 | Paper |
On the discriminating power of passivation and higher-order interaction
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
A fully abstract semantics for causality in the π-calculus
STACS 95 | 2017-12-04 | Paper |
Session types revisited
Information and Computation | 2017-09-28 | Paper |
Equations, contractions, and unique solutions
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Name-passing calculi: from fusions to preorders and types
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Light logics and higher-order processes
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Name-passing calculi: from fusions to preorders and types
Information and Computation | 2016-11-18 | Paper |
Environmental bisimulations for probabilistic higher-order languages
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Equations, contractions, and unique solutions
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
The proof technique of unique solutions of contractions
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
On applicative similarity, sequentiality, and full abstraction
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
Advanced Information Systems Engineering | 2015-09-11 | Paper |
Symmetries and Dualities in Name-Passing Process Calculi
Computing with New Resources | 2015-09-08 | Paper |
Bisimulation and co-induction: some problems
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Extensionality and intensionality of the ambient logics
Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Trees from functions as processes
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Bisimulations up-to: beyond first-order transition systems
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Enhancements of the bisimulation proof method
Advanced Topics in Bisimulation and Coinduction | 2014-04-25 | Paper |
Origins of bisimulation and coinduction
Advanced Topics in Bisimulation and Coinduction | 2014-04-24 | Paper |
On coinductive equivalences for higher-order probabilistic functional programs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| Towards a calculus for wireless systems | 2013-10-10 | Paper |
Duality and i/o-types in the \(\pi \)-calculus
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Strong normalisation in \(\lambda \)-calculi with references
Fundamentals of Software Engineering | 2012-06-29 | Paper |
| Introduction to bisimulation and coinduction | 2012-03-07 | Paper |
On the expressiveness and decidability of higher-order process calculi
Information and Computation | 2011-02-21 | Paper |
Termination in higher-order concurrent calculi
The Journal of Logic and Algebraic Programming | 2010-10-22 | Paper |
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
Automata, Languages and Programming | 2010-09-07 | Paper |
Termination in impure concurrent languages
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
On the proof method for bisimulation
Lecture Notes in Computer Science | 2010-06-17 | Paper |
An operational semantics for a calculus for wireless systems
Theoretical Computer Science | 2010-04-22 | Paper |
Termination in higher-order concurrent calculi
Fundamentals of Software Engineering | 2010-01-28 | Paper |
Mobile Processes and Termination
Semantics and Algebraic Specification | 2009-10-22 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Separability in the Ambient Logic
Logical Methods in Computer Science | 2008-11-13 | Paper |
A Hybrid Type System for Lock-Freedom of Mobile Processes
Computer Aided Verification | 2008-07-15 | Paper |
Logical Bisimulations and Functional Languages
Lecture Notes in Computer Science | 2008-07-01 | Paper |
On the Expressiveness of the Ambient Logic
Logical Methods in Computer Science | 2007-10-11 | Paper |
Beyond Bisimulation: The “up-to” Techniques
Formal Methods for Components and Objects | 2007-09-11 | Paper |
An efficient abstract machine for safe ambients
The Journal of Logic and Algebraic Programming | 2007-05-23 | Paper |
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM | 2006-09-12 | Paper |
Ensuring termination by typability
Information and Computation | 2006-08-16 | Paper |
Termination of processes
Mathematical Structures in Computer Science | 2006-05-22 | Paper |
Towards an algebraic theory of typed mobile processes
Theoretical Computer Science | 2006-03-20 | Paper |
Safe ambients: Abstract machine and distributed implementation
Science of Computer Programming | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2163050 (Why is no real title available?) | 2005-04-29 | Paper |
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science | 2005-02-28 | Paper |
On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
Theoretical Computer Science | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 1927554 (Why is no real title available?) | 2003-06-12 | Paper |
A partition refinement algorithm for the \(\pi\)-calculus
Information and Computation | 2003-01-14 | Paper |
Imperative objects as mobile processes
Science of Computer Programming | 2002-10-16 | Paper |
| scientific article; zbMATH DE number 1754608 (Why is no real title available?) | 2002-06-12 | Paper |
A fully abstract model for the \(\pi\)-calculus.
Information and Computation | 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
Theoretical Computer Science | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1479626 (Why is no real title available?) | 2000-07-20 | Paper |
The name discipline of uniform receptiveness
Theoretical Computer Science | 2000-01-12 | Paper |
From λ to π; or, Rediscovering continuations
Mathematical Structures in Computer Science | 1999-11-25 | Paper |
An interpretation of typed objects into typed \(\pi\)-calculus
Information and Computation | 1999-06-21 | Paper |
On the bisimulation proof method
Mathematical Structures in Computer Science | 1999-03-22 | Paper |
A fully abstract semantics for causality in the \(\pi\)-calculus
Acta Informatica | 1999-03-14 | Paper |
On bisimulations for the asynchronous \(\pi\)-calculus
Theoretical Computer Science | 1999-01-20 | Paper |
| scientific article; zbMATH DE number 1223739 (Why is no real title available?) | 1998-11-15 | Paper |
Some congruence properties for \(\pi\)-calculus bisimilarities
Theoretical Computer Science | 1998-08-13 | Paper |
Bisimulation for higher-order process calculi
Information and Computation | 1997-11-18 | Paper |
\(\pi\)-calculus, internal mobility, and agent-passing calculi
Theoretical Computer Science | 1997-02-27 | Paper |
Locality and interleaving semantics in calculi for mobile processes
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 954809 (Why is no real title available?) | 1996-12-08 | Paper |
Algebraic theories for name-passing calculi
Information and Computation | 1996-05-02 | Paper |
A theory of bisimulation for the \(\pi\)-calculus
Acta Informatica | 1995-11-15 | Paper |
The lazy lambda calculus in a concurrency scenario
Information and Computation | 1995-01-22 | Paper |
Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
Acta Informatica | 1994-05-10 | Paper |
| scientific article; zbMATH DE number 139810 (Why is no real title available?) | 1993-03-28 | Paper |
SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4215381 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4126708 (Why is no real title available?) | 1989-01-01 | Paper |
