Pitch Spelling Jazz Lead Sheets, Solo Transcriptions, Classical Piano and Monophonic Scores.

Florent Jacquemard

Augustin Bouquillard Florent Jacquemard Pitch Spelling Jazz Lead Sheets, Solo Transcriptions, Classical Piano and Monophonic Scores. 2026 June abs/2606.20198 CoRR https://doi.org/10.48550/arXiv.2606.20198 db/journals/corr/corr2606.html#abs-2606-20198 streams/journals/corr

Léo Géré Nicolas Audebert Florent Jacquemard Detecting Notational Errors in Digital Music Scores. 2025 October abs/2510.02746 CoRR https://doi.org/10.48550/arXiv.2510.02746 db/journals/corr/corr2510.html#abs-2510-02746 streams/journals/corr

Augustin Bouquillard Florent Jacquemard Engraving Oriented Joint Estimation of Pitch Spelling and Local and Global Keys. 2024 abs/2402.10247 CoRR https://doi.org/10.48550/arXiv.2402.10247 db/journals/corr/corr2402.html#abs-2402-10247

Emmanouil Karystinaios Francesco Foscarin Florent Jacquemard Masahiko Sakai Satoshi Tojo Gerhard Widmer 8 + 8 = 4: Formalizing Time Units to Handle Symbolic Music Durations. 337-348 2023 CMMR https://doi.org/10.1007/978-3-032-02042-0_26 conf/cmmr/2023 db/conf/cmmr/cmmr2023.html#KarystinaiosFJSTW23 streams/conf/cmmr

Emmanouil Karystinaios Francesco Foscarin Florent Jacquemard Masahiko Sakai Satoshi Tojo Gerhard Widmer 8+8=4: Formalizing Time Units to Handle Symbolic Music Durations. 2023 abs/2310.14952 CoRR https://doi.org/10.48550/arXiv.2310.14952 db/journals/corr/corr2310.html#abs-2310-14952

Mathieu Giraud Florent Jacquemard Weighted automata computation of edit distances with consolidations and fragmentations. 104652 2022 282 Inf. Comput. https://doi.org/10.1016/j.ic.2020.104652 db/journals/iandc/iandc282.html#GiraudJ22

Florent Jacquemard Lydia Rodriguez de la Nava Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription. 67-79 2022 CIAA https://doi.org/10.1007/978-3-031-07469-1_5 conf/wia/2022 db/conf/wia/ciaa2022.html#JacquemardN22 Francesco Foscarin Andrew McLeod Philippe Rigaux Florent Jacquemard Masahiko Sakai ASAP: a dataset of aligned scores and performances for piano transcription. 534-541 2020 ISMIR http://archives.ismir.net/ismir2020/paper/000127.pdf conf/ismir/2020 db/conf/ismir/ismir2020.html#FoscarinMRJS20

Florent Jacquemard Michaël Rusinowitch One-variable context-free hedge automata. 278-296 2019 104 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2016.10.006 db/journals/jcss/jcss104.html#JacquemardR19

Francesco Foscarin Florent Jacquemard Raphaël Fournier-S'niehotta A diff procedure for music score files. 58-64 2019 DLfM https://doi.org/10.1145/3358664.3358671 conf/dlfm/2019 db/conf/dlfm/dlfm2019.html#FoscarinJF19 Francesco Foscarin Florent Jacquemard Philippe Rigaux Masahiko Sakai A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring. 248-260 2019 MCM https://doi.org/10.1007/978-3-030-21392-3_20 conf/mcm2/2019 db/conf/mcm2/mcm2019.html#FoscarinJRS19

Florent Jacquemard Luc Segoufin Jerémie Dimino FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems. 2016 12 2 Log. Methods Comput. Sci. https://doi.org/10.2168/LMCS-12(2:3)2016 http://arxiv.org/abs/1601.01579 db/journals/lmcs/lmcs12.html#JacquemardSD16

