default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Walukiewicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j37]Marco Gaboardi
, Igor Walukiewicz:
Report on Logic in Computer Science (LICS'23). ACM SIGLOG News 10(4): 44-45 (2023)- [c75]Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz:
CONCUR Test-Of-Time Award 2023 (Invited Paper). CONCUR 2023: 1:1-1:2 - [c74]Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. CONCUR 2023: 24:1-24:17 - [i27]Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Model-checking parametric lock-sharing systems against regular constraints. CoRR abs/2307.04925 (2023) - 2022
- [j36]W. Alejandro Apaza-Perez, Christophe Combastel, Igor Walukiewicz, Anca Muscholl, Ali Zolghadri:
Abstraction-based control synthesis using partial information. Eur. J. Control 63: 214-222 (2022) - [c73]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. CONCUR 2022: 12:1-12:24 - [c72]Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Distributed Controller Synthesis for Deadlock Avoidance. ICALP 2022: 125:1-125:20 - [c71]Anca Muscholl, Igor Walukiewicz:
Active learning for sound negotiations✱. LICS 2022: 21:1-21:12 - [c70]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: 24:1-24:14 - [i26]Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Distributed controller synthesis for deadlock avoidance. CoRR abs/2204.12409 (2022) - 2021
- [c69]Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Leafy automata for higher-order concurrency. FoSSaCS 2021: 184-204 - [c68]Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Verifying higher-order concurrency with data automata. LICS 2021: 1-13 - [p2]Igor Walukiewicz:
Synthesis with finite automata. Handbook of Automata Theory (II.) 2021: 1217-1260 - [i25]Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Leafy Automata for Higher-Order Concurrency. CoRR abs/2101.08720 (2021) - [i24]Anca Muscholl, Igor Walukiewicz:
Active Learning for Sound Negotiations. CoRR abs/2110.02783 (2021) - 2020
- [j35]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): 17:1-17:28 (2020) - [c67]A. R. Balasubramanian, Igor Walukiewicz:
Characterizing Consensus in the Heard-Of Model. CONCUR 2020: 9:1-9:18 - [i23]A. R. Balasubramanian, Igor Walukiewicz:
Characterizing consensus in the Heard-Of model. CoRR abs/2004.09621 (2020)
2010 – 2019
- 2019
- [c66]R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Revisiting Local Time Semantics for Networks of Timed Automata. CONCUR 2019: 16:1-16:15 - [c65]Igor Walukiewicz:
Lambda Y-Calculus With Priorities. LICS 2019: 1-13 - [i22]R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Revisiting local time semantics for networks of timed automata. CoRR abs/1907.02296 (2019) - 2018
- [j34]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. Log. Methods Comput. Sci. 14(1) (2018) - [p1]Julian C. Bradfield, Igor Walukiewicz:
The mu-calculus and Model Checking. Handbook of Model Checking 2018: 871-919 - 2017
- [j33]Sylvain Salvati, Igor Walukiewicz:
Typing weak MSOL properties. Log. Methods Comput. Sci. 13(1) (2017) - [j32]David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz:
Preface. Fundam. Informaticae 150(3-4): i-ii (2017) - [c64]Marie Fortin, Anca Muscholl, Igor Walukiewicz:
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. CAV (2) 2017: 155-175 - [c63]Javier Esparza, Anca Muscholl, Igor Walukiewicz:
Static analysis of deterministic negotiations. LICS 2017: 1-12 - [c62]Igor Walukiewicz:
Verifying Parametric Thread Creation. SOFSEM 2017: 11-14 - [c61]Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441 - [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) - 2016
- [j31]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. Inf. Comput. 251: 67-90 (2016) - [j30]Sylvain Salvati, Igor Walukiewicz:
Simply typed fixpoint calculus and collapsible pushdown automata. Math. Struct. Comput. Sci. 26(7): 1304-1350 (2016) - [j29]Igor Walukiewicz:
Automata theory and higher-order model-checking. ACM SIGLOG News 3(4): 13-31 (2016) - [c60]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in Negotiations. CONCUR 2016: 12:1-12:13 - [c59]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 - [c58]Michal Skrzypczak, Igor Walukiewicz:
Deciding the Topological Complexity of Büchi Languages. ICALP 2016: 99:1-99:13 - [c57]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS 2016: 96-105 - [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) - [i16]Naoki Kobayashi, Luke Ong, Igor Walukiewicz:
Higher-Order Model Checking (NII Shonan Meeting 2016-4). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j28]Sylvain Salvati, Igor Walukiewicz:
Using models to model-check recursive schemes. Log. Methods Comput. Sci. 11(2) (2015) - [c56]Salvatore La Torre, Anca Muscholl, Igor Walukiewicz:
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. CONCUR 2015: 72-84 - [c55]Sylvain Salvati, Igor Walukiewicz:
A Model for Behavioural Properties of Higher-order Programs. CSL 2015: 229-243 - [c54]Sylvain Salvati, Igor Walukiewicz:
Typing Weak MSOL Properties. FoSSaCS 2015: 343-357 - [c53]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. FSTTCS 2015: 163-177 - [c52]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi Automata. ICTAC 2015: 39-57 - [e6]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] - [i15]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi automata. CoRR abs/1507.01020 (2015) - [i14]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. CoRR abs/1510.03278 (2015) - 2014
- [j27]Sylvain Salvati, Igor Walukiewicz:
Krivine machines and higher-order schemes. Inf. Comput. 239: 340-355 (2014) - [c51]Anca Muscholl, Igor Walukiewicz:
Distributed Synthesis for Acyclic Architectures. FSTTCS 2014: 639-651 - [i13]Anca Muscholl, Igor Walukiewicz:
Distributed synthesis for acyclic architectures. CoRR abs/1402.3314 (2014) - [i12]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) - 2013
- [c50]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Lazy Abstractions for Timed Automata. CAV 2013: 990-1005 - [c49]Sylvain Salvati, Igor Walukiewicz:
Evaluation is MSOL-compatible. FSTTCS 2013: 103-114 - [c48]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. ICALP (2) 2013: 275-286 - [c47]Sylvain Salvati, Igor Walukiewicz:
Using Models to Model-Check Recursive Schemes. TLCA 2013: 189-204 - [i11]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Lazy abstractions for timed automata. CoRR abs/1301.3127 (2013) - 2012
- [j26]Pawel Parys, Igor Walukiewicz:
Weak Alternating Timed Automata. Log. Methods Comput. Sci. 8(3) (2012) - [j25]Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz:
Wreath Products of Forest Algebras, with Applications to Tree Logics. Log. Methods Comput. Sci. 8(3) (2012) - [j24]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient emptiness check for timed Büchi automata. Formal Methods Syst. Des. 40(2): 122-146 (2012) - [j23]B. Srivathsan, Igor Walukiewicz:
An alternate proof of Statman's finite completeness theorem. Inf. Process. Lett. 112(14-15): 612-616 (2012) - [c46]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better Abstractions for Timed Automata. LICS 2012: 375-384 - [c45]Igor Walukiewicz:
Simple Models for Recursive Schemes. MFCS 2012: 49-60 - [c44]Sylvain Salvati, Igor Walukiewicz:
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. RP 2012: 6-20 - [i10]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. CoRR abs/1204.0077 (2012) - 2011
- [c43]Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz:
Using non-convex approximations for efficient analysis of timed automata. FSTTCS 2011: 78-89 - [c42]Sylvain Salvati, Igor Walukiewicz:
Krivine Machines and Higher-Order Schemes. ICALP (2) 2011: 162-173 - [i9]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient Emptiness Check for Timed Büchi Automata (Extended version). CoRR abs/1104.1540 (2011) - [i8]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) - [i7]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. CoRR abs/1110.3705 (2011) - 2010
- [c41]Igor Walukiewicz:
Synthesis: Words and Traces. ATVA 2010: 18-21 - [c40]Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient Emptiness Check for Timed Büchi Automata. CAV 2010: 148-161 - [c39]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP (2) 2010: 52-63 - [e5]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] - [i6]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 - [i5]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
- [c38]Pawel Parys, Igor Walukiewicz:
Weak Alternating Timed Automata. ICALP (2) 2009: 273-284 - [c37]Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz:
Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS 2009: 255-263 - 2008
- [j22]Anca Muscholl, Igor Walukiewicz:
A Lower Bound on Web Services Composition. Log. Methods Comput. Sci. 4(2) (2008) - [j21]Andrzej S. Murawski, Igor Walukiewicz:
Third-order Idealized Algol with iteration is decidable. Theor. Comput. Sci. 390(2-3): 214-229 (2008) - [j20]Slawomir Lasota, Igor Walukiewicz:
Alternating timed automata. ACM Trans. Comput. Log. 9(2): 10:1-10:27 (2008) - [c36]André Arnold, Igor Walukiewicz:
Nondeterministic controllers of nondeterministic processes. Logic and Automata 2008: 29-52 - [c35]Mikolaj Bojanczyk, Igor Walukiewicz:
Forest algebras. Logic and Automata 2008: 107-132 - [c34]Igor Walukiewicz:
Finding Your Way in a Forest: On Different Types of Trees and Their Properties. FoSSaCS 2008: 1-4 - [e4]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] - [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 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] - [i4]Anca Muscholl, Igor Walukiewicz:
A lower bound on web services composition. CoRR abs/0804.3105 (2008) - 2007
- [c33]Anca Muscholl, Igor Walukiewicz:
A Lower Bound on Web Services Composition. FoSSaCS 2007: 274-286 - [c32]Patrick Chervet, Igor Walukiewicz:
Minimizing Variants of Visibly Pushdown Automata. MFCS 2007: 135-146 - [i3]Thierry Cachat, Igor Walukiewicz:
The Complexity of Games on Higher Order Pushdown Automata. CoRR abs/0705.0262 (2007) - 2006
- [j19]Erich Grädel, Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities. Log. Methods Comput. Sci. 2(4) (2006) - [j18]Mikolaj Bojanczyk, Igor Walukiewicz:
Characterizing EF and EX tree logics. Theor. Comput. Sci. 358(2-3): 255-272 (2006) - [i2]Erich Grädel, Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610035 (2006) - 2005
- [j17]Igor Walukiewicz:
Difficult Configurations-On the Complexity of LTrL. Formal Methods Syst. Des. 26(1): 27-43 (2005) - [j16]Anca Muscholl, Igor Walukiewicz:
An NP-complete fragment of LTL. Int. J. Found. Comput. Sci. 16(4): 743-753 (2005) - [j15]Igor Walukiewicz:
Preface. RAIRO Theor. Informatics Appl. 39(3): 421-422 (2005) - [c31]Andrzej S. Murawski, Igor Walukiewicz:
Third-Order Idealized Algol with Iteration Is Decidable. FoSSaCS 2005: 202-218 - [c30]Slawomir Lasota, Igor Walukiewicz:
Alternating Timed Automata. FoSSaCS 2005: 250-265 - [c29]Igor Walukiewicz:
From Logic to Games. FSTTCS 2005: 79-91 - [c28]Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz:
Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929 - [c27]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz:
Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461 - [i1]Slawomir Lasota, Igor Walukiewicz:
Alternating Timed Automata. CoRR abs/cs/0512031 (2005) - 2004
- [j14]Zoltán Ésik, Igor Walukiewicz:
Foreword. RAIRO Theor. Informatics Appl. 38(4): 275-276 (2004) - [c26]Mikolaj Bojanczyk, Igor Walukiewicz:
Characterizing EF and EX Tree Logics. CONCUR 2004: 131-145 - [c25]Anca Muscholl, Igor Walukiewicz:
An NP-Complete Fragment of LTL. Developments in Language Theory 2004: 334-344 - [c24]Igor Walukiewicz:
A Landscape with Games in the Backgroun. LICS 2004: 356-366 - [c23]Igor Walukiewicz:
How to Fix It: Using Fixpoints in Different Contexts. LPAR 2004: 184-193 - [c22]Damian Niwinski, Igor Walukiewicz:
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. WoLLIC 2004: 195-208 - [e2]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
- [j13]André Arnold, Aymeric Vincent, Igor Walukiewicz:
Games for synthesis of controllers with partial observation. Theor. Comput. Sci. 303(1): 7-34 (2003) - [j12]Damian Niwinski, Igor Walukiewicz:
A gap property of deterministic tree languages. Theor. Comput. Sci. 303(1): 215-231 (2003) - [c21]Igor Walukiewicz:
Winning Strategies and Synthesis of Controllers (Tutorial). CSL 2003: 574 - [c20]Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz:
Pushdown Games with Unboundedness and Regular Conditions. FSTTCS 2003: 88-99 - [c19]Swarup Mohalik, Igor Walukiewicz:
Distributed Games. FSTTCS 2003: 338-351 - [e1]Zoltán Ésik, Igor Walukiewicz:
FICS '03 - Fixed Points in Computer Science, Proceedings of an International Workshop, Warsaw, Poland, April 12-13, 2003. University of Warsaw 2003 [contents] - 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. RAIRO Theor. Informatics Appl. 36(3): 261-275 (2002) - [j8]Igor Walukiewicz:
Local Logics for Traces. J. Autom. Lang. Comb. 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) - [c18]Igor Walukiewicz:
Automata and Games for Synthesis. AMAST 2002: 15-20 - [c17]Igor Walukiewicz:
Deciding low levels of tree-automata hierarchy. WoLLIC 2002: 61-75 - [c16]Igor Walukiewicz:
Describing properties of concurrent systems (Logic for Traces) (invited talk). EXPRESS 2002: 69 - 2001
- [j6]Igor Walukiewicz:
Pushdown Processes: Games and Model-Checking. Inf. Comput. 164(2): 234-263 (2001) - 2000
- [j5]Igor Walukiewicz:
Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus. Inf. Comput. 157(1-2): 142-182 (2000) - [c15]Igor Walukiewicz:
Model Checking CTL Properties of Pushdown Systems. FSTTCS 2000: 127-138
1990 – 1999
- 1999
- [c14]Erich Grädel, Igor Walukiewicz:
Guarded Fixed Point Logic. LICS 1999: 45-54 - 1998
- [j4]Bruno Courcelle, Igor Walukiewicz:
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Ann. Pure Appl. Log. 92(1): 35-62 (1998) - [c13]Igor Walukiewicz:
Difficult Configurations - On the Complexity of LTrL. ICALP 1998: 140-151 - [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. Bull. Symb. Log. 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]Igor Walukiewicz:
Pushdown Processes: Games and Model Checking. CAV 1996: 62-74 - [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]Igor Walukiewicz:
Monadic Second Order Logic on Tree-Like Structures. STACS 1996: 401-413 - 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]Igor Walukiewicz:
Gentzen-Type Axiomatization for PAL. Theor. Comput. Sci. 118(1): 67-79 (1993) - [c3]Igor Walukiewicz:
On Completeness of the mu-calculus. LICS 1993: 136-146 - 1990
- [c2]Igor Walukiewicz:
Decision Procedure for Checking Validity of PAL Formulas. IMYCS 1990: 288-298 - [c1]Igor Walukiewicz:
Gentzen Type Axiomatizations for PAL. MFCS 1990: 499-507
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
