Decision Procedure for Checking Validity of PAL Formulas. - Igor Walukiewicz (IMYCS, 1990)

Gentzen Type Axiomatizations for PAL. - Igor Walukiewicz (MFCS, 1990)

On Completeness of the mu-calculus - Igor Walukiewicz (LICS, 1993)

Gentzen-Type Axiomatization for PAL. - Igor Walukiewicz (Theor. Comput. Sci., 1993)

Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus - Igor Walukiewicz (LICS, 1995)

Automata for the Modal mu-Calculus and related Results. - David Janin; Igor Walukiewicz (MFCS, 1995)

On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. - David Janin; Igor Walukiewicz (CONCUR, 1996)

A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus. - Igor Walukiewicz (Bull. Symb. Log., 1996)

Games for the mu-Calculus. - Damian Niwinski; Igor Walukiewicz (Theor. Comput. Sci., 1996)

How Much Memory is Needed to Win Infinite Games? - Stefan Dziembowski; Marcin Jurdzinski; Igor Walukiewicz (LICS, 1997)

Difficult Configurations - On the Complexity of LTrL. - Igor Walukiewicz (ICALP, 1998)

The Horn Mu-calculus. - Witold Charatonik; David A. McAllester; Damian Niwinski; Andreas Podelski; Igor Walukiewicz (LICS, 1998)

Relating Hierarchies of Word and Tree Automata. - Damian Niwinski; Igor Walukiewicz (STACS, 1998)

Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. - Bruno Courcelle; Igor Walukiewicz (Ann. Pure Appl. Log., 1998)

Guarded Fixed Point Logic. - Erich Grädel; Igor Walukiewicz (LICS, 1999)

Model Checking CTL Properties of Pushdown Systems. - Igor Walukiewicz (FSTTCS, 2000)

Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus. - Igor Walukiewicz (Inf. Comput., 2000)

Pushdown Processes: Games and Model-Checking. - Igor Walukiewicz (Inf. Comput., 2001)

Automata and Games for Synthesis. - Igor Walukiewicz (AMAST, 2002)

Describing properties of concurrent systems (Logic for Traces) (invited talk). - Igor Walukiewicz (EXPRESS, 2002)

Deciding low levels of tree-automata hierarchy. - Igor Walukiewicz (WoLLIC, 2002)

An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. - P. S. Thiagarajan; Igor Walukiewicz (Inf. Comput., 2002)

Complexity of weak acceptance conditions in tree automata. - Jakub Neumann; Andrzej Szepietowski; Igor Walukiewicz (Inf. Process. Lett., 2002)

Permissive strategies: from parity games to safety games. - Julien Bernet; David Janin; Igor Walukiewicz (RAIRO Theor. Informatics Appl., 2002)

Local Logics for Traces. - Igor Walukiewicz (J. Autom. Lang. Comb., 2002)

Monadic second-order logic on tree-like structures. - Igor Walukiewicz (Theor. Comput. Sci., 2002)

Winning Strategies and Synthesis of Controllers (Tutorial). - Igor Walukiewicz (CSL, 2003)

Pushdown Games with Unboundedness and Regular Conditions. - Alexis-Julien Bouquet; Olivier Serre; Igor Walukiewicz (FSTTCS, 2003)

Distributed Games. - Swarup Mohalik; Igor Walukiewicz (FSTTCS, 2003)

Games for synthesis of controllers with partial observation. - André Arnold; Aymeric Vincent; Igor Walukiewicz (Theor. Comput. Sci., 2003)

A gap property of deterministic tree languages. - Damian Niwinski; Igor Walukiewicz (Theor. Comput. Sci., 2003)

A Landscape with Games in the Backgroun. - Igor Walukiewicz (LICS, 2004)

How to Fix It: Using Fixpoints in Different Contexts. - Igor Walukiewicz (LPAR, 2004)

Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. - Damian Niwinski; Igor Walukiewicz (WoLLIC, 2004)

Foreword. - Zoltán Ésik; Igor Walukiewicz (RAIRO Theor. Informatics Appl., 2004)

From Logic to Games. - Igor Walukiewicz (FSTTCS, 2005)

Unsafe Grammars and Panic Automata. - Teodor Knapik; Damian Niwinski; Pawel Urzyczyn; Igor Walukiewicz (ICALP, 2005)

Idealized Algol with Ground Recursion, and DPDA Equivalence. - Andrzej S. Murawski; C.-H. Luke Ong; Igor Walukiewicz (ICALP, 2005)

Difficult Configurations-On the Complexity of LTrL. - Igor Walukiewicz (Formal Methods Syst. Des., 2005)

