Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarIgor Walukiewicz
Refine list
refinements active!
zoomed in on ?? of ?? records
showing all ?? records
2010 – today
- 2017
[j36]Sylvain Salvati, Igor Walukiewicz:
Typing weak MSOL properties. Logical Methods in Computer Science 13(1) (2017)- [i21]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. CoRR abs/1703.05137 (2017) - [i20]Javier Esparza, Anca Muscholl, Igor Walukiewicz:
Static Analysis of Deterministic Negotiations. CoRR abs/1704.04190 (2017) - [j35]David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz:
Preface. Fundam. Inform. 150(3-4): i-ii (2017) - [c59]
- [c58]Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441 - 2016
- [i19]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR abs/1605.00371 (2016) - [i18]Marie Fortin, Anca Muscholl, Igor Walukiewicz:
On parametrized verification of asynchronous, shared-memory pushdown systems. CoRR abs/1606.08707 (2016) - [i17]Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for dynamic parametric processes. CoRR abs/1609.05385 (2016) - [j34]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. Inf. Comput. 251: 67-90 (2016) - [j33]Sylvain Salvati, Igor Walukiewicz:
Simply typed fixpoint calculus and collapsible pushdown automata. Mathematical Structures in Computer Science 26(7): 1304-1350 (2016) - [j32]
- [c57]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in Negotiations. CONCUR 2016: 12:1-12:13 - [c56]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: 48:1-48:14 - [c55]Michal Skrzypczak, Igor Walukiewicz:
Deciding the Topological Complexity of Büchi Languages. ICALP 2016: 99:1-99:13 - [c54]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS 2016: 96-105 - 2015
- [j31]Sylvain Salvati, Igor Walukiewicz:
Using models to model-check recursive schemes. Logical Methods in Computer Science 11(2) (2015) - [i16]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi automata. CoRR abs/1507.01020 (2015) - [i15]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. CoRR abs/1510.03278 (2015) - [c53]Salvatore La Torre, Anca Muscholl, Igor Walukiewicz:
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. CONCUR 2015: 72-84 - [c52]Sylvain Salvati, Igor Walukiewicz:
A Model for Behavioural Properties of Higher-order Programs. CSL 2015: 229-243 - [c51]
- [c50]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. FSTTCS 2015: 163-177 - [c49]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi Automata. ICTAC 2015: 39-57 - [e5]Adrian Kosowski, Igor Walukiewicz:
Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. Lecture Notes in Computer Science 9210, Springer 2015, ISBN 978-3-319-22176-2 [contents] - 2014
- [i14]Anca Muscholl, Igor Walukiewicz:
Distributed synthesis for acyclic architectures. CoRR abs/1402.3314 (2014) - [i13]Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz:
Fast detection of cycles in timed automata. CoRR abs/1410.4509 (2014) - [j30]Sylvain Salvati, Igor Walukiewicz:
Krivine machines and higher-order schemes. Inf. Comput. 239: 340-355 (2014) - [c48]Anca Muscholl, Igor Walukiewicz:
Distributed Synthesis for Acyclic Architectures. FSTTCS 2014: 639-651 - 2013
- [i12]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Lazy abstractions for timed automata. CoRR abs/1301.3127 (2013) - [c47]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Lazy Abstractions for Timed Automata. CAV 2013: 990-1005 - [c46]
- [c45]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. ICALP (2) 2013: 275-286 - [c44]Sylvain Salvati, Igor Walukiewicz:
Using Models to Model-Check Recursive Schemes. TLCA 2013: 189-204 - 2012
- [j29]Pawel Parys, Igor Walukiewicz:
Weak Alternating Timed Automata. Logical Methods in Computer Science 8(3) (2012) - [j28]Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz:
Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science 8(3) (2012) - [i11]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. CoRR abs/1204.0077 (2012) - [j27]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient emptiness check for timed Büchi automata. Formal Methods in System Design 40(2): 122-146 (2012) - [j26]B. Srivathsan, Igor Walukiewicz:
An alternate proof of Statman's finite completeness theorem. Inf. Process. Lett. 112(14-15): 612-616 (2012) - [c43]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better Abstractions for Timed Automata. LICS 2012: 375-384 - [c42]
- [c41]Sylvain Salvati, Igor Walukiewicz:
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. RP 2012: 6-20 - 2011
- [i10]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient Emptiness Check for Timed Büchi Automata (Extended version). CoRR abs/1104.1540 (2011) - [i9]Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz:
Using non-convex approximations for efficient analysis of timed automata. CoRR abs/1110.3704 (2011) - [i8]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. CoRR abs/1110.3705 (2011) - [c40]Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz:
Using non-convex approximations for efficient analysis of timed automata. FSTTCS 2011: 78-89 - [c39]Sylvain Salvati, Igor Walukiewicz:
Krivine Machines and Higher-Order Schemes. ICALP (2) 2011: 162-173 - 2010
- [c38]
- [c37]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient Emptiness Check for Timed Büchi Automata. CAV 2010: 148-161 - [c36]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP (2) 2010: 52-63 - [e4]Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz:
Game Semantics and Program Verification, 20.06. - 25.06.2010. Dagstuhl Seminar Proceedings 10252, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i7]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 - [i6]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
2000 – 2009
- 2009
- [c35]
- [c34]Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz:
Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS 2009: 255-263 - 2008
- [i5]Anca Muscholl, Igor Walukiewicz:
A lower bound on web services composition. CoRR abs/0804.3105 (2008) - [j25]Anca Muscholl, Igor Walukiewicz:
A Lower Bound on Web Services Composition. Logical Methods in Computer Science 4(2) (2008) - [j24]Andrzej S. Murawski, Igor Walukiewicz:
Third-order Idealized Algol with iteration is decidable. Theor. Comput. Sci. 390(2-3): 214-229 (2008) - [j23]Slawomir Lasota, Igor Walukiewicz:
Alternating timed automata. ACM Trans. Comput. Log. 9(2): 10:1-10:27 (2008) - [c33]André Arnold, Igor Walukiewicz:
Nondeterministic controllers of nondeterministic processes. Logic and Automata 2008: 29-52 - [c32]
- [c31]Igor Walukiewicz:
Finding Your Way in a Forest: On Different Types of Trees and Their Properties. FoSSaCS 2008: 1-4 - [e3]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz:
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. Lecture Notes in Computer Science 5125, Springer 2008, ISBN 978-3-540-70574-1 [contents] - [e2]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz:
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. Lecture Notes in Computer Science 5126, Springer 2008, ISBN 978-3-540-70582-6 [contents] - 2007
- [i4]Thierry Cachat, Igor Walukiewicz:
The Complexity of Games on Higher Order Pushdown Automata. CoRR abs/0705.0262 (2007) - [c30]
- [c29]Patrick Chervet, Igor Walukiewicz:
Minimizing Variants of Visibly Pushdown Automata. MFCS 2007: 135-146 - 2006
- [i3]Erich Grädel, Igor Walukiewicz:
Postinal Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610034 (2006) - [i2]Erich Grädel, Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610035 (2006) - [j22]Erich Grädel, Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities. Logical Methods in Computer Science 2(4) (2006) - [j21]Mikolaj Bojanczyk, Igor Walukiewicz:
Characterizing EF and EX tree logics. Theor. Comput. Sci. 358(2-3): 255-272 (2006) - 2005
- [i1]
- [j20]Damian Niwinski, Igor Walukiewicz:
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electr. Notes Theor. Comput. Sci. 123: 195-208 (2005) - [j19]Igor Walukiewicz:
Difficult Configurations-On the Complexity of LTrL. Formal Methods in System Design 26(1): 27-43 (2005) - [j18]Anca Muscholl, Igor Walukiewicz:
An NP-complete fragment of LTL. Int. J. Found. Comput. Sci. 16(4): 743-753 (2005) - [j17]
- [c28]Andrzej S. Murawski, Igor Walukiewicz:
Third-Order Idealized Algol with Iteration Is Decidable. FoSSaCS 2005: 202-218 - [c27]
- [c26]
- [c25]Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz:
Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929 - [c24]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz:
Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461 - 2004
- [j16]
- [c23]
- [c22]Anca Muscholl, Igor Walukiewicz:
An NP-Complete Fragment of LTL. Developments in Language Theory 2004: 334-344 - [c21]
- [c20]
- [e1]Igor Walukiewicz:
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. Lecture Notes in Computer Science 2987, Springer 2004, ISBN 3-540-21298-1 [contents] - 2003
- [j15]André Arnold, Aymeric Vincent, Igor Walukiewicz:
Games for synthesis of controllers with partial observation. Theor. Comput. Sci. 1(303): 7-34 (2003) - [j14]Damian Niwinski, Igor Walukiewicz:
A gap property of deterministic tree languages. Theor. Comput. Sci. 1(303): 215-231 (2003) - [c19]
- [c18]Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz:
Pushdown Games with Unboundedness and Regular Conditions. FSTTCS 2003: 88-99 - [c17]
- 2002
- [j13]Igor Walukiewicz:
Deciding low levels of tree-automata hierarchy. Electr. Notes Theor. Comput. Sci. 67: 61-75 (2002) - [j12]Igor Walukiewicz:
Describing properties of concurrent systems (Logic for Traces) (invited talk). Electr. Notes Theor. Comput. Sci. 68(2): 69 (2002) - [j11]P. S. Thiagarajan, Igor Walukiewicz:
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. Inf. Comput. 179(2): 230-249 (2002) - [j10]Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz:
Complexity of weak acceptance conditions in tree automata. Inf. Process. Lett. 84(4): 181-187 (2002) - [j9]Julien Bernet, David Janin, Igor Walukiewicz:
Permissive strategies: from parity games to safety games. ITA 36(3): 261-275 (2002) - [j8]Igor Walukiewicz:
Local Logics for Traces. Journal of Automata, Languages and Combinatorics 7(2): 259-290 (2002) - [j7]Igor Walukiewicz:
Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275(1-2): 311-346 (2002) - [c16]
- 2001
- [j6]
- 2000
- [j5]Igor Walukiewicz:
Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus. Inf. Comput. 157(1-2): 142-182 (2000) - [c15]
1990 – 1999
- 1999
- [c14]
- 1998
- [j4]Bruno Courcelle, Igor Walukiewicz:
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Ann. Pure Appl. Logic 92(1): 35-62 (1998) - [c13]
- [c12]Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz:
The Horn Mu-calculus. LICS 1998: 58-69 - [c11]Damian Niwinski, Igor Walukiewicz:
Relating Hierarchies of Word and Tree Automata. STACS 1998: 320-331 - 1997
- [c10]Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz:
How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110 - [c9]P. S. Thiagarajan, Igor Walukiewicz:
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. LICS 1997: 183-194 - 1996
- [j3]Igor Walukiewicz:
A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus. Bulletin of Symbolic Logic 2(3): 349-366 (1996) - [j2]Damian Niwinski, Igor Walukiewicz:
Games for the mu-Calculus. Theor. Comput. Sci. 163(1&2): 99-116 (1996) - [c8]
- [c7]David Janin, Igor Walukiewicz:
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. CONCUR 1996: 263-277 - [c6]
- 1995
- [c5]Igor Walukiewicz:
Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus. LICS 1995: 14-24 - [c4]David Janin, Igor Walukiewicz:
Automata for the Modal mu-Calculus and related Results. MFCS 1995: 552-562 - 1993
- [j1]
- [c3]
- 1990
- [c2]
- [c1]
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-06-15 01:39 CEST by the dblp team