Clément Poncelet Sanchez Florent Jacquemard Model-based testing for building reliable realtime interactive music systems. 143-172 2016 132 Sci. Comput. Program. https://doi.org/10.1016/j.scico.2016.08.002 db/journals/scp/scp132.html#SanchezJ16

Adrien Ycart Florent Jacquemard Jean Bresson Slawek Staworko A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration. 2016 ICMC https://hdl.handle.net/2027/spo.bbp2372.2016.073 conf/icmc/2016 db/conf/icmc/icmc2016.html#YcartJBS16 Florent Jacquemard Yoshiharu Kojima Masahiko Sakai Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies. 137-151 2015 CADE https://doi.org/10.1007/978-3-319-21401-6_9 conf/cade/2015 db/conf/cade/cade2015.html#JacquemardKS15 Florent Jacquemard Pierre Donat-Bouillud Jean Bresson A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting. 3-15 2015 MCM https://doi.org/10.1007/978-3-319-20603-5_1 conf/mcm2/2015 db/conf/mcm2/mcm2015.html#JacquemardDB15 Clément Poncelet Sanchez Florent Jacquemard Model based testing of an interactive music system. 1759-1764 2015 SAC https://doi.org/10.1145/2695664.2695804 conf/sac/2015 db/conf/sac/sac2015.html#SanchezJ15 Clément Poncelet Sanchez Florent Jacquemard Test Methods for Score-Based Interactive Music Systems. 2014 ICMC https://hdl.handle.net/2027/spo.bbp2372.2014.151 conf/icmc/2014 db/conf/icmc/icmc2014.html#SanchezJ14

Florent Jacquemard Clément Poncelet Sanchez Antescofo Intermediate Representation. 2014 abs/1404.7335 CoRR http://arxiv.org/abs/1404.7335 db/journals/corr/corr1404.html#JacquemardS14

Luis Barguñó Carles Creus Guillem Godoy Florent Jacquemard Camille Vacher Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories https://doi.org/10.2168/LMCS-9(2:1)2013 http://arxiv.org/abs/1302.6960 2013 Log. Methods Comput. Sci. 9 2 db/journals/lmcs/lmcs9.html#abs-1302-6960

José Echeveste Arshia Cont Jean-Louis Giavitto Florent Jacquemard Operational semantics of a domain specific language for real time musician-computer interaction. 343-383 2013 23 Discret. Event Dyn. Syst. 4 https://doi.org/10.1007/s10626-013-0166-2 db/journals/deds/deds23.html#EchevesteCGJ13

Guillaume Baudart Florent Jacquemard Louis Mandel Marc Pouzet A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music. 1:1-1:12 2013 EMSOFT https://doi.org/10.1109/EMSOFT.2013.6658579 http://dl.acm.org/citation.cfm?id=2555755 conf/emsoft/2013 db/conf/emsoft/emsoft2013.html#BaudartJMP13 Léa Fanchon Florent Jacquemard Formal Timing Analysis of mixed Music Scores. 2013 ICMC https://hdl.handle.net/2027/spo.bbp2372.2013.006 conf/icmc/2013 db/conf/icmc/icmc2013.html#FanchonJ13 Florent Jacquemard Michaël Rusinowitch Rewrite Closure and CF Hedge Automata. 371-382 2013 conf/lata/2013 LATA https://doi.org/10.1007/978-3-642-37064-9_33 db/conf/lata/lata2013.html#JacquemardR13

Adel Bouhoula Florent Jacquemard Sufficient completeness verification for conditional and constrained TRS. 127-143 2012 10 J. Appl. Log. 1 https://doi.org/10.1016/j.jal.2011.09.001 db/journals/japll/japll10.html#BouhoulaJ12

Arshia Cont José Echeveste Jean-Louis Giavitto Florent Jacquemard Correct Automatic Accompaniment Despite Machine listening or Human errors in Antescofo. 2012 ICMC https://hdl.handle.net/2027/spo.bbp2372.2012.036 conf/icmc/2012 db/conf/icmc/icmc2012.html#ContEGJ12

