@inproceedings{DBLP:conf/icalp/BenediktBVB17,
  title = "Characterizing Definability in Decidable Fixpoint Logics",
  author = "Michael Benedikt and Pierre Bourhis and Michael {Vanden Boom}",
  year = "2017",
  booktitle = "44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland",
  pages = "107:1--107:14",
  url = "https://doi.org/10.4230/LIPIcs.ICALP.2017.107",
  doi = "10.4230/LIPIcs.ICALP.2017.107",
}
@inproceedings{DBLP:conf/ijcai/AmarilliBBVB16,
  title = "Query Answering with Transitive and Linear-Ordered Data",
  author = "Antoine Amarilli and Michael Benedikt and Pierre Bourhis and Michael {Vanden Boom}",
  year = "2016",
  booktitle = "Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July 2016",
  pages = "893--899",
  url = "http://www.ijcai.org/Abstract/16/131",
}
@inproceedings{DBLP:conf/lics/BenediktBVB16,
  title = "A Step Up in Expressiveness of Decidable Fixpoint Logics",
  author = "Michael Benedikt and Pierre Bourhis and Michael {Vanden Boom}",
  year = "2016",
  booktitle = "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",
  url = "http://doi.acm.org/10.1145/2933575.2933592",
  doi = "10.1145/2933575.2933592",
}
@article{DBLP:journals/tocl/BenediktCVB16,
  title = "Effective Interpolation and Preservation in Guarded Logics",
  author = "Michael Benedikt and Balder ten Cate and Michael {Vanden Boom}",
  year = "2016",
  journal = "{ACM} Trans. Comput. Log.",
  number = "2",
  pages = "8",
  url = "http://doi.acm.org/10.1145/2814570",
  volume = "17",
  doi = "10.1145/2814570",
}
@inproceedings{BenediktCCVB15,
  title = "The Complexity of Boundedness for Guarded Logics",
  author = "Michael Benedikt and Balder ten Cate and Thomas Colcombet and Michael {Vanden Boom}",
  year = "2015",
  booktitle = "30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2015, Kyoto, Japan, July 6-10, 2015",
  pages = "293--304",
  url = "http://dx.doi.org/10.1109/LICS.2015.36",
  doi = "10.1109/LICS.2015.36",
}
@inproceedings{BenediktCVB15,
  title = "Interpolation with Decidable Fixpoint Logics",
  author = "Michael Benedikt and Balder ten Cate and Michael {Vanden Boom}",
  year = "2015",
  booktitle = "30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2015, Kyoto, Japan, July 6-10, 2015",
  pages = "378--389",
  url = "http://dx.doi.org/10.1109/LICS.2015.43",
  doi = "10.1109/LICS.2015.43",
}
@inproceedings{DBLP:conf/csl/BlumensathCKPVB14,
  title = "Two-way cost automata and cost logics over infinite trees",
  author = "Achim Blumensath and Thomas Colcombet and Denis Kuperberg and Pawel Parys and Michael {Vanden Boom}",
  year = "2014",
  booktitle = "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",
  editor = "Thomas A. Henzinger and Dale Miller",
  isbn = "978-1-4503-2886-9",
  pages = "16",
  publisher = "{ACM}",
  url = "http://dl.acm.org/citation.cfm?id=2603088",
  doi = "10.1145/2603088.2603104",
}
@inproceedings{DBLP:conf/csl/BenediktCVB14,
  title = "Effective interpolation and preservation in guarded logics",
  author = "Michael Benedikt and Balder ten Cate and Michael {Vanden Boom}",
  year = "2014",
  booktitle = "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",
  editor = "Thomas A. Henzinger and Dale Miller",
  isbn = "978-1-4503-2886-9",
  pages = "13",
  publisher = "{ACM}",
  url = "http://dl.acm.org/citation.cfm?id=2603088",
  doi = "10.1145/2603088.2603108",
}
@inproceedings{DBLP:conf/csl/ColcombetKLVB13,
  title = "Deciding the weak definability of B{\"{u}}chi definable tree languages",
  author = "Thomas Colcombet and Denis Kuperberg and Christof L{\"{o}}ding and Michael {Vanden Boom}",
  year = "2013",
  booktitle = "Computer Science Logic 2013 {(CSL} 2013), {CSL} 2013, September 2-5, 2013, Torino, Italy",
  editor = "Simona Ronchi Della Rocca",
  isbn = "978-3-939897-60-6",
  pages = "215--230",
  publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
  series = "LIPIcs",
  url = "http://drops.dagstuhl.de/opus/portals/extern/index.php?semnr=13009",
  volume = "23",
  doi = "10.4230/LIPIcs.CSL.2013.215",
}
@inproceedings{DBLP:conf/icalp/KuperbergVB12,
  title = "On the Expressive Power of Cost Logics over Infinite Words",
  author = "Denis Kuperberg and Michael {Vanden Boom}",
  year = "2012",
  booktitle = "Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}",
  editor = "Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer",
  isbn = "978-3-642-31584-8",
  pages = "287--298",
  publisher = "Springer",
  series = "Lecture Notes in Computer Science",
  url = "http://dx.doi.org/10.1007/978-3-642-31585-5",
  volume = "7392",
  doi = "10.1007/978-3-642-31585-5",
}
@phdthesis{VandenBoom12thesis,
  title = "Weak Cost Automata over Infinite Trees",
  author = "Michael Vanden Boom",
  year = "2012",
  month = "October",
  school = "University of Oxford",
}
@inproceedings{DBLP:conf/mfcs/VandenBoom11,
  title = "Weak Cost Monadic Logic over Infinite Trees",
  author = "Michael {Vanden Boom}",
  year = "2011",
  booktitle = "Mathematical Foundations of Computer Science 2011 - 36th International Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings",
  editor = "Filip Murlak and Piotr Sankowski",
  isbn = "978-3-642-22992-3",
  pages = "580--591",
  publisher = "Springer",
  series = "Lecture Notes in Computer Science",
  url = "http://dx.doi.org/10.1007/978-3-642-22993-0",
  volume = "6907",
  doi = "10.1007/978-3-642-22993-0",
}
@inproceedings{DBLP:conf/fsttcs/KuperbergVB11,
  title = "Quasi-Weak Cost Automata: {A} New Variant of Weakness",
  author = "Denis Kuperberg and Michael {Vanden Boom}",
  year = "2011",
  booktitle = "{IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011, Mumbai, India",
  editor = "Supratik Chakraborty and Amit Kumar",
  isbn = "978-3-939897-34-7",
  pages = "66--77",
  publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
  series = "LIPIcs",
  url = "http://drops.dagstuhl.de/portals/extern/index.php?semnr=110010",
  volume = "13",
  doi = "10.4230/LIPIcs.FSTTCS.2011.66",
}
@article{VandenBoom07,
  title = "The effective {B}orel hierarchy",
  author = "Vanden Boom, M.",
  year = "2007",
  issn = "0016-2736",
  journal = "Fund. Math.",
  mrnumber = "2338544 (2009h:03048)",
  number = "3",
  pages = "269--289",
  url = "http://dx.doi.org/10.4064/fm195-3-4",
  volume = "195",
  doi = "10.4064/fm195-3-4",
}
@article{KnightMVB07,
  title = "Turing computable embeddings",
  author = "Julia F. Knight and Sara Miller and Michael {Vanden Boom}",
  year = "2007",
  journal = "J. Symb. Log.",
  number = "3",
  pages = "901-918",
  volume = "72",
}