Selected publications by Benjamin Monmege

GMM12: Pierre Ganty, Rupak Majumdar and Benjamin Monmege. Bounded underapproximations. Formal Methods in System Design 40(2), pages 206-231, 2012.
PDF | BibTeX + Abstract
doi: 10.1007/s10703-011-0136-y

BGMZ10: Benedikt Bollig, Paul Gastin, Benjamin Monmege and Marc Zeitoun. Pebble weighted automata and transitive closure logics. In S. Abramsky, F. Meyer auf der Heide and P. Spirakis (eds.), ICALP'10, Lecture Notes in Computer Science 6199, pages 587-598. Springer, 2010.
PDF | PDF (long version) | Slides | BibTeX + Abstract
doi: 10.1007/978-3-642-14162-1_49
GMM10: Pierre Ganty, Rupak Majumdar and Benjamin Monmege. Bounded Underapproximations. In B. Cook, P. Jackson and T. Touili (eds.), CAV'10, Lecture Notes in Computer Science 6174, pages 600-614. Springer, 2010.
PDF | PDF (long version) | BibTeX + Abstract
doi: 10.1007/978-3-642-14295-6_52

BGMZ11: Benedikt Bollig, Paul Gastin, Benjamin Monmege and Marc Zeitoun. Weighted Expressions and DFS Tree Automata. Research Report LSV-11-08, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2011. 32 pages.
PDF | BibTeX + Abstract
Mon10: Benjamin Monmege. Propriétés quantitatives des mots et des arbres - Applications aux langages XML. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
PDF | Slides | BibTeX

About LSV