Michael Vanden Boom : Publications

Journal papers

• [1]

  Effective Interpolation and Preservation in Guarded Logics

  Michael Benedikt‚ Balder ten Cate and Michael Vanden Boom

  In ACM Trans. Comput. Log.. Vol. 17. No. 2. Pages 8. 2016.

  Details about Effective Interpolation and Preservation in Guarded Logics | BibTeX data for Effective Interpolation and Preservation in Guarded Logics | DOI (10.1145/2814570) | Link to Effective Interpolation and Preservation in Guarded Logics

• [2]

  The effective Borel hierarchy

  M. Vanden Boom

  In Fund. Math.. Vol. 195. No. 3. Pages 269–289. 2007.

  Details about The effective Borel hierarchy | BibTeX data for The effective Borel hierarchy | DOI (10.4064/fm195-3-4) | Link to The effective Borel hierarchy

• [3]

  Turing computable embeddings

  Julia F. Knight‚ Sara Miller and Michael Vanden Boom

  In J. Symb. Log.. Vol. 72. No. 3. Pages 901−918. 2007.

  Details about Turing computable embeddings | BibTeX data for Turing computable embeddings

Conference papers

• [1]

  Characterizing Definability in Decidable Fixpoint Logics

  Michael Benedikt‚ Pierre Bourhis and Michael Vanden Boom

  In 44th International Colloquium on Automata‚ Languages‚ and Programming‚ ICALP 2017‚ July 10−14‚ 2017‚ Warsaw‚ Poland. Pages 107:1–107:14. 2017.

  Details about Characterizing Definability in Decidable Fixpoint Logics | BibTeX data for Characterizing Definability in Decidable Fixpoint Logics | DOI (10.4230/LIPIcs.ICALP.2017.107) | Link to Characterizing Definability in Decidable Fixpoint Logics

• [2]

  Query Answering with Transitive and Linear−Ordered Data

  Antoine Amarilli‚ Michael Benedikt‚ Pierre Bourhis and Michael Vanden Boom

  In Proceedings of the Twenty−Fifth International Joint Conference on Artificial Intelligence‚ IJCAI 2016‚ New York‚ NY‚ USA‚ 9−15 July 2016. Pages 893–899. 2016.

  Details about Query Answering with Transitive and Linear−Ordered Data | BibTeX data for Query Answering with Transitive and Linear−Ordered Data | Link to Query Answering with Transitive and Linear−Ordered Data

• [3]

  A Step Up in Expressiveness of Decidable Fixpoint Logics

  Michael Benedikt‚ Pierre Bourhis and Michael Vanden Boom

  In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS '16‚ New York‚ NY‚ USA‚ July 5−8‚ 2016. Pages 817–826. 2016.

  Details about A Step Up in Expressiveness of Decidable Fixpoint Logics | BibTeX data for A Step Up in Expressiveness of Decidable Fixpoint Logics | DOI (10.1145/2933575.2933592) | Link to A Step Up in Expressiveness of Decidable Fixpoint Logics

• [4]

  The Complexity of Boundedness for Guarded Logics

  Michael Benedikt‚ Balder ten Cate‚ Thomas Colcombet and Michael Vanden Boom

  In 30th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2015‚ Kyoto‚ Japan‚ July 6−10‚ 2015. Pages 293–304. 2015.

  Details about The Complexity of Boundedness for Guarded Logics | BibTeX data for The Complexity of Boundedness for Guarded Logics | DOI (10.1109/LICS.2015.36) | Link to The Complexity of Boundedness for Guarded Logics

• [5]

  Interpolation with Decidable Fixpoint Logics

  Michael Benedikt‚ Balder ten Cate and Michael Vanden Boom

  In 30th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2015‚ Kyoto‚ Japan‚ July 6−10‚ 2015. Pages 378–389. 2015.

  Details about Interpolation with Decidable Fixpoint Logics | BibTeX data for Interpolation with Decidable Fixpoint Logics | DOI (10.1109/LICS.2015.43) | Link to Interpolation with Decidable Fixpoint Logics