Florent Jacquemard Michaël Rusinowitch Rewrite Closure and CF Hedge Automata http://arxiv.org/abs/1212.5108 2012 CoRR abs/1212.5108 db/journals/corr/corr1212.html#abs-1212-5108

Florent Jacquemard Extended Tree Automata Models for the Verification of Infinite State Systems. (Modèles d'automates d'arbres étendus pour la vérification de systèmes infinis). 2011 École normale supérieure de Cachan, France https://tel.archives-ouvertes.fr/tel-00643595

Florent Jacquemard Francis Klay Camille Vacher Rigid tree automata and applications. 486-512 2011 209 Inf. Comput. 3 https://doi.org/10.1016/j.ic.2010.11.015 db/journals/iandc/iandc209.html#JacquemardKV11

Florent Jacquemard Yoshiharu Kojima Masahiko Sakai Controlled Term Rewriting. 179-194 2011 FroCoS https://doi.org/10.1007/978-3-642-24364-6_13 conf/frocos/2011 db/conf/frocos/frocos2011.html#JacquemardKS11 Florent Jacquemard Étienne Lozes Ralf Treinen Jules Villard Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus. 166-185 2011 TOSCA https://doi.org/10.1007/978-3-642-27375-9_10 conf/tosca/2011 db/conf/tosca/tosca2011.html#JacquemardLTV11 Luis Barguñó Carles Creus Guillem Godoy Florent Jacquemard Camille Vacher The Emptiness Problem for Tree Automata with Global Constraints. 263-272 2010 LICS https://doi.org/10.1109/LICS.2010.28 https://doi.ieeecomputersociety.org/10.1109/LICS.2010.28 conf/lics/2010 db/conf/lics/lics2010.html#BargunoCGJV10 Florent Jacquemard Michaël Rusinowitch Rewrite-based verification of XML updates. 119-130 2010 PPDP https://doi.org/10.1145/1836089.1836105 conf/ppdp/2010 db/conf/ppdp/ppdp2010.html#JacquemardR10 Nihel Ben Youssef Adel Bouhoula Florent Jacquemard Automatic verification of conformance of firewall configurations to security policies. 526-531 2009 ISCC https://doi.org/10.1109/ISCC.2009.5202309 https://doi.ieeecomputersociety.org/10.1109/ISCC.2009.5202309 conf/iscc/2009 db/conf/iscc/iscc2009.html#YoussefBJ09 Florent Jacquemard Francis Klay Camille Vacher Rigid Tree Automata. 446-457 2009 LATA https://doi.org/10.1007/978-3-642-00982-2_38 conf/lata/2009 db/conf/lata/lata2009.html#JacquemardKV09 Guillem Godoy Florent Jacquemard Unique Normalization for Shallow TRS. 63-77 2009 RTA https://doi.org/10.1007/978-3-642-02348-4_5 conf/rta/2009 db/conf/rta/rta2009.html#GodoyJ09

Florent Jacquemard Michaël Rusinowitch Rewrite based Verification of XML Updates http://arxiv.org/abs/0907.5125 2009 CoRR abs/0907.5125 db/journals/corr/corr0907.html#abs-0907-5125

Florent Jacquemard Michaël Rusinowitch Laurent Vigneron Tree automata with equality constraints modulo equational theories. 182-208 2008 75 J. Log. Algebraic Methods Program. 2 https://doi.org/10.1016/j.jlap.2007.10.006 db/journals/jlp/jlp75.html#JacquemardRV08

Hubert Comon-Lundh Florent Jacquemard Nicolas Perrin 0001 Visibly Tree Automata with Memory and Constraints. 2008 4 Log. Methods Comput. Sci. 2 https://doi.org/10.2168/LMCS-4(2:8)2008 db/journals/lmcs/lmcs4.html#Comon-LundhJP08

