Exhausting Strategies, Joker Games and IMLL with Units. - Andrzej S. Murawski; C.-H. Luke Ong (CTCS, 1999)

Discreet Games, Light Affine Logic and PTIME Computation. - Andrzej S. Murawski; C.-H. Luke Ong (CSL, 2000)

Dominator Trees and Fast Verification of Proof Nets. - Andrzej S. Murawski; C.-H. Luke Ong (LICS, 2000)

Static Monotonicity Analysis for lambda-Definable Functions. over Lattices. - Andrzej S. Murawski; Kwangkeun Yi (APLAS, 2001)

Evolving Games and Essential Nets for Affine Polymorphism. - Andrzej S. Murawski; C.-H. Luke Ong (TLCA, 2001)

On semantic and type-theoretic aspects of polynomial-time computability. - Andrzej S. Murawski (2001)

On Program Equivalence in Languages with Ground-Type References. - Andrzej S. Murawski (LICS, 2003)

Exhausting strategies, joker games and full completeness for IMLL with Unit. - Andrzej S. Murawski; C.-H. Luke Ong (Theor. Comput. Sci., 2003)

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 (LICS, 2004)

Applying Game Semantics to Compositional Software Modeling and Verification. - Samson Abramsky; Dan R. Ghica; Andrzej S. Murawski; C.-H. Luke Ong (TACAS, 2004)

On an interpretation of safe recursion in light affine logic. - Andrzej S. Murawski; C.-H. Luke Ong (Theor. Comput. Sci., 2004)

On Probabilistic Program Equivalence and Refinement. - Andrzej S. Murawski; Joël Ouaknine (CONCUR, 2005)

Functions with local state: from regularity to undecidability. - Andrzej S. Murawski (GALOP@ETAPS, 2005)

Idealized Algol with Ground Recursion, and DPDA Equivalence. - Andrzej S. Murawski; C.-H. Luke Ong; Igor Walukiewicz (ICALP, 2005)

Functions with local state: Regularity and undecidability. - Andrzej S. Murawski (Theor. Comput. Sci., 2005)

Games for complexity of second-order call-by-name programs. - Andrzej S. Murawski (Theor. Comput. Sci., 2005)

About the undecidability of program equivalence in finitary languages with state. - Andrzej S. Murawski (ACM Trans. Comput. Log., 2005)

Compositional Model Extraction for Higher-Order Concurrent Programs. - Dan R. Ghica; Andrzej S. Murawski (TACAS, 2006)

Syntactic control of concurrency. - Dan R. Ghica; Andrzej S. Murawski; C.-H. Luke Ong (Theor. Comput. Sci., 2006)

Fast verification of MLL proof nets via IMLL. - Andrzej S. Murawski; C.-H. Luke Ong (ACM Trans. Comput. Log., 2006)

Bad Variables Under Control. - Andrzej S. Murawski (CSL, 2007)

Reachability Games and Game Semantics: Comparing Nondeterministic Programs. - Andrzej S. Murawski (LICS, 2008)

On Automated Verification of Probabilistic Programs. - Axel Legay; Andrzej S. Murawski; Joël Ouaknine; James Worrell 001 (TACAS, 2008)

Angelic semantics of fine-grained concurrency. - Dan R. Ghica; Andrzej S. Murawski (Ann. Pure Appl. Log., 2008)

Third-order Idealized Algol with iteration is decidable. - Andrzej S. Murawski; Igor Walukiewicz (Theor. Comput. Sci., 2008)

10252 Abstracts Collection - Game Semantics and Program Verification. - Paul-André Melliès; Andrzej S. Murawski; Andrea Schalk; Igor Walukiewicz (Game Semantics and Program Verification, 2010)

10252 Executive Summary - Game Semantics and Program Verification. - Paul-André Melliès; Andrzej S. Murawski; Andrea Schalk; Igor Walukiewicz (Game Semantics and Program Verification, 2010)

Full Abstraction Without Synchronization Primitives. - Andrzej S. Murawski (MFPS, 2010)

