| Publication | Date of Publication | Type |
|---|
| Towards generalised half-duplex systems | 2024-12-06 | Paper |
| Weakly synchronous systems with three machines are Turing powerful | 2024-10-23 | Paper |
| Synchronizability of communicating finite state machines is not decidable | 2024-01-16 | Paper |
| Guessing the Buffer Bound for k-Synchronizability | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134258 | 2023-08-21 | Paper |
| Internal Calculi for Separation Logic | 2023-02-07 | Paper |
| Multiparty half-duplex systems and synchronous communications | 2023-02-03 | Paper |
| Guessing the buffer bound for k-synchronizability | 2022-03-22 | Paper |
| Multi-buffer simulations for trace language inclusion | 2021-12-07 | Paper |
| A type-directed negation elimination | 2021-12-02 | Paper |
| A complete axiomatisation for quantifier-free separation logic | 2021-10-08 | Paper |
| Buffered simulation games for Büchi automata | 2021-06-22 | Paper |
| The complexity of model-checking tail-recursive higher-order fixpoint logic | 2021-05-21 | Paper |
| Model-checking process equivalences | 2021-04-27 | Paper |
| Model-checking the higher-dimensional modal \(\mu\)-calculus | 2021-03-17 | Paper |
| On Symbolic Heaps Modulo Permission Theories | 2020-11-25 | Paper |
| On the \(k\)-synchronizability of systems | 2020-09-23 | Paper |
| Synchronizability of communicating finite state machines is not decidable | 2020-05-27 | Paper |
| Shared contract-obedient endpoints | 2020-01-10 | Paper |
| Multi-buffer simulations: decidability and complexity | 2018-09-27 | Paper |
| The effects of adding reachability predicates in propositional separation logic | 2018-07-17 | Paper |
| Space-efficient fragments of higher-order fixpoint logic | 2017-12-20 | Paper |
| On the relationship between higher-order recursion schemes and higher-order fixpoint logic | 2017-10-20 | Paper |
| Conjunctive visibly-pushdown path queries | 2015-09-29 | Paper |
| Model-checking process equivalences | 2014-12-02 | Paper |
| Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic | 2014-09-15 | Paper |
| Adjuncts elimination in the static ambient logic | 2013-09-09 | Paper |
| Revealing vs. concealing: more simulation games for Büchi inclusion | 2013-03-18 | Paper |
| On the almighty wand | 2012-05-24 | Paper |
| Reasoning about sequences of memory states | 2011-08-26 | Paper |
| A spatial equational logic for the applied \(\pi \)-calculus | 2010-09-09 | Paper |
| Towards Model-Checking Programs with Lists | 2009-11-12 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Beyond Shapes: Lists with Ordered Data | 2009-03-31 | Paper |
| A Spatial Equational Logic for the Applied π-Calculus | 2008-11-25 | Paper |
| On the Almighty Wand | 2008-11-20 | Paper |
| Separability in the Ambient Logic | 2008-11-13 | Paper |
| Reasoning About Sequences of Memory States | 2008-01-04 | Paper |
| On the Expressiveness of the Ambient Logic | 2007-10-11 | Paper |
| Elimination of quantifiers and undecidability in spatial logics for concurrency | 2006-09-13 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| Elimination of spatial connectives in static spatial logics | 2005-02-22 | Paper |