Adel Bouhoula Florent Jacquemard Automated Induction with Constrained Tree Automata. 539-554 2008 IJCAR https://doi.org/10.1007/978-3-540-71070-7_44 conf/cade/2008 db/conf/cade/ijcar2008.html#BouhoulaJ08 Florent Jacquemard Michaël Rusinowitch Closure of Hedge-Automata Languages by Hedge Rewriting. 157-171 2008 RTA https://doi.org/10.1007/978-3-540-70590-1_11 conf/rta/2008 db/conf/rta/rta2008.html#JacquemardR08 Adrià Gascón Guillem Godoy Florent Jacquemard Closure of Tree Automata Languages under Innermost Rewriting. 23-38 2008 conf/wrs/2008 WRS@RTA https://doi.org/10.1016/j.entcs.2009.03.033 db/journals/entcs/entcs237.html#GasconGJ09

Hubert Comon-Lundh Florent Jacquemard Nicolas Perrin 0001 Visibly Tree Automata with Memory and Constraints http://arxiv.org/abs/0804.3065 2008 CoRR abs/0804.3065 db/journals/corr/corr0804.html#abs-0804-3065

Adel Bouhoula Florent Jacquemard Automated Induction for Complex Data Structures http://arxiv.org/abs/0811.4720 2008 CoRR abs/0811.4720 db/journals/corr/corr0811.html#abs-0811-4720

Hubert Comon-Lundh Florent Jacquemard Nicolas Perrin 0001 Tree Automata with Memory, Visibility and Structural Constraints. 168-182 2007 conf/fossacs/2007 FoSSaCS https://doi.org/10.1007/978-3-540-71389-0_13 db/conf/fossacs/fossacs2007.html#Comon-LundhJP07

Stéphanie Delaune Florent Jacquemard Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks. 85-124 2006 36 J. Autom. Reason. 1-2 https://doi.org/10.1007/s10817-005-9017-7 db/journals/jar/jar36.html#DelauneJ06

Ichiro Mitsuhashi Michio Oyamaguchi Florent Jacquemard The Confluence Problem for Flat TRSs. 68-81 2006 conf/aisc/2006 AISC https://doi.org/10.1007/11856290_8 db/conf/aisc/aisc2006.html#MitsuhashiOJ06 Florent Jacquemard Michaël Rusinowitch Laurent Vigneron Tree Automata with Equality Constraints Modulo Equational Theories. 557-571 2006 conf/cade/2006 IJCAR https://doi.org/10.1007/11814771_45 db/conf/cade/ijcar2006.html#JacquemardRV06 Olivier Michel Florent Jacquemard An Analysis of a Public Key Protocol with Membranes. 283-302 2006 conf/ncs/2006membrane Applications of Membrane Computing https://doi.org/10.1007/3-540-29937-8_10 db/conf/ncs/membrane2006.html#MichelJ06 Stéphanie Delaune Florent Jacquemard A decision procedure for the verification of security protocols with explicit destructors. 278-287 2004 conf/ccs/2004ccs CCS https://doi.org/10.1145/1030083.1030121 db/conf/ccs/ccs2004p.html#DelauneJ04 Stéphanie Delaune Florent Jacquemard A Theory of Dictionary Attacks and its Complexity. 2-15 2004 conf/csfw/2004 CSFW https://doi.ieeecomputersociety.org/10.1109/CSFW.2004.3 db/conf/csfw/csfw2004.html#DelauneJ04

Hubert Comon Florent Jacquemard Ground reducibility is EXPTIME-complete. 123-153 2003 187 Inf. Comput. 1 https://doi.org/10.1016/S0890-5401(03)00134-2 db/journals/iandc/iandc187.html#ComonJ03

Florent Jacquemard Reachability and confluence are undecidable for flat term rewriting systems. 265-270 2003 87 Inf. Process. Lett. 5 https://doi.org/10.1016/S0020-0190(03)00310-7 db/journals/ipl/ipl87.html#Jacquemard03