• [6]

  Two−way cost automata and cost logics over infinite trees

  Achim Blumensath‚ Thomas Colcombet‚ Denis Kuperberg‚ Pawel Parys and Michael Vanden Boom

  In Thomas A. Henzinger and Dale Miller, editors, Joint Meeting of the Twenty−Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty−Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)‚ CSL−LICS '14‚ Vienna‚ Austria‚ July 14 − 18‚ 2014. Pages 16. ACM. 2014.

  Details about Two−way cost automata and cost logics over infinite trees | BibTeX data for Two−way cost automata and cost logics over infinite trees | DOI (10.1145/2603088.2603104) | Link to Two−way cost automata and cost logics over infinite trees

• [7]

  Effective interpolation and preservation in guarded logics

  Michael Benedikt‚ Balder ten Cate and Michael Vanden Boom

  In Thomas A. Henzinger and Dale Miller, editors, Joint Meeting of the Twenty−Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty−Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)‚ CSL−LICS '14‚ Vienna‚ Austria‚ July 14 − 18‚ 2014. Pages 13. ACM. 2014.

  Details about Effective interpolation and preservation in guarded logics | BibTeX data for Effective interpolation and preservation in guarded logics | DOI (10.1145/2603088.2603108) | Link to Effective interpolation and preservation in guarded logics

• [8]

  Deciding the weak definability of Büchi definable tree languages

  Thomas Colcombet‚ Denis Kuperberg‚ Christof Löding and Michael Vanden Boom

  In Simona Ronchi Della Rocca, editor, Computer Science Logic 2013 (CSL 2013)‚ CSL 2013‚ September 2−5‚ 2013‚ Torino‚ Italy. Vol. 23 of LIPIcs. Pages 215–230. Schloss Dagstuhl − Leibniz−Zentrum fuer Informatik. 2013.

  Details about Deciding the weak definability of Büchi definable tree languages | BibTeX data for Deciding the weak definability of Büchi definable tree languages | DOI (10.4230/LIPIcs.CSL.2013.215) | Link to Deciding the weak definability of Büchi definable tree languages

• [9]

  On the Expressive Power of Cost Logics over Infinite Words

  Denis Kuperberg and Michael Vanden Boom

  In Artur Czumaj‚ Kurt Mehlhorn‚ Andrew M. Pitts and Roger Wattenhofer, editors, Automata‚ Languages‚ and Programming − 39th International Colloquium‚ ICALP 2012‚ Warwick‚ UK‚ July 9−13‚ 2012‚ Proceedings‚ Part II. Vol. 7392 of Lecture Notes in Computer Science. Pages 287–298. Springer. 2012.

  Details about On the Expressive Power of Cost Logics over Infinite Words | BibTeX data for On the Expressive Power of Cost Logics over Infinite Words | DOI (10.1007/978-3-642-31585-5) | Link to On the Expressive Power of Cost Logics over Infinite Words

• [10]

  Weak Cost Monadic Logic over Infinite Trees

  Michael Vanden Boom

  In Filip Murlak and Piotr Sankowski, editors, Mathematical Foundations of Computer Science 2011 − 36th International Symposium‚ MFCS 2011‚ Warsaw‚ Poland‚ August 22−26‚ 2011. Proceedings. Vol. 6907 of Lecture Notes in Computer Science. Pages 580–591. Springer. 2011.

  Details about Weak Cost Monadic Logic over Infinite Trees | BibTeX data for Weak Cost Monadic Logic over Infinite Trees | DOI (10.1007/978-3-642-22993-0) | Link to Weak Cost Monadic Logic over Infinite Trees

• [11]

  Quasi−Weak Cost Automata: A New Variant of Weakness

  Denis Kuperberg and Michael Vanden Boom

  In Supratik Chakraborty and Amit Kumar, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science‚ FSTTCS 2011‚ December 12−14‚ 2011‚ Mumbai‚ India. Vol. 13 of LIPIcs. Pages 66–77. Schloss Dagstuhl − Leibniz−Zentrum fuer Informatik. 2011.

  Details about Quasi−Weak Cost Automata: A New Variant of Weakness | BibTeX data for Quasi−Weak Cost Automata: A New Variant of Weakness | DOI (10.4230/LIPIcs.FSTTCS.2011.66) | Link to Quasi−Weak Cost Automata: A New Variant of Weakness

Theses

• [1]

  Weak Cost Automata over Infinite Trees

  Michael Vanden Boom

  PhD Thesis University of Oxford. October, 2012.

  Details about Weak Cost Automata over Infinite Trees | BibTeX data for Weak Cost Automata over Infinite Trees | Download  (pdf) of Weak Cost Automata over Infinite Trees