Language Equivalence for Probabilistic Automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (CAV, 2011)

Algorithmic Nominal Game Semantics. - Andrzej S. Murawski; Nikos Tzevelekos (ESOP, 2011)

A Fragment of ML Decidable by Visibly Pushdown Automata. - David Hopkins 002; Andrzej S. Murawski; C.-H. Luke Ong (ICALP (2), 2011)

On Stabilization in Herman's Algorithm. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; James Worrell 001; Lijun Zhang 001 (ICALP (2), 2011)

Game Semantics for Good General References. - Andrzej S. Murawski; Nikos Tzevelekos (LICS, 2011)

Hector: An Equivalence Checker for a Higher-Order Fragment of ML. - David Hopkins 002; Andrzej S. Murawski; C.-H. Luke Ong (CAV, 2012)

APEX: An Analyzer for Open Probabilistic Programs. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (CAV, 2012)

On the Complexity of the Equivalence Problem for Probabilistic Automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (FoSSaCS, 2012)

Bisimilarity of Pushdown Systems is Nonelementary - Michael Benedikt; Stefan Göller; Stefan Kiefer; Andrzej S. Murawski (CoRR, 2012)

Three tokens in Herman's algorithm. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Formal Aspects Comput., 2012)

Towards Nominal Abramsky. - Andrzej S. Murawski; Nikos Tzevelekos (Computation, Logic, Games, and Quantum Foundations, 2013)

Deconstructing General References via Game Semantics. - Andrzej S. Murawski; Nikos Tzevelekos (FoSSaCS, 2013)

Böhm Trees as Higher-Order Recursive Schemes. - Pierre Clairambault; Andrzej S. Murawski (FSTTCS, 2013)

Bisimilarity of Pushdown Automata is Nonelementary. - Michael Benedikt; Stefan Göller; Stefan Kiefer; Andrzej S. Murawski (LICS, 2013)

Full abstraction for Reduced ML. - Andrzej S. Murawski; Nikos Tzevelekos (Ann. Pure Appl. Log., 2013)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Log. Methods Comput. Sci., 2013)

Algorithmic probabilistic game semantics - Playing games with automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Formal Methods Syst. Des., 2013)

Game Semantics for Nominal Exceptions. - Andrzej S. Murawski; Nikos Tzevelekos (FoSSaCS, 2014)

A Contextual Equivalence Checker for IMJ ∗. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (ATVA, 2015)

Game Semantic Analysis of Equivalence in IMJ. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (ATVA, 2015)

Fragments of ML Decidable by Nested Data Class Memory Automata. - Conrad Cotton-Barratt; David Hopkins 002; Andrzej S. Murawski; C.-H. Luke Ong (FoSSaCS, 2015)

Weak and Nested Class Memory Automata. - Conrad Cotton-Barratt; Andrzej S. Murawski; C.-H. Luke Ong (LATA, 2015)

Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13). - Atsushi Igarashi; Andrzej S. Murawski; Nikos Tzevelekos (NII Shonan Meet. Rep., 2015)

Contextual Approximation and Higher-Order Procedures. - Ranko Lazic 001; Andrzej S. Murawski (FoSSaCS, 2016)

Block structure vs scope extrusion: between innocence and omniscience. - Andrzej S. Murawski; Nikos Tzevelekos (Log. Methods Comput. Sci., 2016)

Nominal Game Semantics. - Andrzej S. Murawski; Nikos Tzevelekos (Found. Trends Program. Lang., 2016)

An invitation to game semantics. - Andrzej S. Murawski; Nikos Tzevelekos (ACM SIGLOG News, 2016)

ML and Extended Branching VASS. - Conrad Cotton-Barratt; Andrzej S. Murawski; C.-H. Luke Ong (ESOP, 2017)

Reachability in pushdown register automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (J. Comput. Syst. Sci., 2017)

Collapsible Pushdown Automata and Recursion Schemes. - Matthew Hague; Andrzej S. Murawski; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2017)

