
Florent Jacquemard
Chargé de recherche
Personal website: https://jacquema.gitlabpages.inria.fr
Office: 37.1.40
Research scientist at Inria, member of Vertigo team, on leave at the Cedric lab, CNAM, Paris. With a background on formal methods for systems and software verification, my current research project is concerned with the processing of symbolic music data, in collaboration with specialists in Score Databases, Musicology and Computer Aided Composition.
2024
Articles de conférence
- Tokenization of MIDI Sequences for Transcription. In 9th International Conference on Technologies for Music Notation and Representation (TENOR 2024), Zurich, Switzerland, 2024. www
- Engraving Oriented Joint Estimation of Pitch Spelling and Local and Global Keys. In International Conference on Technologies for Music Notation and Representation (TENOR), Zurich, Switzerland, 2024. www
2023
Articles de conférence
- 8+8=4: Formalizing Time Units to Handle Symbolic Music Durations. In 16th International Symposium on Computer Music Multidisciplinary Research (CMMR), Tokyo, Japan, 2023. www
2022
Articles de revue
- Weighted Automata Computation of Edit Distances with Consolidations and Fragmentations. In Information and Computation, 282: 104652, 2022. doi www
Articles de conférence
- Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription. In Implementation and Application of Automata. CIAA 2022, pages 67-79, Springer, Rouen, France, Lecture Notes in Computer Science, vol 13266 , 2022. doi www
- Automated Transcription of Electronic Drumkits. In 4th International Workshop on Reading Music Systems (WoRMS), online, Spain, Proceedings of the 4th International Workshop on Reading Music Systems , 2022. www
Divers
- MIDI To Score Automated Drum Transcription. , Poster. www
2021
Non publié
- Symbolic Weighted Language Models, Quantitative Parsing and Verification over Infinite Alphabets. , working paper or preprint. www
2020
Articles de conférence
- ASAP: a dataset of aligned scores and performances for piano transcription. In ISMIR 2020 - 21st International Society for Music Information Retrieval, Montreal / Virtual, Canada, 2020. www
2019
Articles de conférence
- Optimization of audio graphs by resampling. In Proceedings of the 22nd International Conference on Digital Audio Effects, Birmingham, United Kingdom, Proceedings of the 22nd International Conference on Digital Audio Effects , 2019. www
- Computation and Visualization of Differences between two XML Music Score Files. In ISMIR 2019 - 20th annual conference of the International Society for Music Information Retrieval, Delft, Netherlands, 2019. www
- Modeling and Learning Rhythm Structure. In Sound and Music Computing Conference (SMC), Malaga, Spain, 2019. www
- A Parse-based Framework for Coupled Rhythm Quantization and Score Structuring. In Proceedings of the Seventh International Conference on Mathematics and Computation in Music (MCM 2019), Springer, Madrid, Spain, Proceedings of the Seventh International Conference on Mathematics and Computation in Music (MCM 2019) Lecture Notes in Computer Science, 2019. doi www
- A diff procedure for music score files. In 6th International Conference on Digital Libraries for Musicology (DLfM), pages 7, ACM, The Hague, Netherlands, 2019. www
Non publié
- What does the Mongeau-Sankoff algorithm compute?. , working paper or preprint. www
2018
Articles de conférence
- Gioqoso, an online Quality Assessment Tool for Music Notation. In Proceedings of the International Conference on Technologies for Music Notation and Representation -- TENOR'18, Concordia University, Montreal, Canada, Proceedings of the International Conference on Technologies for Music Notation and Representation -- TENOR'18 , 2018. www
- 'Evaluation de la correction rythmique des partitions numérisées. In JIM 2018 - Journées d'Informatique Musicale, pages 87-95, Amiens, France, 2018. www
Divers
2017
Articles de conférence
- Interactive Music Transcription based on Rhythm Tree Languages. In 16th Rhythm Production and Perception Workshop, Birmingham, United Kingdom, 2017. www
- Generating equivalent rhythmic notations based on rhythm tree languages. In Third International Conference on Technologies for Music Notation and Representation (TENOR), Coro~na, Spain, 2017. www
2016
Articles de revue
- FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems. In Logical Methods in Computer Science, 12 (2): 32, 2016. doi www
- An Automatic Test Framework for Interactive Music Systems. In Journal of New Music Research, 45 (2): 18, 2016. www
- One-variable context-free hedge automata. In Journal of Computer and System Sciences, 2016. doi www
- Model-Based Testing for Building Reliable Realtime Interactive Music Systems. In Science of Computer Programming, 132 (2): 143-172, 2016. www
Articles de conférence
- Une approche interactive pour la transcription rythmique dans OpenMusic. In Journées d'Informatique Musicale 2016, Albi, France, Journées d'Informatique Musicale 2016 , 2016. www
- A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration. In Proceedings of the 42nd International Computer Music Conference (ICMC), Utrecht, Netherlands, Proceedings of the 42nd International Computer Music Conference (ICMC) , 2016. www
- Some results on confluence: decision and what to do without. In Proceedings of the 5th International Workshop on Confluence, Obergurgl, Austria, Proceedings of the 5th International Workshop on Confluence , 2016. www
2015
Articles de conférence
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies. In LNCS, Springer, Berlin, Germany, LNCS , 2015. www
- Projet EFFICACE : Développements et perspectives en composition assistée par ordinateur. In Journées d'Informatique Musicale, Montréal, Canada, 2015. www
- Towards an Equational Theory of Rhythm Notation. In Music Encoding Conference 2015, Florence, Italy, 2015. www
- Model Based Testing of an Interactive Music System. In Proceedings of the 30th ACM/SIGAPP Symposium On Applied Computing (ACM SAC), ACM, Salamanca, Spain, 2015. doi www
- A Structural Theory of Rhythm Notation based on Tree Representations and Term Rewriting. In Lecture Notes in Artificial Intelligence, pages 12, Springer, London, United Kingdom, Lecture Notes in Artificial Intelligence 9110, 2015. www
Rapports
- A Term Rewriting Based Structural Theory of Rhythm Notation. Technical Report, ANR-13-JS02-0004-01 - EFFICACe, 2015.
- Offline methods of conformance testing for Antescofo. Technical Report RR-8700, IRCAM ; INRIA Paris-Rocquencourt ; INRIA, 2015.
- Rapport d'étape et bilan financier 2015 PHC AMADEUS 2015 `` LETITBE '' Ntextdegree 33808SC. Technical Report, Institut franc cais de Vienne, 2015.
- Compilation of the Intermediate Representation V1. Technical Report RR-8701, IRCAM ; INRIA Paris-Rocquencourt ; INRIA, 2015.
2014
Articles de conférence
- Rhythm Tree Rewriting. In Meeting of the IFIP WG 1.6 on Term Rewriting, Vienna Summer of Logic, Vienna, Austria, 2014. www
- Test Methods for Score-Based Interactive Music Systems. In ICMC SMC 2014, Athen, Greece, 2014. www
Divers
Rapports
- Antescofo Intermediate Representation. Technical Report RR-8520, INRIA, 2014.
2013
Articles de revue
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories. In Logical Methods in Computer Science, 9 (2): 1-39, 2013. www
- Operational semantics of a domain specific language for real time musician-computer interaction. In Discrete Event Dynamic Systems, 23 (4): 343-383, 2013. doi www
Articles de conférence
- A Synchronous Embedding of Antescofo, a Domain-Specific Language for Interactive Mixed Music. In EMSOFT 2013 - 13th International Conference on Embedded Software, Montreal, Canada, 2013. www
- Unranked Tree Rewriting and Effective Closures of Languages. In Meeting of the IFIP WG 1.6 on Term Rewriting, Eindhoven, Netherlands, 2013. www
- Rewrite Closure and CF Hedge Automata. In Lecture Notes in Computer Science, Springer, Bilbao, Spain, Lecture Notes in Computer Science , 2013. www
- From Authored to Produced Time in Computer-Musician Interactions. In CHI 2013 Workshop on Avec le Temps! Time, Tempo, and Turns in Human-Computer Interaction, ACM, Paris, France, 2013. www
- Formal Timing Analysis Of Mixed Music Scores. In 2013 ICMC - International Computer Music Conference, Perth, Australia, 2013. www
Divers
Rapports
- Formal Timing Analysis of Mixed Music Scores. Technical Report, , 2013.
2012
Articles de revue
- Antescofo `a l'avant-garde de l'informatique musicale. In Interstices, 2012. www
- Sufficient Completeness Verification for Conditional and Constrained Term Rewriting Systems. In Journal of Applied Logic, 10 (1): 127-143, 2012. doi www
Articles de conférence
- Correct Automatic Accompaniment Despite Machine Listening or Human Errors in Antescofo. In ICMC 2012 - International Computer Music Conference, Ljubljana, Slovenia, 2012. www
Non publié
- Rewrite Closure and CF Hedge Automata. , working paper or preprint. www
2011
Articles de revue
- Rigid Tree Automata and Applications. In Information and Computation, 209 (3): 486-512, 2011. doi www
Articles de conférence
- Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus. In Lecture Notes in Computer Science, pages 166-185, Springer, Saarbr"ucken, Germany, Lecture Notes in Computer Science 6993, 2011. doi www
- Controlled Term Rewriting. In Proceedings of the 8th International Symposium Frontiers of Combining Systems (FroCoS), pages 179-194, Springer, Saarbr"ucken, Germany, Proceedings of the 8th International Symposium Frontiers of Combining Systems (FroCoS) 6989, 2011. www
- Formalisation des relations temporelles dans un contexte d'accompagnement musical automatique. In 8e Colloque sur la Modélisation des Systèmes Réactifs (MSR'11), pages 109-124, Lille, France, 2011. www
- Formalisation des relations temporelles entre une partition et une performance musicale dans un contexte d'accompagnement automatique. In Modélisation des systèmes réactifs (MSR 11), pages 109-124, Lille, France, 2011. www
Thèses et habilitations
2010
Articles de conférence
- XML Access Control: from XACML to Annotated Schemas. In Second International Conference on Communications and Networking (ComNet), pages 1-8, IEEE Computer Society Press, Tozeur, Tunisia, 2010. doi www
- The Emptiness Problem for Tree Automata with Global Constraints. In 25th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 263-272, IEEE Computer Society Press, Edinburgh, Scotland, United Kingdom, 2010. doi www
- Rewrite-Based Verification of XML Updates. In 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming (PPDP), ACM, Hagenberg, Austria, 2010. doi www
2009
Articles de conférence
- Automatic Verification of Conformance of Firewall Configurations to Security Policies. In IEEE Symposium on Computers and Communications (ISCC), pages 526-531, IEEE Computer Society Press, Sousse, Tunisia, 2009. doi www
- Rigid Tree Automata. In Lecture Notes in Computer Science, pages 446-457, Springer, Tarragona, Spain, Lecture Notes in Computer Science 5457, 2009. doi www
- Unique Normalization for Shallow TRS. In Lecture Notes in Computer Science, pages 63-77, Springer, Brazilia, Brazil, Lecture Notes in Computer Science 5595, 2009. doi www
Rapports
- Rewrite based Verification of XML Updates. Technical Report RR-7007, INRIA, 2009.
2008
Articles de revue
- Tree automata with equality constraints modulo equational theories. In Journal of Logic and Algebraic Programming, 75 (2): 182-208, 2008. doi www
- Visibly Tree Automata with Memory and Constraints. In Logical Methods in Computer Science, 4 (2), 2008. doi www
Articles de conférence
- Closure of Hedge-Automata Languages by Hedge Rewriting. In Lecture Notes in Computer Science, pages 157-171, Springer Berlin / Heidelberg, Hagenberg, Austria, Lecture Notes in Computer Science 5117, 2008. doi www
- Automated Induction with Constrained Tree Automata. In Lecture Notes in Computer Science, pages 539-554, Springer, Sydney, Australia, Lecture Notes in Computer Science 5195, 2008. doi www
- Closure of Tree Automata Languages under Innermost Rewriting. In Electronic Notes in Theoretical Computer Science, pages 23-38, Elsevier, Hagenberg, Austria, Electronic Notes in Theoretical Computer Science 237, 2008. doi www
2007
Articles de conférence
- Tree Automata with Memory, Visibility and Structural Constraints. In Lecture Notes in Computer Science, pages 168-182, Springer, Braga, Portugal, Lecture Notes in Computer Science 4423, 2007. doi www
- Verifying Regular Trace Properties of Security Protocols with Explicit Destructors and Implicit Induction. In Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA), pages 27-44, Poland, Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA) , 2007. www
2006
Articles de revue
- Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks. In Journal of Automated Reasoning, 36 (1-2): 85-124, 2006. doi www
Articles de conférence
- Automating Sufficient Completeness Check for Conditional and Constrained TRS. In Proceedings of the 20th International Workshop on Unification (UNIF), Seattle, United States, Proceedings of the 20th International Workshop on Unification (UNIF) , 2006. www
- Security Protocol Verification with Implicit Induction and Explicit Destructors. In Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT), pages 37-44, Venice, Italy, Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT) , 2006. www
- The Confluence Problem for Flat TRSs. In Lecture Notes in Computer Science, pages 68-81, Springer, Beijing, China, Lecture Notes in Computer Science 4120, 2006. doi www
- Tree automata with equality constraints modulo equational theories. In Lecture Notes in Computer Science, pages 557-571, Springer, Seattle, United States, Lecture Notes in Computer Science 4130, 2006. doi www
Rapports
- Automatic Verification of Sufficient Completeness for Conditional Constrained Term Rewriting Systems. Technical Report RR-5863, INRIA, 2006.
2005
Chapitres d'ouvrage
- An Analysis of a Public-Key Protocol with Membranes. In Applications of Membrane Computing, pages 283-302, Springer Verlag, Natural Computing Series , 2005. doi www
Rapports
- Tree Automata with Equality Constraints Modulo Equational Theories. Technical Report RR-5754, INRIA, 2005.
2004
Articles de conférence
- A Decision Procedure for the Verification of Security Protocols with Explicit Destructors. In Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS), pages 278-287, ACM Press, Washington D.C., United States, Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS) , 2004. www
- A Theory of Dictionary Attacks and its Complexity. In Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW), pages 2-15, IEEE Computer Society Press, Asilomar, Pacific Grove, United States, Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW) , 2004. www
2003
Articles de revue
- Reachability and confluence are undecidable for flat term rewriting systems. In Information Processing Letters, 87 (5): 265-270, 2003. www
- Ground Reducibility is EXPTIME-complete. In Information and Computation, 187 (1): 123-153, 2003. www
2000
Articles de revue
- Rigid reachability, the non-symmetric form of rigid E-unification. In International Journal of Foundations of Computer Science, 11 (1): 3-27, 2000. www
Articles de conférence
- Compiling and Verifying Security Protocols. In International Conference on Logic Programming & Automated Reasoning - LPAR'2000, pages 131-160, Springer-Verlag, Reunion Island, France, Lecture Notes in Computer Science 1955, 2000. www
Rapports
- Compiling and Verifying Security Protocols. Technical Report RR-3938, INRIA, 2000.
1999
Articles de conférence
- Compiling and narrowing cryptographic protocols. In Workshop on Verification and Modelling, pages 1 p, Besanc con, France, 1999. www
- Decidable fragments of simultaneous rigid reachability. In International Colloquium on Automata, Languages, & Programming - ICALP'99, pages 250-260, Springer-Verlag, Prague, Czech Republic, Lecture notes in computer science 1644, 1999. www
Rapports
- Ground Reducibility is EXPTIME-complete. Technical Report RR-3800, INRIA, 1999.
1998
Rapports
- Unification in Extensions of Shallow Equational Theories. Technical Report 98-R-387 || jacquemard98a, , 1998.
- Rigid Reachability. Technical Report 98-R-388 || ganzinger98a, , 1998.