Igor Walukiewicz

According to our database1, Igor Walukiewicz authored at least 120 papers between 1990 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
The mu-calculus and Model Checking.
Proceedings of the Handbook of Model Checking., 2018

Soundness in negotiations.
Logical Methods in Computer Science, 2018

2017
Preface.
Fundam. Inform., 2017

Typing weak MSOL properties.
Logical Methods in Computer Science, 2017

Static Analysis of Deterministic Negotiations.
CoRR, 2017

Soundness in negotiations.
CoRR, 2017

Reachability for Dynamic Parametric Processes.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Verifying Parametric Thread Creation.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Static analysis of deterministic negotiations.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Automata theory and higher-order model-checking.
SIGLOG News, 2016

Higher-Order Model Checking (NII Shonan Meeting 2016-4).
NII Shonan Meet. Rep., 2016

Simply typed fixpoint calculus and collapsible pushdown automata.
Mathematical Structures in Computer Science, 2016

Better abstractions for timed automata.
Inf. Comput., 2016

Reachability for dynamic parametric processes.
CoRR, 2016

On parametrized verification of asynchronous, shared-memory pushdown systems.
CoRR, 2016

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
CoRR, 2016

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Deciding the Topological Complexity of Büchi Languages.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Why Liveness for Timed Automata Is Hard, and What We Can Do About It.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Soundness in Negotiations.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Using models to model-check recursive schemes.
Logical Methods in Computer Science, 2015

A Note on Monitors and Büchi automata.
CoRR, 2015

Ordered Tree-Pushdown Systems.
CoRR, 2015

A Note on Monitors and Büchi Automata.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Ordered Tree-Pushdown Systems.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Typing Weak MSOL Properties.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

A Model for Behavioural Properties of Higher-order Programs.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Krivine machines and higher-order schemes.
Inf. Comput., 2014

Distributed synthesis for acyclic architectures.
CoRR, 2014

Fast detection of cycles in timed automata.
CoRR, 2014

Distributed Synthesis for Acyclic Architectures.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Lazy abstractions for timed automata
CoRR, 2013

Using Models to Model-Check Recursive Schemes.
Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

Asynchronous Games over Tree Architectures.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Evaluation is MSOL-compatible.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Lazy Abstractions for Timed Automata.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
An alternate proof of Statman's finite completeness theorem.
Inf. Process. Lett., 2012

Efficient emptiness check for timed Büchi automata.
Formal Methods in System Design, 2012

Wreath Products of Forest Algebras, with Applications to Tree Logics
Logical Methods in Computer Science, 2012

Weak Alternating Timed Automata
Logical Methods in Computer Science, 2012

Asynchronous Games over Tree Architectures
CoRR, 2012

Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

Simple Models for Recursive Schemes.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Better Abstractions for Timed Automata.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
Better abstractions for timed automata
CoRR, 2011

Using non-convex approximations for efficient analysis of timed automata
CoRR, 2011

Efficient Emptiness Check for Timed Büchi Automata (Extended version)
CoRR, 2011

Krivine Machines and Higher-Order Schemes.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Using non-convex approximations for efficient analysis of timed automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

10252 Executive Summary - Game Semantics and Program Verification.
Proceedings of the Game Semantics and Program Verification, 20.06. - 25.06.2010, 2010

10252 Abstracts Collection - Game Semantics and Program Verification.
Proceedings of the Game Semantics and Program Verification, 20.06. - 25.06.2010, 2010

Efficient Emptiness Check for Timed Büchi Automata.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Synthesis: Words and Traces.
Proceedings of the Automated Technology for Verification and Analysis, 2010

2009
Wreath Products of Forest Algebras, with Applications to Tree Logics.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Weak Alternating Timed Automata.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Alternating timed automata.
ACM Trans. Comput. Log., 2008

Third-order Idealized Algol with iteration is decidable.
Theor. Comput. Sci., 2008