An NP-complete fragment of LTL. - Anca Muscholl; Igor Walukiewicz (Int. J. Found. Comput. Sci., 2005)

Preface. - Igor Walukiewicz (RAIRO Theor. Informatics Appl., 2005)

Positional Determinacy of Games with Infinitely Many Priorities. - Erich Grädel; Igor Walukiewicz (Log. Methods Comput. Sci., 2006)

Characterizing EF and EX tree logics. - Mikolaj Bojanczyk; Igor Walukiewicz (Theor. Comput. Sci., 2006)

Minimizing Variants of Visibly Pushdown Automata. - Patrick Chervet; Igor Walukiewicz (MFCS, 2007)

The Complexity of Games on Higher Order Pushdown Automata - Thierry Cachat; Igor Walukiewicz (CoRR, 2007)

Nondeterministic controllers of nondeterministic processes. - André Arnold; Igor Walukiewicz (Logic and Automata, 2008)

Forest algebras. - Mikolaj Bojanczyk; Igor Walukiewicz (Logic and Automata, 2008)

Finding Your Way in a Forest: On Different Types of Trees and Their Properties. - Igor Walukiewicz (FoSSaCS, 2008)

A Lower Bound on Web Services Composition. - Anca Muscholl; Igor Walukiewicz (Log. Methods Comput. Sci., 2008)

Third-order Idealized Algol with iteration is decidable. - Andrzej S. Murawski; Igor Walukiewicz (Theor. Comput. Sci., 2008)

Alternating timed automata. - Slawomir Lasota 001; Igor Walukiewicz (ACM Trans. Comput. Log., 2008)

Synthesis: Words and Traces. - Igor Walukiewicz (ATVA, 2010)

10252 Abstracts Collection - Game Semantics and Program Verification. - Paul-André Melliès; Andrzej S. Murawski; Andrea Schalk; Igor Walukiewicz (Game Semantics and Program Verification, 2010)

10252 Executive Summary - Game Semantics and Program Verification. - Paul-André Melliès; Andrzej S. Murawski; Andrea Schalk; Igor Walukiewicz (Game Semantics and Program Verification, 2010)

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. - Blaise Genest; Hugo Gimbert; Anca Muscholl; Igor Walukiewicz (ICALP (2), 2010)

Using non-convex approximations for efficient analysis of timed automata. - Frédéric Herbreteau; Dileep Kini; B. Srivathsan; Igor Walukiewicz (FSTTCS, 2011)

Efficient Emptiness Check for Timed Büchi Automata (Extended version) - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CoRR, 2011)

Simple Models for Recursive Schemes. - Igor Walukiewicz (MFCS, 2012)

Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. - Sylvain Salvati; Igor Walukiewicz (RP, 2012)

Weak Alternating Timed Automata - Pawel Parys; Igor Walukiewicz (Log. Methods Comput. Sci., 2012)

Wreath Products of Forest Algebras, with Applications to Tree Logics - Mikolaj Bojanczyk; Howard Straubing; Igor Walukiewicz (Log. Methods Comput. Sci., 2012)

Efficient emptiness check for timed Büchi automata. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (Formal Methods Syst. Des., 2012)

An alternate proof of Statman's finite completeness theorem. - B. Srivathsan; Igor Walukiewicz (Inf. Process. Lett., 2012)

Lazy Abstractions for Timed Automata. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CAV, 2013)

Evaluation is MSOL-compatible. - Sylvain Salvati; Igor Walukiewicz (FSTTCS, 2013)

Asynchronous Games over Tree Architectures. - Blaise Genest; Hugo Gimbert; Anca Muscholl; Igor Walukiewicz (ICALP (2), 2013)

Distributed Synthesis for Acyclic Architectures. - Anca Muscholl; Igor Walukiewicz (FSTTCS, 2014)

Fast detection of cycles in timed automata. - Aakash Deshpande; Frédéric Herbreteau; B. Srivathsan; Thanh-Tung Tran; Igor Walukiewicz (CoRR, 2014)

Krivine machines and higher-order schemes. - Sylvain Salvati; Igor Walukiewicz (Inf. Comput., 2014)

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. - Salvatore La Torre; Anca Muscholl; Igor Walukiewicz (CONCUR, 2015)

A Model for Behavioural Properties of Higher-order Programs. - Sylvain Salvati; Igor Walukiewicz (CSL, 2015)

Ordered Tree-Pushdown Systems. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (FSTTCS, 2015)

A Note on Monitors and Büchi Automata. - Volker Diekert; Anca Muscholl; Igor Walukiewicz (ICTAC, 2015)

Using models to model-check recursive schemes. - Sylvain Salvati; Igor Walukiewicz (Log. Methods Comput. Sci., 2015)

