| 2026 | LICS | Layered Automata: A Canonical Model for Automata over Infinite Words. | Antonio Casares, Christof Lding, Igor Walukiewicz |
| 2026 | TACAS | Revisiting Stateful Partial-Order Reduction. | Frdric Herbreteau, Grald Point, Gautham Viswanathan, Igor Walukiewicz |
| 2025 | CONCUR | Partial-Order Reduction Is Hard. | Frdric Herbreteau, Sarah Larroze-Jardin, Igor Walukiewicz |
| 2025 | LICS | Minimal History-Deterministic Co-Bchi Automata: Congruences and Passive Learning. | Christof Lding, Igor Walukiewicz |
| 2023 | CONCUR | CONCUR Test-Of-Time Award 2023 (Invited Paper). | Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz |
| 2023 | CONCUR | Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. | Corto Mascle, Anca Muscholl, Igor Walukiewicz |
| 2022 | CONCUR | Checking Timed Bchi Automata Emptiness Using the Local-Time Semantics. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2022 | ICALP | Distributed Controller Synthesis for Deadlock Avoidance. | Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz |
| 2022 | LICS | Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. | R. Govind, Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2022 | LICS | Active learning for sound negotiations✱. | Anca Muscholl, Igor Walukiewicz |
| 2021 | FOSSACS | Leafy automata for higher-order concurrency. | Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz |
| 2021 | LICS | Verifying higher-order concurrency with data automata. | Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz |
| 2020 | CONCUR | Characterizing Consensus in the Heard-Of Model. | A. R. Balasubramanian, Igor Walukiewicz |
| 2019 | CONCUR | Revisiting Local Time Semantics for Networks of Timed Automata. | R. Govind, Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2019 | LICS | Lambda Y-Calculus With Priorities. | Igor Walukiewicz |
| 2017 | CAV | Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. | Marie Fortin, Anca Muscholl, Igor Walukiewicz |
| 2017 | LICS | Static analysis of deterministic negotiations. | Javier Esparza, Anca Muscholl, Igor Walukiewicz |
| 2017 | SOFSEM | Verifying Parametric Thread Creation. | Igor Walukiewicz |
| 2017 | VMCAI | Reachability for Dynamic Parametric Processes. | Anca Muscholl, Helmut Seidl, Igor Walukiewicz |
| 2016 | CONCUR | Soundness in Negotiations. | Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz |
| 2016 | ICALP | Deciding the Topological Complexity of Bchi Languages. | Michal Skrzypczak, Igor Walukiewicz |
| 2016 | LICS | The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. | Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz |
| 2015 | CONCUR | Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. | Salvatore La Torre, Anca Muscholl, Igor Walukiewicz |
| 2015 | CSL | A Model for Behavioural Properties of Higher-order Programs. | Sylvain Salvati, Igor Walukiewicz |
| 2015 | FOSSACS | Typing Weak MSOL Properties. | Sylvain Salvati, Igor Walukiewicz |
| 2015 | ICTAC | A Note on Monitors and Bchi Automata. | Volker Diekert, Anca Muscholl, Igor Walukiewicz |
| 2013 | CAV | Lazy Abstractions for Timed Automata. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2013 | ICALP | Asynchronous Games over Tree Architectures. | Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz |
| 2012 | LICS | Better Abstractions for Timed Automata. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2012 | MFCS | Simple Models for Recursive Schemes. | Igor Walukiewicz |
| 2011 | ICALP | Krivine Machines and Higher-Order Schemes. | Sylvain Salvati, Igor Walukiewicz |
| 2010 | ATVA | Synthesis: Words and Traces. | Igor Walukiewicz |
| 2010 | CAV | Efficient Emptiness Check for Timed Bchi Automata. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2010 | ICALP | Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. | Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz |
| 2009 | ICALP | Weak Alternating Timed Automata. | Pawel Parys, Igor Walukiewicz |
| 2009 | LICS | Wreath Products of Forest Algebras, with Applications to Tree Logics. | Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz |
| 2008 | FOSSACS | Finding Your Way in a Forest: On Different Types of Trees and Their Properties. | Igor Walukiewicz |
| 2007 | FOSSACS | A Lower Bound on Web Services Composition. | Anca Muscholl, Igor Walukiewicz |
| 2007 | MFCS | Minimizing Variants of Visibly Pushdown Automata. | Patrick Chervet, Igor Walukiewicz |
| 2005 | FOSSACS | Alternating Timed Automata. | Slawomir Lasota, Igor Walukiewicz |
| 2005 | FOSSACS | Third-Order Idealized Algol with Iteration Is Decidable. | Andrzej S. Murawski, Igor Walukiewicz |
| 2005 | ICALP | Unsafe Grammars and Panic Automata. | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz |
| 2005 | ICALP | Idealized Algol with Ground Recursion, and DPDA Equivalence. | Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz |
| 2004 | CONCUR | Characterizing EF and EX Tree Logics. | Mikolaj Bojanczyk, Igor Walukiewicz |
| 2004 | DLT | An NP-Complete Fragment of LTL. | Anca Muscholl, Igor Walukiewicz |
| 2004 | LICS | A Landscape with Games in the Backgroun. | Igor Walukiewicz |
| 2004 | LPAR | How to Fix It: Using Fixpoints in Different Contexts. | Igor Walukiewicz |
| 2003 | CSL | Winning Strategies and Synthesis of Controllers (Tutorial). | Igor Walukiewicz |
| 1999 | LICS | Guarded Fixed Point Logic. | Erich Grdel, Igor Walukiewicz |
| 1998 | ICALP | Difficult Configurations - On the Complexity of LTrL. | Igor Walukiewicz |
| 1998 | LICS | The Horn Mu-calculus. | Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz |
| 1998 | STACS | Relating Hierarchies of Word and Tree Automata. | Damian Niwinski, Igor Walukiewicz |
| 1997 | LICS | How Much Memory is Needed to Win Infinite Games? | Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz |
| 1997 | LICS | An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. | P. S. Thiagarajan, Igor Walukiewicz |
| 1996 | CAV | Pushdown Processes: Games and Model Checking. | Igor Walukiewicz |
| 1996 | CONCUR | On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. | David Janin, Igor Walukiewicz |
| 1996 | STACS | Monadic Second Order Logic on Tree-Like Structures. | Igor Walukiewicz |
| 1995 | LICS | Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus | Igor Walukiewicz |
| 1995 | MFCS | Automata for the Modal mu-Calculus and related Results. | David Janin, Igor Walukiewicz |
| 1993 | LICS | On Completeness of the mu-calculus | Igor Walukiewicz |
| 1990 | MFCS | Gentzen Type Axiomatizations for PAL. | Igor Walukiewicz |