Andrzej S. Murawski

Available identifiers

zbMath Open murawski.andrzej-sMaRDI QIDQ388210

List of research outcomes

Publication	Date of Publication	Type
Bisimilarity distances for approximate differential privacy	2023-07-28	Paper
Asymmetric Distances for Approximate Differential Privacy	2023-02-03	Paper
Game Semantics for Interface Middleweight Java	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5094125	2022-08-02	Paper
https://portal.mardi4nfdi.de/entity/Q5092412	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5089308	2022-07-18	Paper
Leafy automata for higher-order concurrency	2021-10-18	Paper
Complete trace models of state and control	2021-10-18	Paper
Polynomial-time equivalence testing for deterministic fresh-register automata	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5111648	2020-05-27	Paper
Higher-order linearisability	2019-06-20	Paper
Algorithmic games for full ground references	2018-07-16	Paper
Bisimilarity in Fresh-Register Automata	2018-04-23	Paper
About the undecidability of program equivalence in finitary languages with state	2017-07-12	Paper
Bisimilarity of Pushdown Automata is Nonelementary	2017-07-03	Paper
Reachability in pushdown register automata	2017-05-24	Paper
Block structure vs scope extrusion: between innocence and omniscience	2017-04-11	Paper
Böhm trees as higher-order recursion schemes	2017-02-21	Paper
Full Abstraction Without Synchronization Primitives	2016-07-08	Paper
Contextual Approximation and Higher-Order Procedures	2016-06-10	Paper
A Contextual Equivalence Checker for IMJ*	2016-01-08	Paper
Game Semantic Analysis of Equivalence in IMJ	2016-01-08	Paper
Reachability in Pushdown Register Automata	2014-10-14	Paper
Algorithmic probabilistic game semantics. Playing games with automata	2014-06-30	Paper
Game Semantics for Nominal Exceptions	2014-04-16	Paper
Game semantics for interface middleweight Java	2014-04-10	Paper
Full abstraction for Reduced ML	2013-12-19	Paper
Towards Nominal Abramsky	2013-05-28	Paper
On the Complexity of Equivalence and Minimisation for Q-weighted Automata	2013-04-09	Paper
Three tokens in Herman's algorithm	2013-03-22	Paper
Deconstructing General References via Game Semantics	2013-03-18	Paper
Algorithmic Games for Full Ground References	2012-11-01	Paper
On the Complexity of the Equivalence Problem for Probabilistic Automata	2012-06-22	Paper
On Stabilization in Herman’s Algorithm	2011-07-07	Paper
Algorithmic Nominal Game Semantics	2011-05-19	Paper
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience	2010-04-27	Paper
Full Abstraction for Reduced ML	2009-03-31	Paper
Bad Variables Under Control	2009-03-05	Paper
Angelic semantics of fine-grained concurrency	2008-03-06	Paper
Third-order Idealized Algol with iteration is decidable	2008-03-05	Paper
Foundations of Software Science and Computation Structures	2007-09-28	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2007-05-02	Paper
CONCUR 2005 – Concurrency Theory	2006-11-01	Paper
Foundations of Software Science and Computational Structures	2005-11-10	Paper
Games for complexity of second-order call-by-name programs	2005-10-26	Paper
Functions with local state: regularity and undecidability	2005-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q4736993	2004-08-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Andrzej S. Murawski