Igor Walukiewicz

155 papers A* 24A 2B 28C 4Journal 67Unranked 24
YearRankTypeTitle / Venue / Authors
2026 J jnl
Layered automata: A canonical model for automata over infinite words.
CoRR
Antonio Casares, Christof Löding, Igor Walukiewicz
2026 — conf
Revisiting Stateful Partial-Order Reduction.
TACAS (2)
Frédéric Herbreteau, Gérald Point, Gautham Viswanathan, Igor Walukiewicz
2025 J jnl
Distributed controller synthesis for deadlock avoidance.
Log. Methods Comput. Sci.
Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz
2025 J jnl
Infinite lexicographic products of positional objectives.
CoRR
Antonio Casares, Pierre Ohlmann, Michal Skrzypczak, Igor Walukiewicz
2025 J jnl
Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning.
CoRR
Christof Löding, Igor Walukiewicz
2025 A* conf
Minimal History-Deterministic Co-Büchi Automata: Congruences and Passive Learning.
LICS
Christof Löding, Igor Walukiewicz
2025 B conf
Partial-Order Reduction Is Hard.
CONCUR
Frédéric Herbreteau, Sarah Larroze-Jardiné, Igor Walukiewicz
2024 J jnl
Revisiting Stateful Partial-Order Reduction.
CoRR
Frédéric Herbreteau, Sarah Larroze-Jardiné, Gérald Point, Igor Walukiewicz
2023 B conf
CONCUR Test-Of-Time Award 2023 (Invited Paper).
CONCUR
Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz
2023 B conf
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints.
CONCUR
Corto Mascle, Anca Muscholl, Igor Walukiewicz
2023 J jnl
Model-checking parametric lock-sharing systems against regular constraints.
CoRR
Corto Mascle, Anca Muscholl, Igor Walukiewicz
2023 J jnl
Report on Logic in Computer Science (LICS'23).
ACM SIGLOG News
Marco Gaboardi, Igor Walukiewicz
2022 J jnl
Abstraction-based control synthesis using partial information.
Eur. J. Control
W. Alejandro Apaza-Perez, Christophe Combastel, Igor Walukiewicz, Anca Muscholl, Ali Zolghadri
2022 A* conf
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods.
LICS
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2022 A* conf
Active learning for sound negotiations✱.
LICS
Anca Muscholl, Igor Walukiewicz
2022 B conf
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics.
CONCUR
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2022 A* conf
Distributed Controller Synthesis for Deadlock Avoidance.
ICALP
Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz
2022 J jnl
Distributed controller synthesis for deadlock avoidance.
CoRR
Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz
2021 J jnl
Active Learning for Sound Negotiations.
CoRR
Anca Muscholl, Igor Walukiewicz
2021 J jnl
Leafy Automata for Higher-Order Concurrency.
CoRR
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2021 B conf
Leafy automata for higher-order concurrency.
FoSSaCS
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2021 — ch.
Synthesis with finite automata.
Handbook of Automata Theory (II.)
Igor Walukiewicz
2021 A* conf
Verifying higher-order concurrency with data automata.
LICS
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
2020 B conf
Characterizing Consensus in the Heard-Of Model.
CONCUR
A. R. Balasubramanian, Igor Walukiewicz
2020 J jnl
Characterizing consensus in the Heard-Of model.
CoRR
A. R. Balasubramanian, Igor Walukiewicz
2020 J jnl
Why Liveness for Timed Automata Is Hard, and What We Can Do About It.
ACM Trans. Comput. Log.
Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
2019 A* conf
Lambda Y-Calculus With Priorities.
LICS
Igor Walukiewicz
2019 B conf
Revisiting Local Time Semantics for Networks of Timed Automata.
CONCUR
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2019 J jnl
Revisiting local time semantics for networks of timed automata.
CoRR
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2018 J jnl
Soundness in negotiations.
Log. Methods Comput. Sci.
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
2018 — ch.
The mu-calculus and Model Checking.
Handbook of Model Checking
Julian C. Bradfield, Igor Walukiewicz
2017 — conf
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems.
CAV (2)
Marie Fortin, Anca Muscholl, Igor Walukiewicz
2017 J jnl
Preface.
Fundam. Informaticae
David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz
2017 B conf
Reachability for Dynamic Parametric Processes.
VMCAI
Anca Muscholl, Helmut Seidl, Igor Walukiewicz
2017 J jnl
Soundness in negotiations.
CoRR
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
2017 J jnl
Static Analysis of Deterministic Negotiations.
CoRR
Javier Esparza, Anca Muscholl, Igor Walukiewicz
2017 A* conf
Static analysis of deterministic negotiations.
LICS
Javier Esparza, Anca Muscholl, Igor Walukiewicz
2017 J jnl
Typing weak MSOL properties.
Log. Methods Comput. Sci.
Sylvain Salvati, Igor Walukiewicz
2017 B conf
Verifying Parametric Thread Creation.
SOFSEM
Igor Walukiewicz
2016 J jnl
Automata theory and higher-order model-checking.
ACM SIGLOG News
Igor Walukiewicz
2016 J jnl
Better abstractions for timed automata.
Inf. Comput.
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2016 A* conf
Deciding the Topological Complexity of Büchi Languages.
ICALP
Michal Skrzypczak, Igor Walukiewicz
2016 J jnl
Higher-Order Model Checking (NII Shonan Meeting 2016-4).
NII Shonan Meet. Rep.
Naoki Kobayashi, Luke Ong, Igor Walukiewicz
2016 J jnl
On parametrized verification of asynchronous, shared-memory pushdown systems.
CoRR
Marie Fortin, Anca Muscholl, Igor Walukiewicz
2016 J jnl
Reachability for dynamic parametric processes.
CoRR
Anca Muscholl, Helmut Seidl, Igor Walukiewicz
2016 J jnl
Simply typed fixpoint calculus and collapsible pushdown automata.
Math. Struct. Comput. Sci.
Sylvain Salvati, Igor Walukiewicz
2016 B conf
Soundness in Negotiations.
CONCUR
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
2016 A* conf
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
LICS
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2016 J jnl
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
CoRR
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2016 — conf
Why Liveness for Timed Automata Is Hard, and What We Can Do About It.
FSTTCS
Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
2015 B conf
A Model for Behavioural Properties of Higher-order Programs.
CSL
Sylvain Salvati, Igor Walukiewicz
2015 C conf
A Note on Monitors and Büchi Automata.
ICTAC
Volker Diekert, Anca Muscholl, Igor Walukiewicz
2015 J jnl
A Note on Monitors and Büchi automata.
CoRR
Volker Diekert, Anca Muscholl, Igor Walukiewicz
2015 B ed.
Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings
FCT
Adrian Kosowski, Igor Walukiewicz
2015 — conf
Ordered Tree-Pushdown Systems.
FSTTCS
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2015 J jnl
Ordered Tree-Pushdown Systems.
CoRR
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2015 B conf
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.
CONCUR
Salvatore La Torre, Anca Muscholl, Igor Walukiewicz
2015 B conf
Typing Weak MSOL Properties.
FoSSaCS
Sylvain Salvati, Igor Walukiewicz
2015 J jnl
Using models to model-check recursive schemes.
Log. Methods Comput. Sci.
Sylvain Salvati, Igor Walukiewicz
2014 — conf
Distributed Synthesis for Acyclic Architectures.
FSTTCS
Anca Muscholl, Igor Walukiewicz
2014 J jnl
Distributed synthesis for acyclic architectures.
CoRR
Anca Muscholl, Igor Walukiewicz
2014 J jnl
Fast detection of cycles in timed automata.
CoRR
Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
2014 J jnl
Krivine machines and higher-order schemes.
Inf. Comput.
Sylvain Salvati, Igor Walukiewicz
2013 — conf
Asynchronous Games over Tree Architectures.
ICALP (2)
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
2013 — conf
Evaluation is MSOL-compatible.
FSTTCS
Sylvain Salvati, Igor Walukiewicz
2013 A* conf
Lazy Abstractions for Timed Automata.
CAV
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2013 J jnl
Lazy abstractions for timed automata
CoRR
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2013 — conf
Using Models to Model-Check Recursive Schemes.
TLCA
Sylvain Salvati, Igor Walukiewicz
2012 J jnl
An alternate proof of Statman's finite completeness theorem.
Inf. Process. Lett.
B. Srivathsan, Igor Walukiewicz
2012 J jnl
Asynchronous Games over Tree Architectures
CoRR
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
2012 A* conf
Better Abstractions for Timed Automata.
LICS
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2012 J jnl
Efficient emptiness check for timed Büchi automata.
Formal Methods Syst. Des.
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2012 — conf
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata.
RP
Sylvain Salvati, Igor Walukiewicz
2012 B conf
Simple Models for Recursive Schemes.
MFCS
Igor Walukiewicz
2012 J jnl
Weak Alternating Timed Automata
Log. Methods Comput. Sci.
Pawel Parys, Igor Walukiewicz
2012 J jnl
Wreath Products of Forest Algebras, with Applications to Tree Logics
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
2011 J jnl
Better abstractions for timed automata
CoRR
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2011 J jnl
Efficient Emptiness Check for Timed Büchi Automata (Extended version)
CoRR
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2011 — conf
Krivine Machines and Higher-Order Schemes.
ICALP (2)
Sylvain Salvati, Igor Walukiewicz
2011 J jnl
Using non-convex approximations for efficient analysis of timed automata
CoRR
Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
2011 — conf
Using non-convex approximations for efficient analysis of timed automata.
FSTTCS
Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
2010 — conf
10252 Abstracts Collection - Game Semantics and Program Verification.
Game Semantics and Program Verification
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
2010 — conf
10252 Executive Summary - Game Semantics and Program Verification.
Game Semantics and Program Verification
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
2010 A* conf
Efficient Emptiness Check for Timed Büchi Automata.
CAV
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
2010 — ed.
Game Semantics and Program Verification, 20.06. - 25.06.2010
Game Semantics and Program Verification
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
2010 — conf
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata.
ICALP (2)
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
2010 B conf
Synthesis: Words and Traces.
ATVA
Igor Walukiewicz
2009 — conf
Weak Alternating Timed Automata.
ICALP (2)
Pawel Parys, Igor Walukiewicz
2009 A* conf
Wreath Products of Forest Algebras, with Applications to Tree Logics.
LICS
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
2008 J jnl
A Lower Bound on Web Services Composition.
Log. Methods Comput. Sci.
Anca Muscholl, Igor Walukiewicz
2008 J jnl
A lower bound on web services composition
CoRR
Anca Muscholl, Igor Walukiewicz
2008 J jnl
Alternating timed automata.
ACM Trans. Comput. Log.
Slawomir Lasota, Igor Walukiewicz
2008 — ed.
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games
ICALP (1)
Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz
2008 — ed.
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations
ICALP (2)
Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz
2008 B conf
Finding Your Way in a Forest: On Different Types of Trees and Their Properties.
FoSSaCS
Igor Walukiewicz
2008 — conf
Forest algebras.
Logic and Automata
Mikolaj Bojanczyk, Igor Walukiewicz
2008 — conf
Nondeterministic controllers of nondeterministic processes.
Logic and Automata
André Arnold, Igor Walukiewicz
2008 J jnl
Third-order Idealized Algol with iteration is decidable.
Theor. Comput. Sci.
Andrzej S. Murawski, Igor Walukiewicz
2007 B conf
A Lower Bound on Web Services Composition.
FoSSaCS
Anca Muscholl, Igor Walukiewicz
2007 B conf
Minimizing Variants of Visibly Pushdown Automata.
MFCS
Patrick Chervet, Igor Walukiewicz
2007 J jnl
The Complexity of Games on Higher Order Pushdown Automata
CoRR
Thierry Cachat, Igor Walukiewicz
2006 J jnl
Characterizing EF and EX tree logics.
Theor. Comput. Sci.
Mikolaj Bojanczyk, Igor Walukiewicz
2006 J jnl
Positional Determinacy of Games with Infinitely Many Priorities
CoRR
Erich Grädel, Igor Walukiewicz
2006 J jnl
Positional Determinacy of Games with Infinitely Many Priorities.
Log. Methods Comput. Sci.
Erich Grädel, Igor Walukiewicz
2005 J jnl
Alternating Timed Automata
CoRR
Slawomir Lasota, Igor Walukiewicz
2005 B conf
Alternating Timed Automata.
FoSSaCS
Slawomir Lasota, Igor Walukiewicz
2005 J jnl
An NP-complete fragment of LTL.
Int. J. Found. Comput. Sci.
Anca Muscholl, Igor Walukiewicz
2005 J jnl
Difficult Configurations-On the Complexity of
Formal Methods Syst. Des.
Igor Walukiewicz
2005 — conf
From Logic to Games.
FSTTCS
Igor Walukiewicz
2005 A* conf
Idealized Algol with Ground Recursion, and DPDA Equivalence.
ICALP
Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz
2005 J jnl
Preface.
RAIRO Theor. Informatics Appl.
Igor Walukiewicz
2005 B conf
Third-Order Idealized Algol with Iteration Is Decidable.
FoSSaCS
Andrzej S. Murawski, Igor Walukiewicz
2005 A* conf
Unsafe Grammars and Panic Automata.
ICALP
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
2004 A* conf
A Landscape with Games in the Backgroun.
LICS
Igor Walukiewicz
2004 C conf
An NP-Complete Fragment of LTL.
Developments in Language Theory
Anca Muscholl, Igor Walukiewicz
2004 B conf
Characterizing EF and EX Tree Logics.
CONCUR
Mikolaj Bojanczyk, Igor Walukiewicz
2004 C conf
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata.
WoLLIC
Damian Niwinski, Igor Walukiewicz
2004 J jnl
Foreword.
RAIRO Theor. Informatics Appl.
Zoltán Ésik, Igor Walukiewicz
2004 B ed.
Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings
FoSSaCS
Igor Walukiewicz
2004 B conf
How to Fix It: Using Fixpoints in Different Contexts.
LPAR
Igor Walukiewicz
2003 J jnl
A gap property of deterministic tree languages.
Theor. Comput. Sci.
Damian Niwinski, Igor Walukiewicz
2003 — conf
Distributed Games.
FSTTCS
Swarup Mohalik, Igor Walukiewicz
2003 — ed.
FICS '03 - Fixed Points in Computer Science, Proceedings of an International Workshop, Warsaw, Poland, April 12-13, 2003.
FICS
Zoltán Ésik, Igor Walukiewicz
2003 J jnl
Games for synthesis of controllers with partial observation.
Theor. Comput. Sci.
André Arnold, Aymeric Vincent, Igor Walukiewicz
2003 — conf
Pushdown Games with Unboundedness and Regular Conditions.
FSTTCS
Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz
2003 B conf
Winning Strategies and Synthesis of Controllers (Tutorial).
CSL
Igor Walukiewicz
2002 J jnl
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
Inf. Comput.
P. S. Thiagarajan, Igor Walukiewicz
2002 — conf
Automata and Games for Synthesis.
AMAST
Igor Walukiewicz
2002 J jnl
Complexity of weak acceptance conditions in tree automata.
Inf. Process. Lett.
Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz
2002 C conf
Deciding low levels of tree-automata hierarchy.
WoLLIC
Igor Walukiewicz
2002 — conf
Describing properties of concurrent systems (Logic for Traces) (invited talk).
EXPRESS
Igor Walukiewicz
2002 J jnl
Local Logics for Traces.
J. Autom. Lang. Comb.
Igor Walukiewicz
2002 J jnl
Monadic second-order logic on tree-like structures.
Theor. Comput. Sci.
Igor Walukiewicz
2002 J jnl
Permissive strategies: from parity games to safety games.
RAIRO Theor. Informatics Appl.
Julien Bernet, David Janin, Igor Walukiewicz
2001 J jnl
Pushdown Processes: Games and Model-Checking.
Inf. Comput.
Igor Walukiewicz
2000 J jnl
Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus.
Inf. Comput.
Igor Walukiewicz
2000 — conf
Model Checking CTL Properties of Pushdown Systems.
FSTTCS
Igor Walukiewicz
1999 A* conf
Guarded Fixed Point Logic.
LICS
Erich Grädel, Igor Walukiewicz
1998 A* conf
Difficult Configurations - On the Complexity of LTrL.
ICALP
Igor Walukiewicz
1998 J jnl
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems.
Ann. Pure Appl. Log.
Bruno Courcelle, Igor Walukiewicz
1998 A conf
Relating Hierarchies of Word and Tree Automata.
STACS
Damian Niwinski, Igor Walukiewicz
1998 A* conf
The Horn Mu-calculus.
LICS
Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz
1997 A* conf
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
LICS
P. S. Thiagarajan, Igor Walukiewicz
1997 A* conf
How Much Memory is Needed to Win Infinite Games?
LICS
Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz
1996 J jnl
A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus.
Bull. Symb. Log.
Igor Walukiewicz
1996 J jnl
Games for the mu-Calculus.
Theor. Comput. Sci.
Damian Niwinski, Igor Walukiewicz
1996 A conf
Monadic Second Order Logic on Tree-Like Structures.
STACS
Igor Walukiewicz
1996 B conf
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic.
CONCUR
David Janin, Igor Walukiewicz
1996 A* conf
Pushdown Processes: Games and Model Checking.
CAV
Igor Walukiewicz
1995 B conf
Automata for the Modal mu-Calculus and related Results.
MFCS
David Janin, Igor Walukiewicz
1995 A* conf
Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus
LICS
Igor Walukiewicz
1993 J jnl
Gentzen-Type Axiomatization for PAL.
Theor. Comput. Sci.
Igor Walukiewicz
1993 A* conf
On Completeness of the mu-calculus
LICS
Igor Walukiewicz
1990 — conf
Decision Procedure for Checking Validity of PAL Formulas.
IMYCS
Igor Walukiewicz
1990 B conf
Gentzen Type Axiomatizations for PAL.
MFCS
Igor Walukiewicz