Andrzej S. Murawski

114 papers A* 21A 6B 27C 1Journal 46Unranked 11
YearRankTypeTitle / Venue / Authors
2026 J jnl
Layered Modal ML: Syntax and Full Abstraction.
CoRR
Haoxuan Yin, Andrzej S. Murawski, C.-H. Luke Ong
2025 J jnl
Bisimilarity in fresh-register automata.
Log. Methods Comput. Sci.
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2025 J jnl
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops.
Proc. ACM Program. Lang.
Fabian Zaiser, Andrzej S. Murawski, C.-H. Luke Ong
2025 A* conf
Reachability Types, Traces and Full Abstraction.
LICS
Benedict Bunting, Andrzej S. Murawski
2024 A* conf
Contextual Equivalence for State and Control via Nested Data.
LICS
Benedict Bunting, Andrzej S. Murawski
2024 J jnl
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops.
CoRR
Fabian Zaiser, Andrzej S. Murawski, C.-H. Luke Ong
2023 A* conf
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach.
NeurIPS
Fabian Zaiser, Andrzej S. Murawski, Chih-Hao Luke Ong
2023 J jnl
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach.
CoRR
Fabian Zaiser, Andrzej S. Murawski, Luke Ong
2023 A* conf
Operational Algorithmic Game Semantics.
LICS
Benedict Bunting, Andrzej S. Murawski
2023 B conf
Saturating automata for game semantics.
MFPS
Alex Dixon, Andrzej S. Murawski
2022 J jnl
From the Editor.
ACM SIGLOG News
Andrzej S. Murawski
2022 A* conf
Probabilistic Verification Beyond Context-Freeness.
LICS
Guanyan Li, Andrzej S. Murawski, Luke Ong
2022 J jnl
The Big-O Problem.
Log. Methods Comput. Sci.
Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser
2021 J jnl
Collapsible Pushdown Parity Games.
ACM Trans. Comput. Log.
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
2021 A conf
Complete trace models of state and control.
ESOP
Guilhem Jaber, Andrzej S. Murawski
2021 J jnl
Complete trace models of state and control.
CoRR
Guilhem Jaber, Andrzej S. Murawski
2021 A* conf
Compositional relational reasoning via operational game semantics.
LICS
Guilhem Jaber, Andrzej S. Murawski
2021 J jnl
Game Semantics for Interface Middleweight Java.
J. ACM
Andrzej S. Murawski, Nikos Tzevelekos
2021 J jnl
Leafy Automata for Higher-Order Concurrency.
CoRR
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2021 B conf
Leafy automata for higher-order concurrency.
FoSSaCS
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2021 A* conf
Verifying higher-order concurrency with data automata.
LICS
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2020 J jnl
Bisimilarity in fresh-register automata.
CoRR
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2020 J jnl
Collapsible Pushdown Parity Games.
CoRR
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
2020 J jnl
The 2020 Alonzo Church award for outstanding contributions to logic and computation: call for nominations.
ACM SIGLOG News
Andrzej S. Murawski
2020 B conf
The Big-O Problem for Labelled Markov Chains and Weighted Automata.
CONCUR
Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser
2020 J jnl
The Big-O Problem for Labelled Markov Chains and Weighted Automata.
CoRR
Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser
2019 B conf
Asymmetric Distances for Approximate Differential Privacy.
CONCUR
Dmitry Chistikov, Andrzej S. Murawski, David Purser
2019 B conf
DEQ: Equivalence Checker for Deterministic Register Automata.
ATVA
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2019 J jnl
Higher-order linearisability.
J. Log. Algebraic Methods Program.
Andrzej S. Murawski, Nikos Tzevelekos
2019 J jnl
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States.
ACM Trans. Program. Lang. Syst.
Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong
2019 B conf
On the Expressivity of Linear Recursion Schemes.
MFCS
Pierre Clairambault, Andrzej S. Murawski
2018 J jnl
Algorithmic games for full ground references.
Formal Methods Syst. Des.
Andrzej S. Murawski, Nikos Tzevelekos
2018 B conf
Bisimilarity Distances for Approximate Differential Privacy.
ATVA
Dmitry Chistikov, Andrzej S. Murawski, David Purser
2018 J jnl
Bisimilarity Distances for Approximate Differential Privacy.
CoRR
Dmitry Chistikov, Andrzej S. Murawski, David Purser
2018 J jnl
Linearity in higher-order recursion schemes.
Proc. ACM Program. Lang.
Pierre Clairambault, Charles Grellois, Andrzej S. Murawski
2018 B conf
Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata.
MFCS
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2018 J jnl
Program Equivalence (Dagstuhl Seminar 18151).
Dagstuhl Reports
Shuvendu K. Lahiri, Andrzej S. Murawski, Ofer Strichman, Mattias Ulbrich
2017 J jnl
Collapsible Pushdown Automata and Recursion Schemes.
ACM Trans. Comput. Log.
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
2017 B ed.
Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings
FoSSaCS
Javier Esparza, Andrzej S. Murawski
2017 B conf
Higher-Order Linearisability.
CONCUR
Andrzej S. Murawski, Nikos Tzevelekos
2017 A conf
ML and Extended Branching VASS.
ESOP
Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong
2017 J jnl
Reachability in pushdown register automata.
J. Comput. Syst. Sci.
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2016 J jnl
An invitation to game semantics.
ACM SIGLOG News
Andrzej S. Murawski, Nikos Tzevelekos
2016 J jnl
Block structure vs scope extrusion: between innocence and omniscience.
Log. Methods Comput. Sci.
Andrzej S. Murawski, Nikos Tzevelekos
2016 B conf
Contextual Approximation and Higher-Order Procedures.
FoSSaCS
Ranko Lazic, Andrzej S. Murawski
2016 J jnl
Higher-Order Linearisability.
CoRR
Andrzej S. Murawski, Nikos Tzevelekos
2016 J jnl
Nominal Game Semantics.
Found. Trends Program. Lang.
Andrzej S. Murawski, Nikos Tzevelekos
2015 B conf
A Contextual Equivalence Checker for IMJ ∗.
ATVA
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2015 A* conf
Bisimilarity in Fresh-Register Automata.
LICS
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2015 B conf
Fragments of ML Decidable by Nested Data Class Memory Automata.
FoSSaCS
Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong
2015 J jnl
Fragments of ML Decidable by Nested Data Class Memory Automata.
CoRR
Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong
2015 B conf
Game Semantic Analysis of Equivalence in IMJ.
ATVA
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2015 J jnl
Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13).
NII Shonan Meet. Rep.
Atsushi Igarashi, Andrzej S. Murawski, Nikos Tzevelekos
2015 C conf
Weak and Nested Class Memory Automata.
LATA
Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong
2014 B conf
Game Semantics for Nominal Exceptions.
FoSSaCS
Andrzej S. Murawski, Nikos Tzevelekos
2014 A* conf
Game semantics for interface middleweight Java.
POPL
Andrzej S. Murawski, Nikos Tzevelekos
2014 — conf
Reachability in Pushdown Register Automata.
MFCS (1)
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2014 J jnl
Weak and Nested Class Memory Automata.
CoRR
Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong
2013 J jnl
Algorithmic probabilistic game semantics - Playing games with automata.
Formal Methods Syst. Des.
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2013 A* conf
Bisimilarity of Pushdown Automata is Nonelementary.
LICS
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2013 — conf
Böhm Trees as Higher-Order Recursive Schemes.
FSTTCS
Pierre Clairambault, Andrzej S. Murawski
2013 B conf
Deconstructing General References via Game Semantics.
FoSSaCS
Andrzej S. Murawski, Nikos Tzevelekos
2013 J jnl
Full abstraction for Reduced ML.
Ann. Pure Appl. Log.
Andrzej S. Murawski, Nikos Tzevelekos
2013 J jnl
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Log. Methods Comput. Sci.
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2013 — conf
Towards Nominal Abramsky.
Computation, Logic, Games, and Quantum Foundations
Andrzej S. Murawski, Nikos Tzevelekos
2012 A* conf
APEX: An Analyzer for Open Probabilistic Programs.
CAV
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2012 — conf
Algorithmic Games for Full Ground References.
ICALP (2)
Andrzej S. Murawski, Nikos Tzevelekos
2012 J jnl
Bisimilarity of Pushdown Systems is Nonelementary
CoRR
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2012 A* conf
Hector: An Equivalence Checker for a Higher-Order Fragment of ML.
CAV
David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong
2012 B conf
On the Complexity of the Equivalence Problem for Probabilistic Automata.
FoSSaCS
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2012 J jnl
Three tokens in Herman's algorithm.
Formal Aspects Comput.
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2011 — conf
A Fragment of ML Decidable by Visibly Pushdown Automata.
ICALP (2)
David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong
2011 A conf
Algorithmic Nominal Game Semantics.
ESOP
Andrzej S. Murawski, Nikos Tzevelekos
2011 A* conf
Game Semantics for Good General References.
LICS
Andrzej S. Murawski, Nikos Tzevelekos
2011 A* conf
Language Equivalence for Probabilistic Automata.
CAV
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2011 J jnl
On Stabilization in Herman's Algorithm
CoRR
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang
2011 — conf
On Stabilization in Herman's Algorithm.
ICALP (2)
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang
2011 J jnl
On the Complexity of the Equivalence Problem for Probabilistic Automata
CoRR
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2010 — conf
10252 Abstracts Collection - Game Semantics and Program Verification.
Game Semantics and Program Verification
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
2010 — conf
10252 Executive Summary - Game Semantics and Program Verification.
Game Semantics and Program Verification
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
2010 B conf
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience.
FoSSaCS
Andrzej S. Murawski, Nikos Tzevelekos
2010 B conf
Full Abstraction Without Synchronization Primitives.
MFPS
Andrzej S. Murawski
2010 — ed.
Game Semantics and Program Verification, 20.06. - 25.06.2010
Game Semantics and Program Verification
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
2009 B conf
Full Abstraction for Reduced ML.
FoSSaCS
Andrzej S. Murawski, Nikos Tzevelekos
2008 J jnl
Angelic semantics of fine-grained concurrency.
Ann. Pure Appl. Log.
Dan R. Ghica, Andrzej S. Murawski
2008 A* conf
Collapsible Pushdown Automata and Recursion Schemes.
LICS
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
2008 A conf
On Automated Verification of Probabilistic Programs.
TACAS
Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell
2008 A* conf
Reachability Games and Game Semantics: Comparing Nondeterministic Programs.
LICS
Andrzej S. Murawski
2008 J jnl
Third-order Idealized Algol with iteration is decidable.
Theor. Comput. Sci.
Andrzej S. Murawski, Igor Walukiewicz
2007 B conf
Bad Variables Under Control.
CSL
Andrzej S. Murawski
2006 A conf
Compositional Model Extraction for Higher-Order Concurrent Programs.
TACAS
Dan R. Ghica, Andrzej S. Murawski
2006 J jnl
Fast verification of MLL proof nets via IMLL.
ACM Trans. Comput. Log.
Andrzej S. Murawski, C.-H. Luke Ong
2006 J jnl
Syntactic control of concurrency.
Theor. Comput. Sci.
Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
2005 J jnl
About the undecidability of program equivalence in finitary languages with state.
ACM Trans. Comput. Log.
Andrzej S. Murawski
2005 J jnl
Functions with local state: Regularity and undecidability.
Theor. Comput. Sci.
Andrzej S. Murawski
2005 — conf
Functions with local state: from regularity to undecidability.
GALOP@ETAPS
Andrzej S. Murawski
2005 J jnl
Games for complexity of second-order call-by-name programs.
Theor. Comput. Sci.
Andrzej S. Murawski
2005 A* conf
Idealized Algol with Ground Recursion, and DPDA Equivalence.
ICALP
Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz
2005 B conf
On Probabilistic Program Equivalence and Refinement.
CONCUR
Andrzej S. Murawski, Joël Ouaknine
2005 B conf
Third-Order Idealized Algol with Iteration Is Decidable.
FoSSaCS
Andrzej S. Murawski, Igor Walukiewicz
2004 B conf
Angelic Semantics of Fine-Grained Concurrency.
FoSSaCS
Dan R. Ghica, Andrzej S. Murawski
2004 A conf
Applying Game Semantics to Compositional Software Modeling and Verification.
TACAS
Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
2004 A* conf
Nominal Games and Full Abstraction for the Nu-Calculus.
LICS
Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark
2004 J jnl
On an interpretation of safe recursion in light affine logic.
Theor. Comput. Sci.
Andrzej S. Murawski, C.-H. Luke Ong
2004 A* conf
Syntactic Control of Concurrency.
ICALP
Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
2003 J jnl
Exhausting strategies, joker games and full completeness for IMLL with Unit.
Theor. Comput. Sci.
Andrzej S. Murawski, C.-H. Luke Ong
2003 A* conf
On Program Equivalence in Languages with Ground-Type References.
LICS
Andrzej S. Murawski
2002 B conf
Static Monotonicity Analysis for lambda-definable Functions over Lattices.
VMCAI
Andrzej S. Murawski, Kwangkeun Yi
2001 — conf
Evolving Games and Essential Nets for Affine Polymorphism.
TLCA
Andrzej S. Murawski, C.-H. Luke Ong
2001 — —
On semantic and type-theoretic aspects of polynomial-time computability.
Andrzej S. Murawski
2001 B conf
Static Monotonicity Analysis for lambda-Definable Functions. over Lattices.
APLAS
Andrzej S. Murawski, Kwangkeun Yi
2000 B conf
Discreet Games, Light Affine Logic and PTIME Computation.
CSL
Andrzej S. Murawski, C.-H. Luke Ong
2000 A* conf
Dominator Trees and Fast Verification of Proof Nets.
LICS
Andrzej S. Murawski, C.-H. Luke Ong
1999 — conf
Exhausting Strategies, Joker Games and IMLL with Units.
CTCS
Andrzej S. Murawski, C.-H. Luke Ong