Igor Walukiewicz

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 48

Top Venues

CoRR

CONCUR

LICS

FSTTCS

Publications

Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz
CONCUR Test-Of-Time Award 2023 (Invited Paper). CONCUR (2023)
Corto Mascle, Anca Muscholl, Igor Walukiewicz
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. CONCUR (2023)
Marco Gaboardi, Igor Walukiewicz
Report on Logic in Computer Science (LICS'23). ACM SIGLOG News 10 (4) (2023)
Corto Mascle, Anca Muscholl, Igor Walukiewicz
Model-checking parametric lock-sharing systems against regular constraints. CoRR (2023)
Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz
Distributed Controller Synthesis for Deadlock Avoidance. ICALP (2022)
W. Alejandro Apaza-Perez, Christophe Combastel, Igor Walukiewicz, Anca Muscholl, Ali Zolghadri
Abstraction-based control synthesis using partial information. Eur. J. Control 63 (2022)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. CONCUR (2022)
Anca Muscholl, Igor Walukiewicz
Active learning for sound negotiations✱. LICS (2022)
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. LICS (2022)
Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz
Distributed controller synthesis for deadlock avoidance. CoRR (2022)
Anca Muscholl, Igor Walukiewicz
Active Learning for Sound Negotiations. CoRR (2021)
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
Verifying higher-order concurrency with data automata. LICS (2021)
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
Leafy Automata for Higher-Order Concurrency. CoRR (2021)
Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz
Leafy automata for higher-order concurrency. FoSSaCS (2021)
A. R. Balasubramanian, Igor Walukiewicz
Characterizing consensus in the Heard-Of model. CoRR (2020)
A. R. Balasubramanian, Igor Walukiewicz
Characterizing Consensus in the Heard-Of Model. CONCUR (2020)
Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. ACM Trans. Comput. Log. 21 (3) (2020)
Igor Walukiewicz
Lambda Y-Calculus With Priorities. LICS (2019)
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Revisiting Local Time Semantics for Networks of Timed Automata. CONCUR (2019)
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Revisiting local time semantics for networks of timed automata. CoRR (2019)
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Soundness in negotiations. Log. Methods Comput. Sci. 14 (1) (2018)
Anca Muscholl, Helmut Seidl, Igor Walukiewicz
Reachability for Dynamic Parametric Processes. VMCAI (2017)
Javier Esparza, Anca Muscholl, Igor Walukiewicz
Static Analysis of Deterministic Negotiations. CoRR (2017)
Igor Walukiewicz
Verifying Parametric Thread Creation. SOFSEM (2017)
Javier Esparza, Anca Muscholl, Igor Walukiewicz
Static analysis of deterministic negotiations. LICS (2017)
David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz
Preface. Fundam. Informaticae 150 (3-4) (2017)
Marie Fortin, Anca Muscholl, Igor Walukiewicz
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. CAV (2) (2017)
Sylvain Salvati, Igor Walukiewicz
Typing weak MSOL properties. Log. Methods Comput. Sci. 13 (1) (2017)
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Soundness in negotiations. CoRR (2017)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR (2016)
Naoki Kobayashi, Luke Ong, Igor Walukiewicz
Higher-Order Model Checking (NII Shonan Meeting 2016-4). NII Shonan Meet. Rep. 2016 (2016)
Michal Skrzypczak, Igor Walukiewicz
Deciding the Topological Complexity of Büchi Languages. ICALP (2016)
Anca Muscholl, Helmut Seidl, Igor Walukiewicz
Reachability for dynamic parametric processes. CoRR (2016)
Sylvain Salvati, Igor Walukiewicz
Simply typed fixpoint calculus and collapsible pushdown automata. Math. Struct. Comput. Sci. 26 (7) (2016)
Igor Walukiewicz
Automata theory and higher-order model-checking. ACM SIGLOG News 3 (4) (2016)
Marie Fortin, Anca Muscholl, Igor Walukiewicz
On parametrized verification of asynchronous, shared-memory pushdown systems. CoRR (2016)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS (2016)
Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. FSTTCS (2016)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Better abstractions for timed automata. Inf. Comput. 251 (2016)
Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
Soundness in Negotiations. CONCUR (2016)
Volker Diekert, Anca Muscholl, Igor Walukiewicz
A Note on Monitors and Büchi Automata. ICTAC (2015)
Sylvain Salvati, Igor Walukiewicz
Typing Weak MSOL Properties. FoSSaCS (2015)
Salvatore La Torre, Anca Muscholl, Igor Walukiewicz
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. CONCUR (2015)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
Ordered Tree-Pushdown Systems. FSTTCS (2015)
Sylvain Salvati, Igor Walukiewicz
Using models to model-check recursive schemes. Log. Methods Comput. Sci. 11 (2) (2015)
Sylvain Salvati, Igor Walukiewicz
A Model for Behavioural Properties of Higher-order Programs. CSL (2015)
Volker Diekert, Anca Muscholl, Igor Walukiewicz
A Note on Monitors and Büchi automata. CoRR (2015)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
Ordered Tree-Pushdown Systems. CoRR (2015)
Anca Muscholl, Igor Walukiewicz
Distributed synthesis for acyclic architectures. CoRR (2014)
Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
Fast detection of cycles in timed automata. CoRR (2014)
Sylvain Salvati, Igor Walukiewicz
Krivine machines and higher-order schemes. Inf. Comput. 239 (2014)
Anca Muscholl, Igor Walukiewicz
Distributed Synthesis for Acyclic Architectures. FSTTCS (2014)
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
Asynchronous Games over Tree Architectures. ICALP (2) (2013)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Lazy abstractions for timed automata CoRR (2013)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Lazy Abstractions for Timed Automata. CAV (2013)
Sylvain Salvati, Igor Walukiewicz
Using Models to Model-Check Recursive Schemes. TLCA (2013)
Sylvain Salvati, Igor Walukiewicz
Evaluation is MSOL-compatible. FSTTCS (2013)
B. Srivathsan, Igor Walukiewicz
An alternate proof of Statman's finite completeness theorem. Inf. Process. Lett. 112 (14-15) (2012)
Sylvain Salvati, Igor Walukiewicz
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. RP (2012)
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
Asynchronous Games over Tree Architectures CoRR (2012)
Pawel Parys, Igor Walukiewicz
Weak Alternating Timed Automata Log. Methods Comput. Sci. 8 (3) (2012)
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
Wreath Products of Forest Algebras, with Applications to Tree Logics Log. Methods Comput. Sci. 8 (3) (2012)
Igor Walukiewicz
Simple Models for Recursive Schemes. MFCS (2012)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Efficient emptiness check for timed Büchi automata. Formal Methods Syst. Des. 40 (2) (2012)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Better Abstractions for Timed Automata. LICS (2012)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Efficient Emptiness Check for Timed Büchi Automata (Extended version) CoRR (2011)
Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
Using non-convex approximations for efficient analysis of timed automata CoRR (2011)
Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
Using non-convex approximations for efficient analysis of timed automata. FSTTCS (2011)
Sylvain Salvati, Igor Walukiewicz
Krivine Machines and Higher-Order Schemes. ICALP (2) (2011)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Better abstractions for timed automata CoRR (2011)
Igor Walukiewicz
Synthesis: Words and Traces. ATVA (2010)
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
10252 Executive Summary - Game Semantics and Program Verification. Game Semantics and Program Verification (2010)
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP (2) (2010)
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
10252 Abstracts Collection - Game Semantics and Program Verification. Game Semantics and Program Verification (2010)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Efficient Emptiness Check for Timed Büchi Automata. CAV (2010)
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS (2009)
Pawel Parys, Igor Walukiewicz
Weak Alternating Timed Automata. ICALP (2) (2009)
Mikolaj Bojanczyk, Igor Walukiewicz
Forest algebras. Logic and Automata (2008)
Andrzej S. Murawski, Igor Walukiewicz
Third-order Idealized Algol with iteration is decidable. Theor. Comput. Sci. 390 (2-3) (2008)
Anca Muscholl, Igor Walukiewicz
A Lower Bound on Web Services Composition. Log. Methods Comput. Sci. 4 (2) (2008)
Igor Walukiewicz
Finding Your Way in a Forest: On Different Types of Trees and Their Properties. FoSSaCS (2008)
André Arnold, Igor Walukiewicz
Nondeterministic controllers of nondeterministic processes. Logic and Automata (2008)
Slawomir Lasota, Igor Walukiewicz
Alternating timed automata. ACM Trans. Comput. Log. 9 (2) (2008)
Anca Muscholl, Igor Walukiewicz
A lower bound on web services composition CoRR (2008)
Anca Muscholl, Igor Walukiewicz
A Lower Bound on Web Services Composition. FoSSaCS (2007)
Thierry Cachat, Igor Walukiewicz
The Complexity of Games on Higher Order Pushdown Automata CoRR (2007)
Patrick Chervet, Igor Walukiewicz
Minimizing Variants of Visibly Pushdown Automata. MFCS (2007)
Mikolaj Bojanczyk, Igor Walukiewicz
Characterizing EF and EX tree logics. Theor. Comput. Sci. 358 (2-3) (2006)
Erich Grädel, Igor Walukiewicz
Positional Determinacy of Games with Infinitely Many Priorities CoRR (2006)
Erich Grädel, Igor Walukiewicz
Positional Determinacy of Games with Infinitely Many Priorities. Log. Methods Comput. Sci. 2 (4) (2006)
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
Unsafe Grammars and Panic Automata. ICALP (2005)
Andrzej S. Murawski, Igor Walukiewicz
Third-Order Idealized Algol with Iteration Is Decidable. FoSSaCS (2005)
Slawomir Lasota, Igor Walukiewicz
Alternating Timed Automata. FoSSaCS (2005)
Igor Walukiewicz
Preface. RAIRO Theor. Informatics Appl. 39 (3) (2005)
Slawomir Lasota, Igor Walukiewicz
Alternating Timed Automata CoRR (2005)
Igor Walukiewicz
. Formal Methods Syst. Des. 26 (1) (2005)
Anca Muscholl, Igor Walukiewicz
An NP-complete fragment of LTL. Int. J. Found. Comput. Sci. 16 (4) (2005)
Igor Walukiewicz
From Logic to Games. FSTTCS (2005)
Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz
Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP (2005)
Damian Niwinski, Igor Walukiewicz
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electron. Notes Theor. Comput. Sci. 123 (2005)

Igor Walukiewicz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Igor Walukiewicz