Bisimilarity Distances for Approximate Differential Privacy. - Dmitry Chistikov 001; Andrzej S. Murawski; David Purser (ATVA, 2018)

Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (MFCS, 2018)

Program Equivalence (Dagstuhl Seminar 18151). - Shuvendu K. Lahiri; Andrzej S. Murawski; Ofer Strichman; Mattias Ulbrich (Dagstuhl Reports, 2018)

Algorithmic games for full ground references. - Andrzej S. Murawski; Nikos Tzevelekos (Formal Methods Syst. Des., 2018)

Linearity in higher-order recursion schemes. - Pierre Clairambault; Charles Grellois; Andrzej S. Murawski (Proc. ACM Program. Lang., 2018)

DEQ: Equivalence Checker for Deterministic Register Automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (ATVA, 2019)

Asymmetric Distances for Approximate Differential Privacy. - Dmitry Chistikov 001; Andrzej S. Murawski; David Purser (CONCUR, 2019)

On the Expressivity of Linear Recursion Schemes. - Pierre Clairambault; Andrzej S. Murawski (MFCS, 2019)

Higher-order linearisability. - Andrzej S. Murawski; Nikos Tzevelekos (J. Log. Algebraic Methods Program., 2019)

ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States. - Conrad Cotton-Barratt; Andrzej S. Murawski; C.-H. Luke Ong (ACM Trans. Program. Lang. Syst., 2019)

The Big-O Problem for Labelled Markov Chains and Weighted Automata. - Dmitry Chistikov 001; Stefan Kiefer; Andrzej S. Murawski; David Purser (CONCUR, 2020)

The 2020 Alonzo Church award for outstanding contributions to logic and computation: call for nominations. - Andrzej S. Murawski (ACM SIGLOG News, 2020)

Complete trace models of state and control. - Guilhem Jaber; Andrzej S. Murawski (ESOP, 2021)

Leafy automata for higher-order concurrency. - Alex Dixon; Ranko Lazic 001; Andrzej S. Murawski; Igor Walukiewicz (FoSSaCS, 2021)

Verifying higher-order concurrency with data automata. - Alex Dixon; Ranko Lazic 001; Andrzej S. Murawski; Igor Walukiewicz (LICS, 2021)

Compositional relational reasoning via operational game semantics. - Guilhem Jaber; Andrzej S. Murawski (LICS, 2021)

Game Semantics for Interface Middleweight Java. - Andrzej S. Murawski; Nikos Tzevelekos (J. ACM, 2021)

Collapsible Pushdown Parity Games. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Andrzej S. Murawski; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2021)

Probabilistic Verification Beyond Context-Freeness. - Guanyan Li; Andrzej S. Murawski; Luke Ong (LICS, 2022)

The Big-O Problem. - Dmitry Chistikov 001; Stefan Kiefer; Andrzej S. Murawski; David Purser (Log. Methods Comput. Sci., 2022)

From the Editor. - Andrzej S. Murawski (ACM SIGLOG News, 2022)

Operational Algorithmic Game Semantics. - Benedict Bunting; Andrzej S. Murawski (LICS, 2023)

Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach. - Fabian Zaiser; Andrzej S. Murawski; Chih-Hao Luke Ong (NeurIPS, 2023)

PTSV: Probabilistic Tree-Stack Verifier. - Guanyan Li; Andrzej S. Murawski; Luke Ong (Zenodo, 2023)

Saturating automata for game semantics. - Alex Dixon; Andrzej S. Murawski (MFPS, 2023)

PTSV: Probabilistic Tree-Stack Verifier. - Guanyan Li; Andrzej S. Murawski; Luke Ong (Zenodo, 2023)

Contextual Equivalence for State and Control via Nested Data. - Benedict Bunting; Andrzej S. Murawski (LICS, 2024)

Bisimilarity in fresh-register automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (Log. Methods Comput. Sci., 2025)

Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops. - Fabian Zaiser; Andrzej S. Murawski; C.-H. Luke Ong (Proc. ACM Program. Lang., 2025)