default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej S. Murawski
◀ ▷ joint publications with coauthor community group 1
- > Home > Persons > Andrzej S. Murawski
Publications
- 2023
[c60]Fabian Zaiser, Andrzej S. Murawski, Chih-Hao Luke Ong:
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach. NeurIPS 2023- [c59]Alex Dixon, Andrzej S. Murawski:
Saturating automata for game semantics. MFPS 2023 - [i17]Fabian Zaiser, Andrzej S. Murawski, Luke Ong:
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach. CoRR abs/2305.17058 (2023) - 2022
- [j27]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem. Log. Methods Comput. Sci. 18(1) (2022) - [c58]Guanyan Li, Andrzej S. Murawski, Luke Ong:
Probabilistic Verification Beyond Context-Freeness. LICS 2022: 33:1-33:13 - 2021
- [j25]Andrzej S. Murawski, Nikos Tzevelekos:
Game Semantics for Interface Middleweight Java. J. ACM 68(1): 4:1-4:51 (2021) - [j24]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague
, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. ACM Trans. Comput. Log. 22(3): 16:1-16:51 (2021) - [c57]Guilhem Jaber, Andrzej S. Murawski:
Complete trace models of state and control. ESOP 2021: 348-374 - [c56]Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Leafy automata for higher-order concurrency. FoSSaCS 2021: 184-204 - [c55]Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Verifying higher-order concurrency with data automata. LICS 2021: 1-13 - [c54]Guilhem Jaber, Andrzej S. Murawski:
Compositional relational reasoning via operational game semantics. LICS 2021: 1-13 - [i16]Guilhem Jaber, Andrzej S. Murawski:
Complete trace models of state and control. CoRR abs/2101.08491 (2021) - [i15]Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Leafy Automata for Higher-Order Concurrency. CoRR abs/2101.08720 (2021) - 2020
- [c53]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CONCUR 2020: 41:1-41:19 - [i14]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Bisimilarity in fresh-register automata. CoRR abs/2005.06411 (2020) - [i13]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CoRR abs/2007.07694 (2020) - [i12]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. CoRR abs/2010.06361 (2020) - 2019
- [j22]Andrzej S. Murawski, Nikos Tzevelekos:
Higher-order linearisability. J. Log. Algebraic Methods Program. 104: 86-116 (2019) - [j21]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States. ACM Trans. Program. Lang. Syst. 41(2): 11:1-11:38 (2019) - [c52]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
DEQ: Equivalence Checker for Deterministic Register Automata. ATVA 2019: 350-356 - [c51]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Asymmetric Distances for Approximate Differential Privacy. CONCUR 2019: 10:1-10:17 - [c50]Pierre Clairambault, Andrzej S. Murawski:
On the Expressivity of Linear Recursion Schemes. MFCS 2019: 50:1-50:14 - 2018
- [j20]Andrzej S. Murawski, Nikos Tzevelekos:
Algorithmic games for full ground references. Formal Methods Syst. Des. 52(3): 277-314 (2018) - [j19]Pierre Clairambault, Charles Grellois, Andrzej S. Murawski:
Linearity in higher-order recursion schemes. Proc. ACM Program. Lang. 2(POPL): 39:1-39:29 (2018) - [c49]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Bisimilarity Distances for Approximate Differential Privacy. ATVA 2018: 194-210 - [c48]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. MFCS 2018: 72:1-72:14 - [i11]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Bisimilarity Distances for Approximate Differential Privacy. CoRR abs/1807.10015 (2018) - [i10]Shuvendu K. Lahiri, Andrzej S. Murawski, Ofer Strichman, Mattias Ulbrich:
Program Equivalence (Dagstuhl Seminar 18151). Dagstuhl Reports 8(4): 1-19 (2018) - 2017
- [j18]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Reachability in pushdown register automata. J. Comput. Syst. Sci. 87: 58-83 (2017) - [j17]Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. ACM Trans. Comput. Log. 18(3): 25:1-25:42 (2017) - [c47]Andrzej S. Murawski, Nikos Tzevelekos:
Higher-Order Linearisability. CONCUR 2017: 34:1-34:18 - [c46]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
ML and Extended Branching VASS. ESOP 2017: 314-340 - [e2]Javier Esparza, Andrzej S. Murawski:
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. Lecture Notes in Computer Science 10203, 2017, ISBN 978-3-662-54457-0 [contents] - 2016
- [j16]Andrzej S. Murawski, Nikos Tzevelekos:
Block structure vs scope extrusion: between innocence and omniscience. Log. Methods Comput. Sci. 12(3) (2016) - [j15]Andrzej S. Murawski, Nikos Tzevelekos:
Nominal Game Semantics. Found. Trends Program. Lang. 2(4): 191-269 (2016) - [j14]Andrzej S. Murawski, Nikos Tzevelekos:
An invitation to game semantics. ACM SIGLOG News 3(2): 56-67 (2016) - [c45]Ranko Lazic, Andrzej S. Murawski:
Contextual Approximation and Higher-Order Procedures. FoSSaCS 2016: 162-179 - [i9]Andrzej S. Murawski, Nikos Tzevelekos:
Higher-Order Linearisability. CoRR abs/1610.07965 (2016) - 2015
- [c44]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
A Contextual Equivalence Checker for IMJ ∗. ATVA 2015: 234-240 - [c43]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Game Semantic Analysis of Equivalence in IMJ. ATVA 2015: 411-428 - [c42]Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
Fragments of ML Decidable by Nested Data Class Memory Automata. FoSSaCS 2015: 249-263 - [c41]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
Weak and Nested Class Memory Automata. LATA 2015: 188-199 - [c40]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Bisimilarity in Fresh-Register Automata. LICS 2015: 156-167 - [i8]Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
Fragments of ML Decidable by Nested Data Class Memory Automata. CoRR abs/1501.04511 (2015) - [i7]Atsushi Igarashi, Andrzej S. Murawski, Nikos Tzevelekos:
Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13). NII Shonan Meet. Rep. 2015 (2015) - 2014
- [c39]Andrzej S. Murawski, Nikos Tzevelekos:
Game Semantics for Nominal Exceptions. FoSSaCS 2014: 164-179 - [c38]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Reachability in Pushdown Register Automata. MFCS (1) 2014: 464-473 - [c37]Andrzej S. Murawski, Nikos Tzevelekos:
Game semantics for interface middleweight Java. POPL 2014: 517-528 - [i6]Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
Weak and Nested Class Memory Automata. CoRR abs/1409.1136 (2014) - 2013
- [j13]Andrzej S. Murawski, Nikos Tzevelekos:
Full abstraction for Reduced ML. Ann. Pure Appl. Log. 164(11): 1118-1143 (2013) - [j12]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of Equivalence and Minimisation for Q-weighted Automata. Log. Methods Comput. Sci. 9(1) (2013) - [j11]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
Algorithmic probabilistic game semantics - Playing games with automata. Formal Methods Syst. Des. 43(2): 285-312 (2013) - [c36]Andrzej S. Murawski, Nikos Tzevelekos:
Towards Nominal Abramsky. Computation, Logic, Games, and Quantum Foundations 2013: 246-263 - [c35]Andrzej S. Murawski, Nikos Tzevelekos:
Deconstructing General References via Game Semantics. FoSSaCS 2013: 241-256 - [c34]Pierre Clairambault, Andrzej S. Murawski:
Böhm Trees as Higher-Order Recursive Schemes. FSTTCS 2013: 91-102 - [c33]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Automata is Nonelementary. LICS 2013: 488-498 - 2012
- [j10]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
Three tokens in Herman's algorithm. Formal Aspects Comput. 24(4-6): 671-678 (2012) - [c32]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
APEX: An Analyzer for Open Probabilistic Programs. CAV 2012: 693-698 - [c31]David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
Hector: An Equivalence Checker for a Higher-Order Fragment of ML. CAV 2012: 774-780 - [c30]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS 2012: 467-481 - [c29]Andrzej S. Murawski, Nikos Tzevelekos:
Algorithmic Games for Full Ground References. ICALP (2) 2012: 312-324 - [i5]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Systems is Nonelementary. CoRR abs/1210.7686 (2012) - 2011
- [c28]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
Language Equivalence for Probabilistic Automata. CAV 2011: 526-540 - [c27]Andrzej S. Murawski, Nikos Tzevelekos:
Algorithmic Nominal Game Semantics. ESOP 2011: 419-438 - [c26]David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong:
A Fragment of ML Decidable by Visibly Pushdown Automata. ICALP (2) 2011: 149-161 - [c25]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang:
On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477 - [c24]Andrzej S. Murawski, Nikos Tzevelekos:
Game Semantics for Good General References. LICS 2011: 75-84 - [i4]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang:
On Stabilization in Herman's Algorithm. CoRR abs/1104.3100 (2011) - [i3]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of the Equivalence Problem for Probabilistic Automata. CoRR abs/1112.4644 (2011) - 2010
- [c23]Andrzej S. Murawski, Nikos Tzevelekos:
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. FoSSaCS 2010: 33-47 - [e1]Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz:
Game Semantics and Program Verification, 20.06. - 25.06.2010. Dagstuhl Seminar Proceedings 10252, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i2]Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz:
10252 Abstracts Collection - Game Semantics and Program Verification. Game Semantics and Program Verification 2010 - [i1]Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz:
10252 Executive Summary - Game Semantics and Program Verification. Game Semantics and Program Verification 2010 - 2009
- [c21]Andrzej S. Murawski, Nikos Tzevelekos:
Full Abstraction for Reduced ML. FoSSaCS 2009: 32-47 - 2008
- [j9]Dan R. Ghica, Andrzej S. Murawski:
Angelic semantics of fine-grained concurrency. Ann. Pure Appl. Log. 151(2-3): 89-114 (2008) - [j8]Andrzej S. Murawski, Igor Walukiewicz:
Third-order Idealized Algol with iteration is decidable. Theor. Comput. Sci. 390(2-3): 214-229 (2008) - [c19]Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461 - [c18]Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell:
On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187 - 2006
- [j7]Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Syntactic control of concurrency. Theor. Comput. Sci. 350(2-3): 234-251 (2006) - [j6]Andrzej S. Murawski, C.-H. Luke Ong:
Fast verification of MLL proof nets via IMLL. ACM Trans. Comput. Log. 7(3): 473-498 (2006) - [c16]Dan R. Ghica, Andrzej S. Murawski:
Compositional Model Extraction for Higher-Order Concurrent Programs. TACAS 2006: 303-317 - 2005
- [c15]Andrzej S. Murawski, Joël Ouaknine:
On Probabilistic Program Equivalence and Refinement. CONCUR 2005: 156-170 - [c14]Andrzej S. Murawski, Igor Walukiewicz:
Third-Order Idealized Algol with Iteration Is Decidable. FoSSaCS 2005: 202-218 - [c12]Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz:
Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929 - 2004
- [j2]Andrzej S. Murawski, C.-H. Luke Ong:
On an interpretation of safe recursion in light affine logic. Theor. Comput. Sci. 318(1-2): 197-223 (2004) - [c11]Dan R. Ghica, Andrzej S. Murawski:
Angelic Semantics of Fine-Grained Concurrency. FoSSaCS 2004: 211-225 - [c10]Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Syntactic Control of Concurrency. ICALP 2004: 683-694 - [c9]Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark:
Nominal Games and Full Abstraction for the Nu-Calculus. LICS 2004: 150-159 - [c8]Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Applying Game Semantics to Compositional Software Modeling and Verification. TACAS 2004: 421-435 - 2003
- [j1]Andrzej S. Murawski, C.-H. Luke Ong:
Exhausting strategies, joker games and full completeness for IMLL with Unit. Theor. Comput. Sci. 294(1/2): 269-305 (2003) - 2001
- [c4]Andrzej S. Murawski, C.-H. Luke Ong:
Evolving Games and Essential Nets for Affine Polymorphism. TLCA 2001: 360-375 - 2000
- [c3]Andrzej S. Murawski, C.-H. Luke Ong:
Discreet Games, Light Affine Logic and PTIME Computation. CSL 2000: 427-441 - [c2]Andrzej S. Murawski, C.-H. Luke Ong:
Dominator Trees and Fast Verification of Proof Nets. LICS 2000: 181-191 - 1999
- [c1]Andrzej S. Murawski, C.-H. Luke Ong:
Exhausting Strategies, Joker Games and IMLL with Units. CTCS 1999: 209-239
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
