Andrzej S. Murawski

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

Saturating automata for game semantics.

[BibT_eX]

[DOI]

Alex Dixon

Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach.

[BibT_eX]

[DOI]

Fabian Zaiser

Chih-Hao Luke Ong

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Operational Algorithmic Game Semantics.

[BibT_eX]

[DOI]

Benedict Bunting

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

From the Editor.

[BibT_eX]

[DOI]

ACM SIGLOG News, October, 2022

The Big-O Problem.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Probabilistic Verification Beyond Context-Freeness.

[BibT_eX]

[DOI]

Guanyan Li

Luke Ong

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

Collapsible Pushdown Parity Games.

[BibT_eX]

[DOI]

Christopher H. Broadbent

ACM Trans. Comput. Log., 2021

Game Semantics for Interface Middleweight Java.

[BibT_eX]

[DOI]

J. ACM, 2021

Compositional relational reasoning via operational game semantics.

[BibT_eX]

[DOI]

Guilhem Jaber

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Verifying higher-order concurrency with data automata.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Leafy automata for higher-order concurrency.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2021

Complete trace models of state and control.

[BibT_eX]

[DOI]

Guilhem Jaber

Proceedings of the Programming Languages and Systems, 2021

2020

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

[BibT_eX]

[DOI]

ACM SIGLOG News, 2020

The Big-O Problem for Labelled Markov Chains and Weighted Automata.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2019

Higher-order linearisability.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2019

On the Expressivity of Linear Recursion Schemes.

[BibT_eX]

[DOI]

Pierre Clairambault

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Asymmetric Distances for Approximate Differential Privacy.

[BibT_eX]

[DOI]

Dmitry Chistikov

David Purser

Proceedings of the 30th International Conference on Concurrency Theory, 2019

DEQ: Equivalence Checker for Deterministic Register Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2019

2018

Linearity in higher-order recursion schemes.

[BibT_eX]

[DOI]

Pierre Clairambault

Charles Grellois

Proc. ACM Program. Lang., 2018

Algorithmic games for full ground references.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2018

Program Equivalence (Dagstuhl Seminar 18151).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Bisimilarity Distances for Approximate Differential Privacy.

[BibT_eX]

[DOI]

Dmitry Chistikov

David Purser

Proceedings of the Automated Technology for Verification and Analysis, 2018

2017

Collapsible Pushdown Automata and Recursion Schemes.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

Reachability in pushdown register automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

ML and Extended Branching VASS.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2017

2016

An invitation to game semantics.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2016

Nominal Game Semantics.

[BibT_eX]

[DOI]

Found. Trends Program. Lang., 2016

Block structure vs scope extrusion: between innocence and omniscience.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2016

Contextual Approximation and Higher-Order Procedures.

[BibT_eX]

[DOI]

Ranko Lazic

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

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

[BibT_eX]

[DOI]

Atsushi Igarashi

NII Shonan Meet. Rep., 2015

Bisimilarity in Fresh-Register Automata.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Weak and Nested Class Memory Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

Fragments of ML Decidable by Nested Data Class Memory Automata.

[BibT_eX]

[DOI]

David Hopkins

Proceedings of the Foundations of Software Science and Computation Structures, 2015

Game Semantic Analysis of Equivalence in IMJ.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2015

A Contextual Equivalence Checker for IMJ ∗.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2015

2014

Game Semantics for Nominal Exceptions.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Algorithmic probabilistic game semantics - Playing games with automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2013

On the Complexity of Equivalence and Minimisation for Q-weighted Automata

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Full abstraction for Reduced ML.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2013

Bisimilarity of Pushdown Automata is Nonelementary.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Böhm Trees as Higher-Order Recursive Schemes.

[BibT_eX]

[DOI]

Pierre Clairambault

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Deconstructing General References via Game Semantics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2013

Towards Nominal Abramsky.

[BibT_eX]

[DOI]

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

2012

Three tokens in Herman's algorithm.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2012

Bisimilarity of Pushdown Systems is Nonelementary

[BibT_eX]

[DOI]

CoRR, 2012

On the Complexity of the Equivalence Problem for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

APEX: An Analyzer for Open Probabilistic Programs.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Hector: An Equivalence Checker for a Higher-Order Fragment of ML.

[BibT_eX]

[DOI]

David Hopkins

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

Game Semantics for Good General References.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

On Stabilization in Herman's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Fragment of ML Decidable by Visibly Pushdown Automata.

[BibT_eX]

[DOI]

David Hopkins

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Algorithmic Nominal Game Semantics.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2011

Language Equivalence for Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010

Full Abstraction Without Synchronization Primitives.

[BibT_eX]

[DOI]

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

10252 Executive Summary - Game Semantics and Program Verification.

[BibT_eX]

[DOI]

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

10252 Abstracts Collection - Game Semantics and Program Verification.

[BibT_eX]

[DOI]

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

2008

Third-order Idealized Algol with iteration is decidable.

[BibT_eX]

[DOI]

Igor Walukiewicz

Theor. Comput. Sci., 2008

Angelic semantics of fine-grained concurrency.

[BibT_eX]

[DOI]

Dan R. Ghica

Ann. Pure Appl. Log., 2008

On Automated Verification of Probabilistic Programs.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Reachability Games and Game Semantics: Comparing Nondeterministic Programs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Bad Variables Under Control.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Fast verification of MLL proof nets via IMLL.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2006

Syntactic control of concurrency.

[BibT_eX]

[DOI]

Dan R. Ghica

Theor. Comput. Sci., 2006

Compositional Model Extraction for Higher-Order Concurrent Programs.

[BibT_eX]

[DOI]

Dan R. Ghica

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.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2005

Games for complexity of second-order call-by-name programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Functions with local state: Regularity and undecidability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Idealized Algol with Ground Recursion, and DPDA Equivalence.

[BibT_eX]

[DOI]

Igor Walukiewicz

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Functions with local state: from regularity to undecidability.

[BibT_eX]

Proceedings of the 1st Workshop on Games for Logic and Programming Languages, 2005

On Probabilistic Program Equivalence and Refinement.

[BibT_eX]

[DOI]

Joël Ouaknine

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

On an interpretation of safe recursion in light affine logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Applying Game Semantics to Compositional Software Modeling and Verification.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Nominal Games and Full Abstraction for the Nu-Calculus.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On Program Equivalence in Languages with Ground-Type References.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

PhD thesis, 2001

Evolving Games and Essential Nets for Affine Polymorphism.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

Static Monotonicity Analysis for lambda-Definable Functions. over Lattices.

[BibT_eX]

Kwangkeun Yi

Proceedings of the Second Asian Workshop on Programming Languages and Systems, 2001

2000

Dominator Trees and Fast Verification of Proof Nets.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Discreet Games, Light Affine Logic and PTIME Computation.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2000

1999

Exhausting Strategies, Joker Games and IMLL with Units.

[BibT_eX]

[DOI]