Harald Ganzinger Florent Jacquemard Margus Veanes Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification. 3-27 2000 11 Int. J. Found. Comput. Sci. 1 db/journals/ijfcs/ijfcs11.html#GanzingerJV00 https://doi.org/10.1142/S012905410000003X

Florent Jacquemard Michaël Rusinowitch Laurent Vigneron Compiling and Verifying Security Protocols. 131-160 https://doi.org/10.1007/3-540-44404-1_10 2000 conf/lpar/2000 LPAR db/conf/lpar/lpar2000.html#JacquemardRV00 Véronique Cortier Harald Ganzinger Florent Jacquemard Margus Veanes Decidable Fragments of Simultaneous Rigid Reachability. 250-260 https://doi.org/10.1007/3-540-48523-6_22 1999 conf/icalp/99 ICALP db/conf/icalp/icalp99.html#CortierGJV99 Harald Ganzinger Florent Jacquemard Margus Veanes Rigid Reachability. 4-21 1998 conf/asian/1998 ASIAN https://doi.org/10.1007/3-540-49366-2_2 db/conf/asian/asian98.html#GanzingerJV98 Florent Jacquemard Christoph Meyer 0001 Christoph Weidenbach Unification in Extension of Shallow Equational Theories. 76-90 https://doi.org/10.1007/BFb0052362 1998 conf/rta/1998 RTA db/conf/rta/rta98.html#JacquemardMW98 Hubert Comon Florent Jacquemard Ground Reducibility is EXPTIME-Complete. 26-34 https://doi.org/10.1109/LICS.1997.614922 https://doi.ieeecomputersociety.org/10.1109/LICS.1997.614922 1997 conf/lics/1997 LICS db/conf/lics/lics97.html#ComonJ97 Florent Jacquemard Decidable Approximations of Term Rewriting Systems. 362-376 1996 conf/rta/1996 RTA db/conf/rta/rta96.html#Jacquemard96 https://doi.org/10.1007/3-540-61464-8_65 Anne-Cécile Caron Hubert Comon Jean-Luc Coquidé Max Dauchet Florent Jacquemard Pumping, Cleaning and Symbolic Constraints Solving. 436-449 1994 conf/icalp/1994 ICALP db/conf/icalp/icalp94.html#CaronCCDJ94 https://doi.org/10.1007/3-540-58201-0_88 Hubert Comon Florent Jacquemard Ground Reducibility and Automata with Disequality Constraints. 151-162 1994 conf/stacs/1994 STACS db/conf/stacs/stacs94.html#ComonJ94 https://doi.org/10.1007/3-540-57785-8_138 Nicolas Audebert Luis Barguñó Guillaume Baudart Adel Bouhoula Augustin Bouquillard Jean Bresson Anne-Cécile Caron Hubert Comon-LundhHubert Comon Arshia Cont Jean-Luc Coquidé Véronique Cortier Carles Creus Max Dauchet Stéphanie Delaune Jerémie Dimino Pierre Donat-Bouillud José Echeveste Léa Fanchon Francesco Foscarin Raphaël Fournier-S'niehotta Harald Ganzinger Adrià Gascón Léo Géré Jean-Louis Giavitto Mathieu Giraud Guillem Godoy Emmanouil Karystinaios Christoph M. KirschChristoph Meyer 0001 Francis Klay Yoshiharu Kojima Étienne Lozes Louis Mandel Andrew McLeod Olivier Michel Ichiro Mitsuhashi Lydia Rodriguez de la Nava Michio Oyamaguchi Nicolas Perrin-GilbertNicolas Perrin 0001 Marc Pouzet Philippe Rigaux Michaël Rusinowitch Masahiko Sakai Clément Poncelet Sanchez Luc Segoufin Slawomir StaworkoSlawek Staworko Satoshi Tojo Ralf Treinen Camille Vacher Margus Veanes Laurent Vigneron Jules Villard Christoph Weidenbach Gerhard Widmer Adrien Ycart Nihel Ben Youssef