Florent Jacquemard

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 11

Top Topics

Joint Estimation

Top Venues

J. Comput. Syst. Sci.

Publications

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