Andrzej S. Murawski

According to our database1, Andrzej S. Murawski authored at least 75 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Leafy Automata for Higher-Order Concurrency.
CoRR, 2021

Complete trace models of state and control.
CoRR, 2021

2020
The 2020 Alonzo Church award for outstanding contributions to logic and computation: call for nominations.
ACM SIGLOG News, 2020

Collapsible Pushdown Parity Games.
CoRR, 2020

The Big-O Problem for Labelled Markov Chains and Weighted Automata.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States.
ACM Trans. Program. Lang. Syst., 2019

Higher-order linearisability.
J. Log. Algebraic Methods Program., 2019

On the Expressivity of Linear Recursion Schemes.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Asymmetric Distances for Approximate Differential Privacy.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

DEQ: Equivalence Checker for Deterministic Register Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2019

2018
Linearity in higher-order recursion schemes.
Proc. ACM Program. Lang., 2018

Algorithmic games for full ground references.
Formal Methods Syst. Des., 2018

Program Equivalence (Dagstuhl Seminar 18151).
Dagstuhl Reports, 2018

Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Bisimilarity Distances for Approximate Differential Privacy.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
Collapsible Pushdown Automata and Recursion Schemes.
ACM Trans. Comput. Log., 2017

Reachability in pushdown register automata.
J. Comput. Syst. Sci., 2017

ML and Extended Branching VASS.
Proceedings of the Programming Languages and Systems, 2017

2016
An invitation to game semantics.
ACM SIGLOG News, 2016

Nominal Game Semantics.
Found. Trends Program. Lang., 2016

Block structure vs scope extrusion: between innocence and omniscience.
Log. Methods Comput. Sci., 2016

Contextual Approximation and Higher-Order Procedures.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13).
NII Shonan Meet. Rep., 2015

Bisimilarity in Fresh-Register Automata.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Weak and Nested Class Memory Automata.
Proceedings of the Language and Automata Theory and Applications, 2015

Fragments of ML Decidable by Nested Data Class Memory Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

Game Semantic Analysis of Equivalence in IMJ.
Proceedings of the Automated Technology for Verification and Analysis, 2015

A Contextual Equivalence Checker for IMJ ∗.
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
Game semantics for interface middleweight Java.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Game Semantics for Nominal Exceptions.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
Algorithmic probabilistic game semantics - Playing games with automata.
Formal Methods Syst. Des., 2013

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Log. Methods Comput. Sci., 2013

Full abstraction for Reduced ML.
Ann. Pure Appl. Log., 2013

Bisimilarity of Pushdown Automata is Nonelementary.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Böhm Trees as Higher-Order Recursive Schemes.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Deconstructing General References via Game Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

Towards Nominal Abramsky.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Three tokens in Herman's algorithm.
Formal Aspects Comput., 2012

Bisimilarity of Pushdown Systems is Nonelementary
CoRR, 2012

On the Complexity of the Equivalence Problem for Probabilistic Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

APEX: An Analyzer for Open Probabilistic Programs.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Hector: An Equivalence Checker for a Higher-Order Fragment of ML.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Game Semantics for Good General References.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

On Stabilization in Herman's Algorithm.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Fragment of ML Decidable by Visibly Pushdown Automata.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Algorithmic Nominal Game Semantics.
Proceedings of the Programming Languages and Systems, 2011

Language Equivalence for Probabilistic Automata.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Full Abstraction Without Synchronization Primitives.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

10252 Executive Summary - Game Semantics and Program Verification.
Proceedings of the Game Semantics and Program Verification, 20.06. - 25.06.2010, 2010

10252 Abstracts Collection - Game Semantics and Program Verification.
Proceedings of the Game Semantics and Program Verification, 20.06. - 25.06.2010, 2010

2008
Third-order Idealized Algol with iteration is decidable.
Theor. Comput. Sci., 2008

Angelic semantics of fine-grained concurrency.
Ann. Pure Appl. Log., 2008

On Automated Verification of Probabilistic Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Reachability Games and Game Semantics: Comparing Nondeterministic Programs.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007
Bad Variables Under Control.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Fast verification of MLL proof nets via IMLL.
ACM Trans. Comput. Log., 2006

Syntactic control of concurrency.
Theor. Comput. Sci., 2006

Compositional Model Extraction for Higher-Order Concurrent Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

2005
About the undecidability of program equivalence in finitary languages with state.
ACM Trans. Comput. Log., 2005

Games for complexity of second-order call-by-name programs.
Theor. Comput. Sci., 2005

Functions with local state: Regularity and undecidability.
Theor. Comput. Sci., 2005

Idealized Algol with Ground Recursion, and DPDA Equivalence.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Functions with local state: from regularity to undecidability.
Proceedings of the 1st Workshop on Games for Logic and Programming Languages, 2005

On Probabilistic Program Equivalence and Refinement.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
On an interpretation of safe recursion in light affine logic.
Theor. Comput. Sci., 2004

Applying Game Semantics to Compositional Software Modeling and Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Nominal Games and Full Abstraction for the Nu-Calculus.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003
Exhausting strategies, joker games and full completeness for IMLL with Unit.
Theor. Comput. Sci., 2003

On Program Equivalence in Languages with Ground-Type References.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

2001
On semantic and type-theoretic aspects of polynomial-time computability.
PhD thesis, 2001

Evolving Games and Essential Nets for Affine Polymorphism.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

Static Monotonicity Analysis for lambda-Definable Functions. over Lattices.
Proceedings of the Second Asian Workshop on Programming Languages and Systems, 2001

2000
Dominator Trees and Fast Verification of Proof Nets.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Discreet Games, Light Affine Logic and PTIME Computation.
Proceedings of the Computer Science Logic, 2000

1999
Exhausting Strategies, Joker Games and IMLL with Units.
Proceedings of the Conference on Category Theory and Computer Science, 1999


  Loading...