A Lower Bound on Web Services Composition.
Logical Methods in Computer Science, 2008

A lower bound on web services composition
CoRR, 2008

Finding Your Way in a Forest: On Different Types of Trees and Their Properties.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Forest algebras.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

Nondeterministic controllers of nondeterministic processes.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
The Complexity of Games on Higher Order Pushdown Automata
CoRR, 2007

Minimizing Variants of Visibly Pushdown Automata.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

A Lower Bound on Web Services Composition.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006
Characterizing EF and EX tree logics.
Theor. Comput. Sci., 2006

Positional Determinacy of Games with Infinitely Many Priorities.
Logical Methods in Computer Science, 2006

Positional Determinacy of Games with Infinitely Many Priorities
CoRR, 2006

2005
Preface.
ITA, 2005

An NP-complete fragment of LTL.
Int. J. Found. Comput. Sci., 2005

Difficult Configurations-On the Complexity of LTrL.
Formal Methods in System Design, 2005

Deciding Nondeterministic Hierarchy of Deterministic Tree Automata.
Electr. Notes Theor. Comput. Sci., 2005

Alternating Timed Automata
CoRR, 2005

Idealized Algol with Ground Recursion, and DPDA Equivalence.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Unsafe Grammars and Panic Automata.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

From Logic to Games.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Third-Order Idealized Algol with Iteration Is Decidable.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Alternating Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
Foreword.
ITA, 2004

How to Fix It: Using Fixpoints in Different Contexts.
Proceedings of the Logic for Programming, 2004

A Landscape with Games in the Backgroun.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

An NP-Complete Fragment of LTL.
Proceedings of the Developments in Language Theory, 2004

Characterizing EF and EX Tree Logics.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
A gap property of deterministic tree languages.
Theor. Comput. Sci., 2003

Games for synthesis of controllers with partial observation.
Theor. Comput. Sci., 2003

Distributed Games.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Pushdown Games with Unboundedness and Regular Conditions.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Winning Strategies and Synthesis of Controllers (Tutorial).
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Monadic second-order logic on tree-like structures.
Theor. Comput. Sci., 2002

Local Logics for Traces.
Journal of Automata, Languages and Combinatorics, 2002

Permissive strategies: from parity games to safety games.
ITA, 2002

Complexity of weak acceptance conditions in tree automata.
Inf. Process. Lett., 2002

An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
Inf. Comput., 2002

Deciding low levels of tree-automata hierarchy.
Electr. Notes Theor. Comput. Sci., 2002

Describing properties of concurrent systems (Logic for Traces) (invited talk).
Electr. Notes Theor. Comput. Sci., 2002

Automata and Games for Synthesis.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Pushdown Processes: Games and Model-Checking.
Inf. Comput., 2001

2000
Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus.
Inf. Comput., 2000

Model Checking CTL Properties of Pushdown Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Guarded Fixed Point Logic.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems.
Ann. Pure Appl. Logic, 1998

Relating Hierarchies of Word and Tree Automata.
Proceedings of the STACS 98, 1998

The Horn Mu-calculus.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Difficult Configurations - On the Complexity of LTrL.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

How Much Memory is Needed to Win Infinite Games?
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996
Games for the mu-Calculus.
Theor. Comput. Sci., 1996

A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus.
Bulletin of Symbolic Logic, 1996

Monadic Second Order Logic on Tree-Like Structures.
Proceedings of the STACS 96, 1996

On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic.
Proceedings of the CONCUR '96, 1996

Pushdown Processes: Games and Model Checking.
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995
Automata for the Modal mu-Calculus and related Results.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus
Proceedings of the Proceedings, 1995

1993
Gentzen-Type Axiomatization for PAL.
Theor. Comput. Sci., 1993

On Completeness of the mu-calculus
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1990
Gentzen Type Axiomatizations for PAL.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Decision Procedure for Checking Validity of PAL Formulas.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990


  Loading...