 | 2009 |
|---|
| 63 |       | Pawel Parys,
Igor Walukiewicz:
Weak Alternating Timed Automata.
ICALP (2) 2009: 273-284 |
| 2008 |
|---|
| 62 |  | 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
Springer 2008 |
| 61 | | 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
Springer 2008 |
| 60 | | Igor Walukiewicz:
Finding Your Way in a Forest: On Different Types of Trees and Their Properties.
FoSSaCS 2008: 1-4 |
| 59 | | Slawomir Lasota,
Igor Walukiewicz:
Alternating timed automata.
ACM Trans. Comput. Log. 9(2): (2008) |
| 58 | | Anca Muscholl,
Igor Walukiewicz:
A lower bound on web services composition
CoRR abs/0804.3105: (2008) |
| 57 | | Anca Muscholl,
Igor Walukiewicz:
A Lower Bound on Web Services Composition.
Logical Methods in Computer Science 4(2): (2008) |
| 56 | | Andrzej S. Murawski,
Igor Walukiewicz:
Third-order Idealized Algol with iteration is decidable.
Theor. Comput. Sci. 390(2-3): 214-229 (2008) |
| 2007 |
|---|
| 55 | | Anca Muscholl,
Igor Walukiewicz:
A Lower Bound on Web Services Composition.
FoSSaCS 2007: 274-286 |
| 54 | | Patrick Chervet,
Igor Walukiewicz:
Minimizing Variants of Visibly Pushdown Automata.
MFCS 2007: 135-146 |
| 53 | | Thierry Cachat,
Igor Walukiewicz:
The Complexity of Games on Higher Order Pushdown Automata
CoRR abs/0705.0262: (2007) |
| 2006 |
|---|
| 52 | | Erich Grädel,
Igor Walukiewicz:
Postinal Determinacy of Games with Infinitely Many Priorities
CoRR abs/cs/0610034: (2006) |
| 51 | | Erich Grädel,
Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities
CoRR abs/cs/0610035: (2006) |
| 50 | | Erich Grädel,
Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities.
Logical Methods in Computer Science 2(4): (2006) |
| 49 | | Mikolaj Bojanczyk,
Igor Walukiewicz:
Characterizing EF and EX tree logics.
Theor. Comput. Sci. 358(2-3): 255-272 (2006) |
| 2005 |
|---|
| 48 | | Igor Walukiewicz:
From Logic to Games.
FSTTCS 2005: 79-91 |
| 47 | | Andrzej S. Murawski,
Igor Walukiewicz:
Third-Order Idealized Algol with Iteration Is Decidable.
FoSSaCS 2005: 202-218 |
| 46 | | Slawomir Lasota,
Igor Walukiewicz:
Alternating Timed Automata.
FoSSaCS 2005: 250-265 |
| 45 | | Teodor Knapik,
Damian Niwinski,
Pawel Urzyczyn,
Igor Walukiewicz:
Unsafe Grammars and Panic Automata.
ICALP 2005: 1450-1461 |
| 44 | | Andrzej S. Murawski,
C.-H. Luke Ong,
Igor Walukiewicz:
Idealized Algol with Ground Recursion, and DPDA Equivalence.
ICALP 2005: 917-929 |
| 43 | | Slawomir Lasota,
Igor Walukiewicz:
Alternating Timed Automata
CoRR abs/cs/0512031: (2005) |
| 42 | | Damian Niwinski,
Igor Walukiewicz:
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata.
Electr. Notes Theor. Comput. Sci. 123: 195-208 (2005) |
| 41 | | Igor Walukiewicz:
Difficult Configurations-On the Complexity of LTrL.
Formal Methods in System Design 26(1): 27-43 (2005) |
| 40 | | Anca Muscholl,
Igor Walukiewicz:
An NP-complete fragment of LTL.
Int. J. Found. Comput. Sci. 16(4): 743-753 (2005) |
| 2004 |
|---|
| 39 | | 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
Springer 2004 |
| 38 | | Mikolaj Bojanczyk,
Igor Walukiewicz:
Characterizing EF and EX Tree Logics.
CONCUR 2004: 131-145 |
| 37 | | Anca Muscholl,
Igor Walukiewicz:
An NP-Complete Fragment of LTL.
Developments in Language Theory 2004: 334-344 |
| 36 | | Igor Walukiewicz:
A Landscape with Games in the Backgroun.
LICS 2004: 356-366 |
| 35 | | Igor Walukiewicz:
How to Fix It: Using Fixpoints in Different Contexts.
LPAR 2004: 184-193 |
| 2003 |
|---|
| 34 | | Igor Walukiewicz:
Winning Strategies and Synthesis of Controllers (Tutorial).
CSL 2003: 574 |
| 33 | | Swarup Mohalik,
Igor Walukiewicz:
Distributed Games.
FSTTCS 2003: 338-351 |
| 32 | | Alexis-Julien Bouquet,
Olivier Serre,
Igor Walukiewicz:
Pushdown Games with Unboundedness and Regular Conditions.
FSTTCS 2003: 88-99 |
| 31 | | Damian Niwinski,
Igor Walukiewicz:
A gap property of deterministic tree languages.
Theor. Comput. Sci. 1(303): 215-231 (2003) |
| 30 | | André Arnold,
Aymeric Vincent,
Igor Walukiewicz:
Games for synthesis of controllers with partial observation.
Theor. Comput. Sci. 1(303): 7-34 (2003) |
| 2002 |
|---|
| 29 | | Igor Walukiewicz:
Automata and Games for Synthesis.
AMAST 2002: 15-20 |
| 28 | | Igor Walukiewicz:
Deciding low levels of tree-automata hierarchy.
Electr. Notes Theor. Comput. Sci. 67: (2002) |
| 27 | | Igor Walukiewicz:
Describing properties of concurrent systems (Logic for Traces) (invited talk).
Electr. Notes Theor. Comput. Sci. 68(2): (2002) |
| 26 | | Julien Bernet,
David Janin,
Igor Walukiewicz:
Permissive strategies: from parity games to safety games.
ITA 36(3): 261-275 (2002) |
| 25 | | P. S. Thiagarajan,
Igor Walukiewicz:
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
Inf. Comput. 179(2): 230-249 (2002) |
| 24 | | Jakub Neumann,
Andrzej Szepietowski,
Igor Walukiewicz:
Complexity of weak acceptance conditions in tree automata.
Inf. Process. Lett. 84(4): 181-187 (2002) |
| 23 | | Igor Walukiewicz:
Local Logics for Traces.
Journal of Automata, Languages and Combinatorics 7(2): 259-290 (2002) |
| 22 | | Igor Walukiewicz:
Monadic second-order logic on tree-like structures.
Theor. Comput. Sci. 275(1-2): 311-346 (2002) |
| 2001 |
|---|
| 21 | | Igor Walukiewicz:
Pushdown Processes: Games and Model-Checking.
Inf. Comput. 164(2): 234-263 (2001) |
| 2000 |
|---|
| 20 | | Igor Walukiewicz:
Model Checking CTL Properties of Pushdown Systems.
FSTTCS 2000: 127-138 |
| 19 | | Igor Walukiewicz:
Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus.
Inf. Comput. 157(1-2): 142-182 (2000) |
| 1999 |
|---|
| 18 | | Erich Grädel,
Igor Walukiewicz:
Guarded Fixed Point Logic.
LICS 1999: 45-54 |
| 1998 |
|---|
| 17 | | Igor Walukiewicz:
Difficult Configurations - On the Complexity of LTrL.
ICALP 1998: 140-151 |
| 16 | | Witold Charatonik,
David A. McAllester,
Damian Niwinski,
Andreas Podelski,
Igor Walukiewicz:
The Horn Mu-calculus.
LICS 1998: 58-69 |
| 15 | | Damian Niwinski,
Igor Walukiewicz:
Relating Hierarchies of Word and Tree Automata.
STACS 1998: 320-331 |
| 14 | | Bruno Courcelle,
Igor Walukiewicz:
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems.
Ann. Pure Appl. Logic 92(1): 35-62 (1998) |
| 1997 |
|---|
| 13 | | P. S. Thiagarajan,
Igor Walukiewicz:
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
LICS 1997: 183-194 |
| 12 | | Stefan Dziembowski,
Marcin Jurdzinski,
Igor Walukiewicz:
How Much Memory is Needed to Win Infinite Games?
LICS 1997: 99-110 |
| 1996 |
|---|
| 11 | | Igor Walukiewicz:
Pushdown Processes: Games and Model Checking.
CAV 1996: 62-74 |
| 10 | | David Janin,
Igor Walukiewicz:
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic.
CONCUR 1996: 263-277 |
| 9 | | Igor Walukiewicz:
Monadic Second Order Logic on Tree-Like Structures.
STACS 1996: 401-413 |
| 8 | | 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) |
| 7 | | Damian Niwinski,
Igor Walukiewicz:
Games for the mu-Calculus.
Theor. Comput. Sci. 163(1&2): 99-116 (1996) |
| 1995 |
|---|
| 6 | | Igor Walukiewicz:
Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus
LICS 1995: 14-24 |
| 5 | | David Janin,
Igor Walukiewicz:
Automata for the Modal mu-Calculus and related Results.
MFCS 1995: 552-562 |
| 1993 |
|---|
| 4 | | Igor Walukiewicz:
On Completeness of the mu-calculus
LICS 1993: 136-146 |
| 3 | | Igor Walukiewicz:
Gentzen-Type Axiomatization for PAL.
Theor. Comput. Sci. 118(1): 67-79 (1993) |
| 1990 |
|---|
| 2 | | Igor Walukiewicz:
Decision Procedure for Checking Validity of PAL Formulas.
IMYCS 1990: 288-298 |
| 1 | | Igor Walukiewicz:
Gentzen Type Axiomatizations for PAL.
MFCS 1990: 499-507 |
