Florent Jacquemard

According to our database, Florent Jacquemard authored at least 54 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Engraving Oriented Joint Estimation of Pitch Spelling and Local and Global Keys.

Augustin Bouquillard, Florent Jacquemard

CoRR, 2024

2023

8+8=4: Formalizing Time Units to Handle Symbolic Music Durations.

Emmanouil Karystinaios, Francesco Foscarin, Florent Jacquemard, Masahiko Sakai, Satoshi Tojo, Gerhard Widmer

CoRR, 2023

2022

Weighted automata computation of edit distances with consolidations and fragmentations.

Mathieu Giraud, Florent Jacquemard

Inf. Comput., 2022

Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription.

Florent Jacquemard, Lydia Rodriguez de la Nava

Proceedings of the Implementation and Application of Automata, 2022

2020

ASAP: a dataset of aligned scores and performances for piano transcription.

Francesco Foscarin, Andrew McLeod, Philippe Rigaux, Florent Jacquemard, Masahiko Sakai

Proceedings of the 21th International Society for Music Information Retrieval Conference, 2020

2019

One-variable context-free hedge automata.

Florent Jacquemard, Michaël Rusinowitch

J. Comput. Syst. Sci., 2019

A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring.

Francesco Foscarin, Florent Jacquemard, Philippe Rigaux, Masahiko Sakai

Proceedings of the Mathematics and Computation in Music - 7th International Conference, 2019

A diff procedure for music score files.

Francesco Foscarin, Florent Jacquemard, Raphaël Fournier-S'niehotta

Proceedings of the 6th International Conference on Digital Libraries for Musicology, 2019

2016

Model-based testing for building reliable realtime interactive music systems.

Clément Poncelet Sanchez, Florent Jacquemard

Sci. Comput. Program., 2016

FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems.

Florent Jacquemard, Luc Segoufin, Jerémie Dimino

Log. Methods Comput. Sci., 2016

A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration.

Adrien Ycart, Florent Jacquemard, Jean Bresson, Slawek Staworko

Proceedings of the 2016 International Computer Music Conference, 2016

2015

Model based testing of an interactive music system.

Clément Poncelet Sanchez, Florent Jacquemard

Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting.

Florent Jacquemard, Pierre Donat-Bouillud, Jean Bresson

Proceedings of the Mathematics and Computation in Music - 5th International Conference, 2015

Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies.

Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Antescofo Intermediate Representation.

Florent Jacquemard, Clément Poncelet Sanchez

CoRR, 2014

Test Methods for Score-Based Interactive Music Systems.

Clément Poncelet Sanchez, Florent Jacquemard

Proceedings of the Music Technology meets Philosophy, 2014

2013

Operational semantics of a domain specific language for real time musician-computer interaction.

José Echeveste, Arshia Cont, Jean-Louis Giavitto, Florent Jacquemard

Discret. Event Dyn. Syst., 2013

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher

Log. Methods Comput. Sci., 2013

Rewrite Closure and CF Hedge Automata.

Florent Jacquemard, Michaël Rusinowitch

Proceedings of the Language and Automata Theory and Applications, 2013

Formal Timing Analysis of mixed Music Scores.

Léa Fanchon, Florent Jacquemard

Proceedings of the 39th International Computer Music Conference, 2013

A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music.

Guillaume Baudart, Florent Jacquemard, Louis Mandel, Marc Pouzet

Proceedings of the International Conference on Embedded Software, 2013

2012

Sufficient completeness verification for conditional and constrained TRS.

Adel Bouhoula, Florent Jacquemard

J. Appl. Log., 2012

Correct Automatic Accompaniment Despite Machine listening or Human errors in Antescofo.

Arshia Cont, José Echeveste, Jean-Louis Giavitto, Florent Jacquemard

Proceedings of the Non-Cochlear Sound: Proceedings of the 38th International Computer Music Conference, 2012

2011

Rigid tree automata and applications.

Florent Jacquemard, Francis Klay, Camille Vacher

Inf. Comput., 2011

Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus.

Florent Jacquemard, Étienne Lozes, Ralf Treinen, Jules Villard

Proceedings of the Theory of Security and Applications - Joint Workshop, 2011

Controlled Term Rewriting.

Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai

Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

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).

Florent Jacquemard

, 2011

2010

Rewrite-based verification of XML updates.

Florent Jacquemard, Michaël Rusinowitch

Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

The Emptiness Problem for Tree Automata with Global Constraints.

Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Unique Normalization for Shallow TRS.

Guillem Godoy, Florent Jacquemard

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Rigid Tree Automata.

Florent Jacquemard, Francis Klay, Camille Vacher

Proceedings of the Language and Automata Theory and Applications, 2009

Automatic verification of conformance of firewall configurations to security policies.

Nihel Ben Youssef, Adel Bouhoula, Florent Jacquemard

Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

2008

Visibly Tree Automata with Memory and Constraints.

Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin

Log. Methods Comput. Sci., 2008

Tree automata with equality constraints modulo equational theories.

Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron

J. Log. Algebraic Methods Program., 2008

Closure of Tree Automata Languages under Innermost Rewriting.

Adrià Gascón, Guillem Godoy, Florent Jacquemard

Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

Automated Induction for Complex Data Structures

Adel Bouhoula, Florent Jacquemard

CoRR, 2008

Closure of Hedge-Automata Languages by Hedge Rewriting.

Florent Jacquemard, Michaël Rusinowitch

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Automated Induction with Constrained Tree Automata.

Adel Bouhoula, Florent Jacquemard

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

Tree Automata with Memory, Visibility and Structural Constraints.

Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin

Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006

Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks.

Stéphanie Delaune, Florent Jacquemard

J. Autom. Reason., 2006

An Analysis of a Public Key Protocol with Membranes.

Olivier Michel, Florent Jacquemard

Proceedings of the Applications of Membrane Computing, 2006

The Confluence Problem for Flat TRSs.

Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard

Proceedings of the Artificial Intelligence and Symbolic Computation, 2006

2004

A Theory of Dictionary Attacks and its Complexity.

Stéphanie Delaune, Florent Jacquemard

Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

A decision procedure for the verification of security protocols with explicit destructors.

Stéphanie Delaune, Florent Jacquemard

Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004

2003

Reachability and confluence are undecidable for flat term rewriting systems.

Florent Jacquemard

Inf. Process. Lett., 2003

Ground reducibility is EXPTIME-complete.

Hubert Comon, Florent Jacquemard

Inf. Comput., 2003

2000

Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification.

Harald Ganzinger, Florent Jacquemard, Margus Veanes

Int. J. Found. Comput. Sci., 2000

Compiling and Verifying Security Protocols.

Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron

Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999

Decidable Fragments of Simultaneous Rigid Reachability.

Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes

Proceedings of the Automata, 1999

1998

Unification in Extension of Shallow Equational Theories.

Florent Jacquemard, Christoph Meyer, Christoph Weidenbach

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Rigid Reachability.

Harald Ganzinger, Florent Jacquemard, Margus Veanes

Proceedings of the Advances in Computing Science, 1998

1996

Decidable Approximations of Term Rewriting Systems.

Florent Jacquemard

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

1994

Ground Reducibility and Automata with Disequality Constraints.

Hubert Comon, Florent Jacquemard

Proceedings of the STACS 94, 1994

Pumping, Cleaning and Symbolic Constraints Solving.

Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994