Deciding the Topological Complexity of Büchi Languages. - Michal Skrzypczak; Igor Walukiewicz (ICALP, 2016)

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (LICS, 2016)

On parametrized verification of asynchronous, shared-memory pushdown systems. - Marie Fortin; Anca Muscholl; Igor Walukiewicz (CoRR, 2016)

Better abstractions for timed automata. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (Inf. Comput., 2016)

Simply typed fixpoint calculus and collapsible pushdown automata. - Sylvain Salvati; Igor Walukiewicz (Math. Struct. Comput. Sci., 2016)

Higher-Order Model Checking (NII Shonan Meeting 2016-4). - Naoki Kobayashi 001; Luke Ong; Igor Walukiewicz (NII Shonan Meet. Rep., 2016)

Automata theory and higher-order model-checking. - Igor Walukiewicz (ACM SIGLOG News, 2016)

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. - Marie Fortin; Anca Muscholl; Igor Walukiewicz (CAV (2), 2017)

Static analysis of deterministic negotiations. - Javier Esparza; Anca Muscholl; Igor Walukiewicz (LICS, 2017)

Verifying Parametric Thread Creation. - Igor Walukiewicz (SOFSEM, 2017)

Reachability for Dynamic Parametric Processes. - Anca Muscholl; Helmut Seidl; Igor Walukiewicz (VMCAI, 2017)

Typing weak MSOL properties. - Sylvain Salvati; Igor Walukiewicz (Log. Methods Comput. Sci., 2017)

Preface. - David Baelde; Arnaud Carayol; Ralph Matthes; Igor Walukiewicz (Fundam. Informaticae, 2017)

Soundness in negotiations. - Javier Esparza; Denis Kuperberg; Anca Muscholl; Igor Walukiewicz (Log. Methods Comput. Sci., 2018)

The mu-calculus and Model Checking. - Julian C. Bradfield; Igor Walukiewicz (Handbook of Model Checking, 2018)

Revisiting Local Time Semantics for Networks of Timed Automata. - R. Govind 001; Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CONCUR, 2019)

Lambda Y-Calculus With Priorities. - Igor Walukiewicz (LICS, 2019)

Characterizing Consensus in the Heard-Of Model. - A. R. Balasubramanian; Igor Walukiewicz (CONCUR, 2020)

Why Liveness for Timed Automata Is Hard, and What We Can Do About It. - Frédéric Herbreteau; B. Srivathsan; Thanh-Tung Tran; Igor Walukiewicz (ACM Trans. Comput. Log., 2020)

Synthesis with finite automata. - Igor Walukiewicz (Handbook of Automata Theory (II.), 2021)

Leafy automata for higher-order concurrency. - Alex Dixon; Ranko Lazic 001; Andrzej S. Murawski; Igor Walukiewicz (FoSSaCS, 2021)

Verifying higher-order concurrency with data automata. - Alex Dixon; Ranko Lazic 001; Andrzej S. Murawski; Igor Walukiewicz (LICS, 2021)

Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CONCUR, 2022)

Distributed Controller Synthesis for Deadlock Avoidance. - Hugo Gimbert; Corto Mascle; Anca Muscholl; Igor Walukiewicz (ICALP, 2022)

Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. - R. Govind 001; Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (LICS, 2022)

Active learning for sound negotiations✱. - Anca Muscholl; Igor Walukiewicz (LICS, 2022)

Abstraction-based control synthesis using partial information. - W. Alejandro Apaza-Perez; Christophe Combastel; Igor Walukiewicz; Anca Muscholl; Ali Zolghadri (Eur. J. Control, 2022)

CONCUR Test-Of-Time Award 2023 (Invited Paper). - Bengt Jonsson 001; Marta Kwiatkowska; Igor Walukiewicz (CONCUR, 2023)

Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. - Corto Mascle; Anca Muscholl; Igor Walukiewicz (CONCUR, 2023)

Report on Logic in Computer Science (LICS'23). - Marco Gaboardi; Igor Walukiewicz (ACM SIGLOG News, 2023)

Revisiting Stateful Partial-Order Reduction. - Frédéric Herbreteau; Sarah Larroze-Jardiné; Gérald Point; Igor Walukiewicz (CoRR, 2024)

Partial-Order Reduction Is Hard. - Frédéric Herbreteau; Sarah Larroze-Jardiné; Igor Walukiewicz (CONCUR, 2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning. - Christof Löding; Igor Walukiewicz (CoRR, 2025)

Infinite lexicographic products of positional objectives. - Antonio Casares; Pierre Ohlmann; Michal Skrzypczak; Igor Walukiewicz (CoRR, 2025)