Nombre de documents

71

CV de Igor Walukiewicz


Communication dans un congrès38 documents

  • Michał Skrzypczak, Igor Walukiewicz. Deciding the topological complexity of Büchi languages *. ICALP, Jul 2016, Rome, Italy. LIPIcs, 55, pp.99:1--99:13, ICALP. <10.4230/LIPIcs.ICALP.2016.99>. <hal-01394829>
  • Lorenzo Clemente, Paweł Parys, Sylvain Salvati, Igor Walukiewicz. The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. IEEE. LICS, Jun 2016, New York, United States. pp.96 - 105, 2016, LICS. <10.1145/2933575.2934527>. <hal-01394830>
  • Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz. Soundness in negotiations *. 27th International Conference on Concurrency Theory (CONCUR 2016), Aug 2016, Québec, Canada. LIPIcs, 59, pp.12:1--12:13, 2016, CONCUR. <10.4230/LIPIcs.CONCUR.2016.12>. <hal-01394831>
  • 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. 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, Dec 2016, Chennai, India. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 65, pp.48:1-48:14, LIPIcs. <10.4230/LIPIcs.FSTTCS.2016.48>. <hal-01423714>
  • Sylvain Salvati, Igor Walukiewicz. Typing Weak MSOL Properties. FOSSACS, 2015, London, United Kingdom. Springer, 9034, pp.343 - 357, 2015, FOSSACS. <10.1007/978-3-662-46678-0_22>. <hal-01394824>
  • Volker Diekert, Anca Muscholl, Igor Walukiewicz. A Note on Monitors and Büchi automata. ICTAC, Jul 2015, Cali, Colombia. Springer, 9399, pp.39-57, 2015, ICTAC. <hal-01394826>
  • Salvatore Torre, Anca Muscholl, Igor Walukiewicz. Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable . 26th Conference on Concurrency Theory CONCUR 2015, Sep 2015, Madrid, Spain. LIPIcs, 42, pp.72-84, 2015, CONCUR. <10.4230/LIPIcs.CONCUR.2015.72>. <hal-01394827>
  • Sylvain Salvati, Igor Walukiewicz. Typing weak MSOL properties. FOSSACS'15, Apr 2015, London, United Kingdom. FOSSACS 2015. <hal-01061202v2>
  • Sylvain Salvati, Igor Walukiewicz. A model for behavioural properties of higher-order programs. 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, Sep 2015, Berlin, Germany. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 41, <http://dx.doi.org/10.4230/LIPIcs.CSL.2015.229>. <10.4230/LIPIcs.CSL.2015.229>. <hal-01145494>
  • Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz. Ordered Tree-Pushdown Systems. FSTTCS 2015, Dec 2015, Bangalore, India. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. <http://www.fsttcs.org/>. <hal-01145598>
  • Sylvain Salvati, Igor Walukiewicz. Evaluation is MSOL compatible. FSTTCS, 2013, Guwahati, India. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 24, pp.103-114, 2013, LIPIcs; FSTTCS. <10.4230/LIPIcs.FSTTCS.2013.103>. <hal-00773126v2>
  • Sylvain Salvati, Igor Walukiewicz. Using models to model-check recursive schemes. TLCA 2013, 2013, Eindhoven, Netherlands. 7941, pp.189-204, 2013, LNCS. <hal-00741077v2>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Asynchronous Games over Tree Architectures. Fomin, Fedor V. and Freivalds, Rūsiņš and Kwiatkowska, Marta and Peleg, David. ICALP - 40th International Colloquium on Automata, Languages, and Programming- 2013, Jul 2013, RIGA, Latvia. Springer, 7966, pp.275-286, 2013, LNCS; ICALP - 40th International Colloquium on Automata, Languages, and Programming- 2013 (Part II). <10.1007/978-3-642-39212-2_26>. <hal-00916615>
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Lazy abstractions for timed automata. Natasha Sharygina and Helmut Veith. CAV - 24th International Conference on Computer Aided Verification - 2013, Jul 2013, Saint Petersburg, Russia. Springer, 2013, Lecture Notes in Computer Science. <hal-00775924v2>
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Better abstractions for timed automata. LICS - 27th Annual ACM/IEEE Symposium on Logic in Computer Science - 2012, Jun 2012, Dubrovnick, Croatia. IEEE, pp.375-384, 2012. <hal-00708714>
  • Frédéric Herbreteau, D. Kini, B. Srivathsan, Igor Walukiewicz. Using non-convex approximations for efficient analysis of timed automata: Extended version. Chakraborty, Supratik and Kumar, Amit. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, Dec 2011, Mumbai, India. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 13, pp.78-89, 2011, LIPIcs; FSTTCS. <10.4230/LIPIcs.FSTTCS.2011.78>. <inria-00559902v3>
  • Sylvain Salvati, Igor Walukiewicz. Krivine machines and higher-order schemes. ICALP, 2011, Switzerland. 6756, pp.162-173, 2011, LNCS. <hal-00570017v2>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. International Conference on AUTOMATA, LANGUAGES AND PROGRAMMING, 2010, France. pp.52-63, 2010. <hal-00672834>
  • Igor Walukiewicz. Synthesis: Words and Traces. ATVA, 2010, Singapore. 6252, pp.18-21, 2010. <hal-00536789>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP, 2010, France. 6199, pp.52-63, 2010, LNCS. <hal-00536788>
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata. Tayssir Touili and Byron Cook and Paul Jackson. CAV - 22nd International Conference on Computer Aided Verification - 2010, Jul 2010, Edinburgh, United Kingdom. Springer, 6174 (2), pp.148-161, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-14295-6_15>. <hal-00477149>
  • Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz. Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS'09, 2009, United States. pp.1--10, 2009. <hal-00404783>
  • Igor Walukiewicz. Synthesis: words and traces. AutoMathA 2009 Conference of the AutoMathA programme, 2009, Belgium. 2009. <hal-00404816>
  • Pawel Parys, Igor Walukiewicz. Weak Alternating Timed Automata. ICALP'09, 2009, Greece. 5556, pp.273--284, 2009, LNCS. <hal-00360122v2>
  • Igor Walukiewicz. Traces and distributed synthesis. Workshop on Perspectives in Concurrency Theory on the occasion of P. S. Thiagarajan's 60th birthday, 2008, India. 2008. <hal-00404835>
  • Igor Walukiewicz. Finding Your Way in a Forest: On Different Types of Trees and Their Properties. FOSSACS, 2008, Budapest, Hungary. Springer, 4962, pp.1-4, 2008, LNCS. <hal-00346094>
  • Igor Walukiewicz. Synthesis via games. KNAW Academy Colloquium: New perspectives on Games and Interaction, 2007, Netherlands. 2007. <hal-00404808>
  • Igor Walukiewicz. Forest Algebras. Automata and Logic: History and Perspectives. Workshop on the occasion of Wolfgang Thomas's 60th birthday, 2007, Germany. 2007. <hal-00404813>
  • Anca Muscholl, Igor Walukiewicz. A lower bound on web services composition. Foundations of Software Science and Computational Structures, 2007, Portugal. pp.274-286, 2007, Lecture Notes in Computer Science. <hal-00306329>
  • Patrick Chervet, Igor Walukiewicz. Minimizing variants of visibly pushdown automata. MFCS'07, 2007, Ceský Krumlov, Czech Republic. 4708, pp.135-146, 2007, LNCS. <hal-00335723>
  • Igor Walukiewicz. Towards understanding tree languages: fixpoint hierarchies. AIML (Advances in Modal Logic), 2006, Australia. 2006. <hal-00404804>
  • Igor Walukiewicz. From logic to games. IFIP WG 2.2 40th Anniversary meeting, 2006, Italy. 2006. <hal-00404799>
  • Igor Walukiewicz. On importance of logic in informatics. Colloquium of Polish Mathematical Society, 2005, Poland. <hal-00404791>
  • Igor Walukiewicz. From logic to games. FSTTCS, 2005, India. 3821, pp.79-91, 2005. <hal-00404797>
  • Igor Walukiewicz. Pushing the limits of pushdown verification. Perspectives in verification, workshop in honour of Prof. Dr. Wolfgang Thomas on the occasion of his doctorate Honoris Causa, 2005, Cachan, France. 2005. <hal-00404832>
  • Andrzej Murawski, Luke Ong, Igor Walukiewicz. Idealized Algol with ground recursion, and PDA equivalence. ICALP'05, 2005, Portugal. 3580, pp.917-926, 2005, LNCS. <hal-00335728>
  • Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz. Unsafe grammars and panic automata. ICALP'05, 2005, Portugal. 3580, pp.1450--1461, 2005, LNCS. <hal-00335729>
  • Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz. Pushdown games with unboundedness and regular conditions. Paritosh K. Pandya, Jaikumar Radhakrishnan. FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, 2003, Mumbai, India. Springer Verlag, pp.88-99, 2003, Volume 2914 of Lecture Notes in Computer Sciences, pages 88-99. <hal-00012141>

