| Publication | Date of Publication | Type |
|---|
| Saturating automata for game semantics | 2026-04-02 | Paper |
| Probabilistic verification beyond context-freeness | 2024-12-06 | Paper |
| Deconstructing general references via game semantics | 2024-10-01 | Paper |
Bisimilarity distances for approximate differential privacy
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
| Asymmetric Distances for Approximate Differential Privacy | 2023-02-03 | Paper |
Game Semantics for Interface Middleweight Java
Journal of the ACM | 2022-12-08 | Paper |
The big-O problem
(available as arXiv preprint) | 2022-08-02 | Paper |
| The big-O problem | 2022-08-02 | Paper |
| scientific article; zbMATH DE number 7561694 (Why is no real title available?) | 2022-07-21 | Paper |
| The big-O problem for labelled Markov chains and weighted automata | 2022-07-18 | Paper |
Leafy automata for higher-order concurrency
(available as arXiv preprint) | 2021-10-18 | Paper |
Complete trace models of state and control
(available as arXiv preprint) | 2021-10-18 | Paper |
| Polynomial-time equivalence testing for deterministic fresh-register automata | 2021-08-04 | Paper |
| Higher-order linearisability | 2020-05-27 | Paper |
Higher-order linearisability
Journal of Logical and Algebraic Methods in Programming | 2019-06-20 | Paper |
Algorithmic games for full ground references
Formal Methods in System Design | 2018-07-16 | Paper |
Bisimilarity in Fresh-Register Automata
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Bisimilarity of pushdown automata is nonelementary
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Reachability in pushdown register automata
Journal of Computer and System Sciences | 2017-05-24 | Paper |
Block structure vs scope extrusion: between innocence and omniscience
Logical Methods in Computer Science | 2017-04-11 | Paper |
| Böhm trees as higher-order recursion schemes | 2017-02-21 | Paper |
Full abstraction without synchronization primitives
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
Contextual approximation and higher-order procedures
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Weak and nested class memory automata
Language and Automata Theory and Applications | 2016-04-08 | Paper |
A contextual equivalence checker for IMJ*
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
Game semantic analysis of equivalence in IMJ
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
Reachability in pushdown register automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Algorithmic probabilistic game semantics. Playing games with automata
Formal Methods in System Design | 2014-06-30 | Paper |
Game semantics for nominal exceptions
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Game semantics for interface middleweight Java
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Full abstraction for Reduced ML
Annals of Pure and Applied Logic | 2013-12-19 | Paper |
Towards nominal Abramsky
Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky | 2013-05-28 | Paper |
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Logical Methods in Computer Science | 2013-04-09 | Paper |
Three tokens in Herman's algorithm
Formal Aspects of Computing | 2013-03-22 | Paper |
Deconstructing general references via game semantics
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Algorithmic games for full ground references
Automata, Languages, and Programming | 2012-11-01 | Paper |
On the Complexity of the Equivalence Problem for Probabilistic Automata
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
On stabilization in Herman's algorithm
Automata, Languages and Programming | 2011-07-07 | Paper |
Algorithmic nominal game semantics
Programming Languages and Systems | 2011-05-19 | Paper |
Block structure vs. scope extrusion: between innocence and omniscience
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Full Abstraction for Reduced ML
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Bad Variables Under Control
Computer Science Logic | 2009-03-05 | Paper |
Angelic semantics of fine-grained concurrency
Annals of Pure and Applied Logic | 2008-03-06 | Paper |
Third-order Idealized Algol with iteration is decidable
Theoretical Computer Science | 2008-03-05 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Games for complexity of second-order call-by-name programs
Theoretical Computer Science | 2005-10-26 | Paper |
Functions with local state: regularity and undecidability
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2086512 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1722664 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1670494 (Why is no real title available?) | 2001-12-03 | Paper |
