| 2026 | LICS | Unbounded Data Nesting for Loops in Higher-Order Programs. | Adriana Baldacchino, Andrzej S. Murawski |
| 2026 | LICS | Contextual MetaML: Syntax and Full Abstraction. | Haoxuan Yin, Andrzej S. Murawski, C.-H. Luke Ong |
| 2025 | LICS | Reachability Types, Traces and Full Abstraction. | Benedict Bunting, Andrzej S. Murawski |
| 2024 | LICS | Contextual Equivalence for State and Control via Nested Data. | Benedict Bunting, Andrzej S. Murawski |
| 2023 | LICS | Operational Algorithmic Game Semantics. | Benedict Bunting, Andrzej S. Murawski |
| 2022 | LICS | Probabilistic Verification Beyond Context-Freeness. | Guanyan Li, Andrzej S. Murawski, Luke Ong |
| 2021 | ESOP | Complete trace models of state and control. | Guilhem Jaber, Andrzej S. Murawski |
| 2021 | FOSSACS | Leafy automata for higher-order concurrency. | Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz |
| 2021 | LICS | Verifying higher-order concurrency with data automata. | Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz |
| 2021 | LICS | Compositional relational reasoning via operational game semantics. | Guilhem Jaber, Andrzej S. Murawski |
| 2020 | CONCUR | The Big-O Problem for Labelled Markov Chains and Weighted Automata. | Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser |
| 2019 | ATVA | DEQ: Equivalence Checker for Deterministic Register Automata. | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2019 | CONCUR | Asymmetric Distances for Approximate Differential Privacy. | Dmitry Chistikov, Andrzej S. Murawski, David Purser |
| 2019 | MFCS | On the Expressivity of Linear Recursion Schemes. | Pierre Clairambault, Andrzej S. Murawski |
| 2018 | ATVA | Bisimilarity Distances for Approximate Differential Privacy. | Dmitry Chistikov, Andrzej S. Murawski, David Purser |
| 2018 | MFCS | Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2017 | CONCUR | Higher-Order Linearisability. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2017 | ESOP | ML and Extended Branching VASS. | Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong |
| 2016 | FOSSACS | Contextual Approximation and Higher-Order Procedures. | Ranko Lazic, Andrzej S. Murawski |
| 2015 | ATVA | A Contextual Equivalence Checker for IMJ ∗. | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2015 | ATVA | Game Semantic Analysis of Equivalence in IMJ. | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2015 | FOSSACS | Fragments of ML Decidable by Nested Data Class Memory Automata. | Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong |
| 2015 | LATA | Weak and Nested Class Memory Automata. | Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong |
| 2015 | LICS | Bisimilarity in Fresh-Register Automata. | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2014 | FOSSACS | Game Semantics for Nominal Exceptions. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2014 | MFCS | Reachability in Pushdown Register Automata. | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2014 | POPL | Game semantics for interface middleweight Java. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2013 | FOSSACS | Deconstructing General References via Game Semantics. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2013 | LICS | Bisimilarity of Pushdown Automata is Nonelementary. | Michael Benedikt, Stefan Gller, Stefan Kiefer, Andrzej S. Murawski |
| 2012 | CAV | Hector: An Equivalence Checker for a Higher-Order Fragment of ML. | David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong |
| 2012 | CAV | APEX: An Analyzer for Open Probabilistic Programs. | Stefan Kiefer, Andrzej S. Murawski, Jol Ouaknine, Bjrn Wachter, James Worrell |
| 2012 | FOSSACS | On the Complexity of the Equivalence Problem for Probabilistic Automata. | Stefan Kiefer, Andrzej S. Murawski, Jol Ouaknine, Bjrn Wachter, James Worrell |
| 2012 | ICALP | Algorithmic Games for Full Ground References. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2011 | CAV | Language Equivalence for Probabilistic Automata. | Stefan Kiefer, Andrzej S. Murawski, Jol Ouaknine, Bjrn Wachter, James Worrell |
| 2011 | ESOP | Algorithmic Nominal Game Semantics. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2011 | ICALP | A Fragment of ML Decidable by Visibly Pushdown Automata. | David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong |
| 2011 | ICALP | On Stabilization in Herman's Algorithm. | Stefan Kiefer, Andrzej S. Murawski, Jol Ouaknine, James Worrell, Lijun Zhang |
| 2011 | LICS | Game Semantics for Good General References. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2010 | FOSSACS | Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2009 | FOSSACS | Full Abstraction for Reduced ML. | Andrzej S. Murawski, Nikos Tzevelekos |
| 2008 | LICS | Collapsible Pushdown Automata and Recursion Schemes. | Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre |
| 2008 | LICS | Reachability Games and Game Semantics: Comparing Nondeterministic Programs. | Andrzej S. Murawski |
| 2008 | TACAS | On Automated Verification of Probabilistic Programs. | Axel Legay, Andrzej S. Murawski, Jol Ouaknine, James Worrell |
| 2007 | CSL | Bad Variables Under Control. | Andrzej S. Murawski |
| 2006 | TACAS | Compositional Model Extraction for Higher-Order Concurrent Programs. | Dan R. Ghica, Andrzej S. Murawski |
| 2005 | CONCUR | On Probabilistic Program Equivalence and Refinement. | Andrzej S. Murawski, Jol Ouaknine |
| 2005 | FOSSACS | Third-Order Idealized Algol with Iteration Is Decidable. | Andrzej S. Murawski, Igor Walukiewicz |
| 2005 | ICALP | Idealized Algol with Ground Recursion, and DPDA Equivalence. | Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz |
| 2004 | FOSSACS | Angelic Semantics of Fine-Grained Concurrency. | Dan R. Ghica, Andrzej S. Murawski |
| 2004 | ICALP | Syntactic Control of Concurrency. | Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong |
| 2004 | LICS | Nominal Games and Full Abstraction for the Nu-Calculus. | Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark |
| 2004 | TACAS | Applying Game Semantics to Compositional Software Modeling and Verification. | Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong |
| 2003 | LICS | On Program Equivalence in Languages with Ground-Type References. | Andrzej S. Murawski |
| 2002 | VMCAI | Static Monotonicity Analysis for lambda-definable Functions over Lattices. | Andrzej S. Murawski, Kwangkeun Yi |
| 2001 | APLAS | Static Monotonicity Analysis for lambda-Definable Functions. over Lattices. | Andrzej S. Murawski, Kwangkeun Yi |
| 2000 | CSL | Discreet Games, Light Affine Logic and PTIME Computation. | Andrzej S. Murawski, C.-H. Luke Ong |
| 2000 | LICS | Dominator Trees and Fast Verification of Proof Nets. | Andrzej S. Murawski, C.-H. Luke Ong |