| Publication | Date of Publication | Type |
|---|
Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts
Lecture Notes in Computer Science | 2023-11-24 | 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 |
| Termination in a \(\pi\)-calculus with subtyping | 2021-03-10 | Paper |
Termination in a \(\pi\)-calculus with subtyping
(available as arXiv preprint) | 2021-03-10 | Paper |
Eager functions as processes
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | 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 |
Divergence and unique solution of equations
(available as arXiv preprint) | 2019-08-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 |
Termination in a \(\pi\)-calculus with subtyping
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 |
A behavioural theory for a \(\pi\)-calculus with preorders
Fundamentals of Software Engineering | 2015-12-11 | Paper |
A behavioural theory for a \(\pi\)-calculus with preorders
Journal of Logical and Algebraic Methods in Programming | 2015-11-10 | Paper |
Symmetries and Dualities in Name-Passing Process Calculi
Computing with New Resources | 2015-09-08 | 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 |
Termination in higher-order concurrent calculi
The Journal of Logic and Algebraic Programming | 2010-10-22 | Paper |
On Bisimilarity and Substitution in Presence of Replication
Automata, Languages and Programming | 2010-09-07 | Paper |
Termination in impure concurrent languages
CONCUR 2010 - Concurrency Theory | 2010-08-31 | 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 Distribution Law for CCS and a New Congruence Result for the pi-calculus
Logical Methods in Computer Science | 2008-08-07 | Paper |
On the Expressiveness of the Ambient Logic
Logical Methods in Computer Science | 2007-10-11 | Paper |
A Distribution Law for CCS and a New Congruence Result for the π-Calculus
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
An efficient abstract machine for safe ambients
The Journal of Logic and Algebraic Programming | 2007-05-23 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
Theoretical Computer Science | 2005-02-22 | Paper |
A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis
Journal of Functional Programming | 2004-03-17 | Paper |
| scientific article; zbMATH DE number 2044493 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1927569 (Why is no real title available?) | 2003-06-12 | Paper |
| scientific article; zbMATH DE number 1701361 (Why is no real title available?) | 2002-02-05 | Paper |
Bisimulation verification using the up to techniques
International Journal on Software Tools for Technology Transfer. STTT | 2002-01-23 | Paper |
| scientific article; zbMATH DE number 1082078 (Why is no real title available?) | 1998-03-23 | Paper |
