Florent Jacquemard

61 papers A* 5A 4B 2C 5Misc 3Journal 22Unranked 18
YearRankTypeTitle / Venue / Authors
2025 J jnl
Detecting Notational Errors in Digital Music Scores.
CoRR
Léo Géré, Nicolas Audebert, Florent Jacquemard
2024 J jnl
Engraving Oriented Joint Estimation of Pitch Spelling and Local and Global Keys.
CoRR
Augustin Bouquillard, Florent Jacquemard
2023 — conf
8 + 8 = 4: Formalizing Time Units to Handle Symbolic Music Durations.
CMMR
Emmanouil Karystinaios, Francesco Foscarin, Florent Jacquemard, Masahiko Sakai, Satoshi Tojo, Gerhard Widmer
2023 J jnl
8+8=4: Formalizing Time Units to Handle Symbolic Music Durations.
CoRR
Emmanouil Karystinaios, Francesco Foscarin, Florent Jacquemard, Masahiko Sakai, Satoshi Tojo, Gerhard Widmer
2022 C conf
Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription.
CIAA
Florent Jacquemard, Lydia Rodriguez de la Nava
2022 J jnl
Weighted automata computation of edit distances with consolidations and fragmentations.
Inf. Comput.
Mathieu Giraud, Florent Jacquemard
2020 — conf
ASAP: a dataset of aligned scores and performances for piano transcription.
ISMIR
Francesco Foscarin, Andrew McLeod, Philippe Rigaux, Florent Jacquemard, Masahiko Sakai
2019 — conf
A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring.
MCM
Francesco Foscarin, Florent Jacquemard, Philippe Rigaux, Masahiko Sakai
2019 — conf
A diff procedure for music score files.
DLfM
Francesco Foscarin, Florent Jacquemard, Raphaël Fournier-S'niehotta
2019 J jnl
One-variable context-free hedge automata.
J. Comput. Syst. Sci.
Florent Jacquemard, Michaël Rusinowitch
2016 — conf
A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration.
ICMC
Adrien Ycart, Florent Jacquemard, Jean Bresson, Slawek Staworko
2016 J jnl
FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems.
Log. Methods Comput. Sci.
Florent Jacquemard, Luc Segoufin, Jerémie Dimino
2016 J jnl
Model-based testing for building reliable realtime interactive music systems.
Sci. Comput. Program.
Clément Poncelet Sanchez, Florent Jacquemard
2015 — conf
A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting.
MCM
Florent Jacquemard, Pierre Donat-Bouillud, Jean Bresson
2015 Misc conf
Model based testing of an interactive music system.
SAC
Clément Poncelet Sanchez, Florent Jacquemard
2015 A conf
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies.
CADE
Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
2014 J jnl
Antescofo Intermediate Representation.
CoRR
Florent Jacquemard, Clément Poncelet Sanchez
2014 — conf
Test Methods for Score-Based Interactive Music Systems.
ICMC
Clément Poncelet Sanchez, Florent Jacquemard
2013 Misc conf
A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music.
EMSOFT
Guillaume Baudart, Florent Jacquemard, Louis Mandel, Marc Pouzet
2013 J jnl
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Log. Methods Comput. Sci.
Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
2013 — conf
Formal Timing Analysis of mixed Music Scores.
ICMC
Léa Fanchon, Florent Jacquemard
2013 J jnl
Operational semantics of a domain specific language for real time musician-computer interaction.
Discret. Event Dyn. Syst.
José Echeveste, Arshia Cont, Jean-Louis Giavitto, Florent Jacquemard
2013 C conf
Rewrite Closure and CF Hedge Automata.
LATA
Florent Jacquemard, Michaël Rusinowitch
2012 — conf
Correct Automatic Accompaniment Despite Machine listening or Human errors in Antescofo.
ICMC
Arshia Cont, José Echeveste, Jean-Louis Giavitto, Florent Jacquemard
2012 J jnl
Rewrite Closure and CF Hedge Automata
CoRR
Florent Jacquemard, Michaël Rusinowitch
2012 J jnl
Sufficient completeness verification for conditional and constrained TRS.
J. Appl. Log.
Adel Bouhoula, Florent Jacquemard
2011 — conf
Controlled Term Rewriting.
FroCoS
Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
2011 — book
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 — conf
Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus.
TOSCA
Florent Jacquemard, Étienne Lozes, Ralf Treinen, Jules Villard
2011 J jnl
Rigid tree automata and applications.
Inf. Comput.
Florent Jacquemard, Francis Klay, Camille Vacher
2010 C conf
Rewrite-based verification of XML updates.
PPDP
Florent Jacquemard, Michaël Rusinowitch
2010 A* conf
The Emptiness Problem for Tree Automata with Global Constraints.
LICS
Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
2009 C conf
Automatic verification of conformance of firewall configurations to security policies.
ISCC
Nihel Ben Youssef, Adel Bouhoula, Florent Jacquemard
2009 J jnl
Rewrite based Verification of XML Updates
CoRR
Florent Jacquemard, Michaël Rusinowitch
2009 C conf
Rigid Tree Automata.
LATA
Florent Jacquemard, Francis Klay, Camille Vacher
2009 — conf
Unique Normalization for Shallow TRS.
RTA
Guillem Godoy, Florent Jacquemard
2008 J jnl
Automated Induction for Complex Data Structures
CoRR
Adel Bouhoula, Florent Jacquemard
2008 A conf
Automated Induction with Constrained Tree Automata.
IJCAR
Adel Bouhoula, Florent Jacquemard
2008 — conf
Closure of Hedge-Automata Languages by Hedge Rewriting.
RTA
Florent Jacquemard, Michaël Rusinowitch
2008 — conf
Closure of Tree Automata Languages under Innermost Rewriting.
WRS@RTA
Adrià Gascón, Guillem Godoy, Florent Jacquemard
2008 J jnl
Tree automata with equality constraints modulo equational theories.
J. Log. Algebraic Methods Program.
Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
2008 J jnl
Visibly Tree Automata with Memory and Constraints
CoRR
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
2008 J jnl
Visibly Tree Automata with Memory and Constraints.
Log. Methods Comput. Sci.
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
2007 B conf
Tree Automata with Memory, Visibility and Structural Constraints.
FoSSaCS
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
2006 — ch.
An Analysis of a Public Key Protocol with Membranes.
Applications of Membrane Computing
Olivier Michel, Florent Jacquemard
2006 J jnl
Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks.
J. Autom. Reason.
Stéphanie Delaune, Florent Jacquemard
2006 Misc conf
The Confluence Problem for Flat TRSs.
AISC
Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard
2006 A conf
Tree Automata with Equality Constraints Modulo Equational Theories.
IJCAR
Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
2004 — conf
A Theory of Dictionary Attacks and its Complexity.
CSFW
Stéphanie Delaune, Florent Jacquemard
2004 A* conf
A decision procedure for the verification of security protocols with explicit destructors.
CCS
Stéphanie Delaune, Florent Jacquemard
2003 J jnl
Ground reducibility is EXPTIME-complete.
Inf. Comput.
Hubert Comon, Florent Jacquemard
2003 J jnl
Reachability and confluence are undecidable for flat term rewriting systems.
Inf. Process. Lett.
Florent Jacquemard
2000 B conf
Compiling and Verifying Security Protocols.
LPAR
Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
2000 J jnl
Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification.
Int. J. Found. Comput. Sci.
Harald Ganzinger, Florent Jacquemard, Margus Veanes
1999 A* conf
Decidable Fragments of Simultaneous Rigid Reachability.
ICALP
Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes
1998 — conf
Rigid Reachability.
ASIAN
Harald Ganzinger, Florent Jacquemard, Margus Veanes
1998 — conf
Unification in Extension of Shallow Equational Theories.
RTA
Florent Jacquemard, Christoph Meyer, Christoph Weidenbach
1997 A* conf
Ground Reducibility is EXPTIME-Complete.
LICS
Hubert Comon, Florent Jacquemard
1996 — conf
Decidable Approximations of Term Rewriting Systems.
RTA
Florent Jacquemard
1994 A conf
Ground Reducibility and Automata with Disequality Constraints.
STACS
Hubert Comon, Florent Jacquemard
1994 A* conf
Pumping, Cleaning and Symbolic Constraints Solving.
ICALP
Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard