Igor Walukiewicz

ACM SIGLOG News, October, 2023

Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints.

[BibT_eX]

[DOI]

Corto Mascle

Proceedings of the 34th International Conference on Concurrency Theory, 2023

CONCUR Test-Of-Time Award 2023 (Invited Paper).

[BibT_eX]

[DOI]

Bengt Jonsson

Marta Kwiatkowska

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Abstraction-based control synthesis using partial information.

[BibT_eX]

[DOI]

W. Alejandro Apaza-Perez

Eur. J. Control, 2022

Active learning for sound negotiations✱.

[BibT_eX]

[DOI]

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

Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods.

[BibT_eX]

[DOI]

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

Distributed Controller Synthesis for Deadlock Avoidance.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

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

Synthesis with finite automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2020

Why Liveness for Timed Automata Is Hard, and What We Can Do About It.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Characterizing Consensus in the Heard-Of Model.

[BibT_eX]

[DOI]

A. R. Balasubramanian

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Lambda Y-Calculus With Priorities.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Revisiting Local Time Semantics for Networks of Timed Automata.

[BibT_eX]

[DOI]

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

2018

The mu-calculus and Model Checking.

[BibT_eX]

[DOI]

Julian C. Bradfield

Proceedings of the Handbook of Model Checking., 2018

Soundness in negotiations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

2017

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Typing weak MSOL properties.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

Reachability for Dynamic Parametric Processes.

[BibT_eX]

[DOI]

Helmut Seidl

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Verifying Parametric Thread Creation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Static analysis of deterministic negotiations.

[BibT_eX]

[DOI]

Javier Esparza

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems.

[BibT_eX]

[DOI]

Marie Fortin

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016

Automata theory and higher-order model-checking.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2016

Higher-Order Model Checking (NII Shonan Meeting 2016-4).

[BibT_eX]

[DOI]

Naoki Kobayashi

Luke Ong

NII Shonan Meet. Rep., 2016

Simply typed fixpoint calculus and collapsible pushdown automata.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2016

Better abstractions for timed automata.

[BibT_eX]

[DOI]

Inf. Comput., 2016

On parametrized verification of asynchronous, shared-memory pushdown systems.

[BibT_eX]

[DOI]

Marie Fortin

CoRR, 2016

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Deciding the Topological Complexity of Büchi Languages.

[BibT_eX]

[DOI]

Michal Skrzypczak

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Using models to model-check recursive schemes.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

A Note on Monitors and Büchi Automata.

[BibT_eX]

[DOI]

Volker Diekert

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Ordered Tree-Pushdown Systems.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

A Model for Behavioural Properties of Higher-order Programs.

[BibT_eX]

[DOI]

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.

[BibT_eX]

[DOI]

Salvatore La Torre

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Krivine machines and higher-order schemes.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Fast detection of cycles in timed automata.

[BibT_eX]

[DOI]

CoRR, 2014

Distributed Synthesis for Acyclic Architectures.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Asynchronous Games over Tree Architectures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Evaluation is MSOL-compatible.

[BibT_eX]

[DOI]

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

Lazy Abstractions for Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

An alternate proof of Statman's finite completeness theorem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Efficient emptiness check for timed Büchi automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2012

Wreath Products of Forest Algebras, with Applications to Tree Logics

[BibT_eX]

[DOI]

Mikolaj Bojanczyk

Howard Straubing

Log. Methods Comput. Sci., 2012

Weak Alternating Timed Automata

[BibT_eX]

[DOI]

Pawel Parys

Log. Methods Comput. Sci., 2012

Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 6th International Workshop, 2012

Simple Models for Recursive Schemes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Efficient Emptiness Check for Timed Büchi Automata (Extended version)

[BibT_eX]

[DOI]

CoRR, 2011

Using non-convex approximations for efficient analysis of timed automata.

[BibT_eX]

[DOI]

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

2010

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 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

Synthesis: Words and Traces.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2010

2008

Alternating timed automata.

[BibT_eX]

[DOI]

Slawomir Lasota

ACM Trans. Comput. Log., 2008

Third-order Idealized Algol with iteration is decidable.

[BibT_eX]

[DOI]

Andrzej S. Murawski

Theor. Comput. Sci., 2008

A Lower Bound on Web Services Composition.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Finding Your Way in a Forest: On Different Types of Trees and Their Properties.

[BibT_eX]

[DOI]

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

Forest algebras.

[BibT_eX]

Mikolaj Bojanczyk

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

Nondeterministic controllers of nondeterministic processes.

[BibT_eX]

André Arnold

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

The Complexity of Games on Higher Order Pushdown Automata

[BibT_eX]

[DOI]

Thierry Cachat

CoRR, 2007

Minimizing Variants of Visibly Pushdown Automata.

[BibT_eX]

[DOI]

Patrick Chervet

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Characterizing EF and EX tree logics.

[BibT_eX]

[DOI]

Mikolaj Bojanczyk

Theor. Comput. Sci., 2006

Positional Determinacy of Games with Infinitely Many Priorities.

[BibT_eX]

[DOI]

Erich Grädel

Log. Methods Comput. Sci., 2006

2005

Preface.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

An NP-complete fragment of LTL.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Difficult Configurations-On the Complexity of <i>LTrL</i>.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2005

Idealized Algol with Ground Recursion, and DPDA Equivalence.

[BibT_eX]

[DOI]

Andrzej S. Murawski

C.-H. Luke Ong

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

Unsafe Grammars and Panic Automata.

[BibT_eX]

[DOI]

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

From Logic to Games.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004

Foreword.

[BibT_eX]

[DOI]

Zoltán Ésik

RAIRO Theor. Informatics Appl., 2004

Deciding Nondeterministic Hierarchy of Deterministic Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the 11th Workshop on Logic, Language, Information and Computation, 2004

How to Fix It: Using Fixpoints in Different Contexts.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2004

A Landscape with Games in the Backgroun.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

A gap property of deterministic tree languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Games for synthesis of controllers with partial observation.

[BibT_eX]

[DOI]

André Arnold

Aymeric Vincent

Theor. Comput. Sci., 2003

Distributed Games.

[BibT_eX]

[DOI]

Swarup Mohalik

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Pushdown Games with Unboundedness and Regular Conditions.

[BibT_eX]

[DOI]

Alexis-Julien Bouquet

Olivier Serre

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Winning Strategies and Synthesis of Controllers (Tutorial).

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Monadic second-order logic on tree-like structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Local Logics for Traces.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

Permissive strategies: from parity games to safety games.

[BibT_eX]

[DOI]

Julien Bernet

David Janin

RAIRO Theor. Informatics Appl., 2002

Complexity of weak acceptance conditions in tree automata.

[BibT_eX]

[DOI]

Jakub Neumann

Andrzej Szepietowski

Inf. Process. Lett., 2002

An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.

[BibT_eX]

[DOI]

P. S. Thiagarajan

Inf. Comput., 2002

Deciding low levels of tree-automata hierarchy.

[BibT_eX]

[DOI]

Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002

Describing properties of concurrent systems (Logic for Traces) (invited talk).

[BibT_eX]

[DOI]

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Automata and Games for Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2002

2001

Pushdown Processes: Games and Model-Checking.

[BibT_eX]

[DOI]

Inf. Comput., 2001

2000

Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus.

[BibT_eX]

[DOI]

Inf. Comput., 2000

Model Checking CTL Properties of Pushdown Systems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

Guarded Fixed Point Logic.

[BibT_eX]

[DOI]

Erich Grädel

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems.

[BibT_eX]

[DOI]

Bruno Courcelle

Ann. Pure Appl. Log., 1998

Relating Hierarchies of Word and Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

The Horn Mu-calculus.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Difficult Configurations - On the Complexity of LTrL.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

How Much Memory is Needed to Win Infinite Games?

[BibT_eX]

[DOI]

Stefan Dziembowski

Marcin Jurdzinski

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996

Games for the mu-Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1996

On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic.

[BibT_eX]

[DOI]

David Janin

Proceedings of the CONCUR '96, 1996

1995

Automata for the Modal mu-Calculus and related Results.

[BibT_eX]

[DOI]

David Janin

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1995

1993

Gentzen-Type Axiomatization for PAL.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On Completeness of the mu-calculus

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1990

Gentzen Type Axiomatizations for PAL.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Decision Procedure for Checking Validity of PAL Formulas.

[BibT_eX]

[DOI]