Ouvrage (y compris édition critique et traduction)2 documents

  • Adrian Kosowski, Igor Walukiewicz. 20th International Symposium on Fundamentals of Computation Theory (FCT 2015), Proceedings, Gdansk, Poland, August 17-19, 2015. Springer, 9210, 2015, Lecture Notes in Computer Science, <10.1007/978-3-319-22177-9>. <hal-01251854>
  • Luca Aceto, Leslie Ann Goldberg, Ivan Damgard, Anna Ingolfsdottir, Magnus M. Halldorsson, et al.. Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack B: Algorithms, Automata, Complexity, and Games. Springer, pp.800, 2008, LNCS. <hal-00346099>

Rapport2 documents

  • Sylvain Salvati, Igor Walukiewicz. Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. 2012. <hal-00717718v2>
  • Sylvain Salvati, Igor Walukiewicz. Krivine machines and higher-order schemes. [Research Report] 2011, pp.17. <inria-00589407>

Article dans une revue18 documents

  • Frédéric Herbreteau, B Srivathsan, Igor Walukiewicz. Better Abstractions for Timed Automata. Information and Computation, Elsevier, 2016, 251, pp.67-90. <hal-01396775>
  • Sylvain Salvati, Igor Walukiewicz. Simply typed fixpoint calculus and collapsible pushdown automata. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2016, 26, pp.1304 - 1350. <10.1017/S0960129514000590>. <hal-01394828>
  • Sylvain Salvati, Igor Walukiewicz. Using Models to Model-Check Recursive Schemes. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2015, 11, pp.189 - 204. <10.1007/978-3-642-38946-7_15>. <hal-01394822>
  • Sylvain Salvati, Igor Walukiewicz. Using Models to Model-check Recursive Schemes. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2015, Selected Papers of the Conference "Typed Lambda Calculi and Applications [TLCA] 2013, <http://www.lmcs-online.org/ojs/viewarticle.php?id=1490&layout=abstract&iid=59>. <10.2168/LMCS-???>. <hal-01251224>
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata (Extended version). Formal Methods in System Design, Springer Verlag, 2012, Special issue on Computer Aided Verification (CAV'10), 40 (2), pp.122-146. <10.1007/s10703-011-0133-1>. <inria-00584849>
  • Pawel Parys, Igor Walukiewicz. Weak Alternating Timed Automata. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (3), pp.1-27. <10.2168/LMCS-8(3:18)2012>. <hal-00962246>
  • Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz. Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (3), pp.1-39. <hal-00962245>
  • Arnaud Carayol, Christof Loeding, Damian Niwinski, Igor Walukiewicz. Choice functions and well-orderings over the infinite binary tree. Central European Journal of Mathematics, Springer Verlag, 2010, 8 (6), pp.662-682. <10.2478/s11533-010-0046-z>. <hal-00733452>
  • Slawomir Lasota, Igor Walukiewicz. Alternating Timed Automata. ACM Transactions on Computational Logic, Association for Computing Machinery, 2008, 9 (2), pp.1-26. <10.1145/1342991.1342994>. <hal-00335734>
  • Andrzej Murawski, Igor Walukiewicz. Third-Order Idealized Algol with Iteration is Decidable. Journal of Theoretical Computer Science (TCS), Elsevier, 2008, 390 (2-3), pp.214-229. <hal-00335730>
  • Anca Muscholl, Igor Walukiewicz. A lower bound on web services composition. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2008, 4 (2:5), pp.1--14. <10.2168/LMCS-4(2:5)2008>. <hal-00344194>
  • Mikolaj Bojanczyk, Igor Walukiewicz. Characterizing EF and EX tree logics. Journal of Theoretical Computer Science (TCS), Elsevier, 2006, 358 (2-3), pp.255-272. <hal-00335736>
  • Erich Graedel, Igor Walukiewicz. Positional determinacy of games with infinitely many priorities. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2006, pp.1-22. <10.2168/LMCS-2(4:6)2006>. <hal-00335726>
  • Anca Muscholl, Igor Walukiewicz. An NP-Complete Fragment of LTL. International Journal of Foundations of Computer Science, World Scientific Publishing, 2005, 16 (4), pp.743--754. <hal-00306332>
  • Igor Walukiewicz. Difficult configurations -- On the complexity of LTrL. Formal Methods in System Design, Springer Verlag, 2005, 26 (1), pp.27-43. <hal-00353565>
  • Damian Niwinski, Igor Walukiewicz. Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electronic Notes in Theoretical Computer Science, Elsevier, 2005, 123, pp.195-208. <hal-00353557>
  • Julien Bernet, David Janin, Igor Walukiewicz. Permissive strategies : from parity games to safety games. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2002, 36, pp.251--275. <hal-00306411>
  • Julien Bernet, David Janin, Igor Walukiewicz. Permissive strategies: from parity games to safety games. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2002, 36, pp.261-275. <hal-00659985>

Chapitre d'ouvrage3 documents

  • Anca Muscholl, Igor Walukiewicz, Marc Zeitoun. A look at the control of asynchronous automata. K. Lodaya, M. Mukund, R. Ramanujam. Perspectives in Concurrency Theory, Universities Press India, pp.356--371, 2009. <hal-00355528>
  • André Arnold, Igor Walukiewicz. Nondeterministic controllers of nondeterministic processes. Logic and Automata, Amsterdam University Press, pp.29-52, 2007, Texts in Logic and Games. <hal-00315872>
  • Mikolaj Bojanczyk, Igor Walukiewicz. Forest Algebras. Logic and Automata, Amsterdam University Press, pp.107-132, 2007, Texts in Logic and Games. <hal-00346087>

Pré-publication, Document de travail6 documents

  • Sylvain Salvati, Igor Walukiewicz. A model for divergence insensitive properties of lambdaY-terms. 2015. <hal-01169352>
  • Anca Muscholl, Igor Walukiewicz. Distributed synthesis for acyclic architectures. 2014. <hal-00946554v2>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Asynchronous Games over Tree Architectures. 2013. <hal-00684223v3>
  • B. Srivathsan, Igor Walukiewicz. An alternate proof of Statman's finite completeness theorem. 2010. <hal-00660832>
  • Thierry Cachat, Igor Walukiewicz. The Complexity of Games on Higher Order Pushdown Automata. 2007. <hal-00144226>
  • Mikolaj Bojanczyk, Igor Walukiewicz. Forest Algebras. 2006. <hal-00105796>

Direction d'ouvrage, Proceedings2 documents

  • Giuseppe Castagna, Igor Walukiewicz. Selected Papers of the Conference "International Colloquium on Automata, Languages and Programming 2008" (ICALP). Special issue of Logical Methods in Computer Science.. IfCoLog, 2009. <hal-00694646>
  • Luca Aceto, Ivan Damgard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, et al.. 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, pp.1300, 2008. <hal-00343900>