![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Florent Jacquemard
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
- [b1]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). École normale supérieure de Cachan, France, 2011
Journal Articles
- 2022
- [j14]Mathieu Giraud
, Florent Jacquemard:
Weighted automata computation of edit distances with consolidations and fragmentations. Inf. Comput. 282: 104652 (2022) - 2019
- [j13]Florent Jacquemard, Michaël Rusinowitch:
One-variable context-free hedge automata. J. Comput. Syst. Sci. 104: 278-296 (2019) - 2016
- [j12]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) - [j11]Clément Poncelet Sanchez, Florent Jacquemard:
Model-based testing for building reliable realtime interactive music systems. Sci. Comput. Program. 132: 143-172 (2016) - 2013
- [j10]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) - [j9]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): 343-383 (2013) - 2012
- [j8]Adel Bouhoula, Florent Jacquemard:
Sufficient completeness verification for conditional and constrained TRS. J. Appl. Log. 10(1): 127-143 (2012) - 2011
- [j7]Florent Jacquemard, Francis Klay, Camille Vacher
:
Rigid tree automata and applications. Inf. Comput. 209(3): 486-512 (2011) - 2008
- [j6]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Tree automata with equality constraints modulo equational theories. J. Log. Algebraic Methods Program. 75(2): 182-208 (2008) - [j5]Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Visibly Tree Automata with Memory and Constraints. Log. Methods Comput. Sci. 4(2) (2008) - 2006
- [j4]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): 85-124 (2006) - 2003
- [j3]Hubert Comon, Florent Jacquemard:
Ground reducibility is EXPTIME-complete. Inf. Comput. 187(1): 123-153 (2003) - [j2]Florent Jacquemard:
Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett. 87(5): 265-270 (2003) - 2000
- [j1]Harald Ganzinger, Florent Jacquemard, Margus Veanes:
Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification. Int. J. Found. Comput. Sci. 11(1): 3-27 (2000)
Conference and Workshop Papers
- 2022
- [c36]Florent Jacquemard, Lydia Rodriguez de la Nava:
Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription. CIAA 2022: 67-79 - 2020
- [c35]Francesco Foscarin, Andrew McLeod, Philippe Rigaux, Florent Jacquemard, Masahiko Sakai:
ASAP: a dataset of aligned scores and performances for piano transcription. ISMIR 2020: 534-541 - 2019
- [c34]Francesco Foscarin, Florent Jacquemard, Raphaël Fournier-S'niehotta:
A diff procedure for music score files. DLfM 2019: 58-64 - [c33]Francesco Foscarin
, Florent Jacquemard, Philippe Rigaux, Masahiko Sakai
:
A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring. MCM 2019: 248-260 - 2016
- [c32]Adrien Ycart, Florent Jacquemard, Jean Bresson, Slawek Staworko:
A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration. ICMC 2016 - 2015
- [c31]Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
:
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies. CADE 2015: 137-151 - [c30]Florent Jacquemard, Pierre Donat-Bouillud, Jean Bresson:
A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting. MCM 2015: 3-15 - [c29]Clément Poncelet Sanchez, Florent Jacquemard:
Model based testing of an interactive music system. SAC 2015: 1759-1764 - 2014
- [c28]Clément Poncelet Sanchez, Florent Jacquemard:
Test Methods for Score-Based Interactive Music Systems. ICMC 2014 - 2013
- [c27]Guillaume Baudart, Florent Jacquemard, Louis Mandel, Marc Pouzet:
A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music. EMSOFT 2013: 1:1-1:12 - [c26]Léa Fanchon, Florent Jacquemard:
Formal Timing Analysis of mixed Music Scores. ICMC 2013 - [c25]Florent Jacquemard, Michaël Rusinowitch:
Rewrite Closure and CF Hedge Automata. LATA 2013: 371-382 - 2012
- [c24]Arshia Cont, José Echeveste, Jean-Louis Giavitto, Florent Jacquemard:
Correct Automatic Accompaniment Despite Machine listening or Human errors in Antescofo. ICMC 2012 - 2011
- [c23]Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
:
Controlled Term Rewriting. FroCoS 2011: 179-194 - [c22]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: 166-185 - 2010
- [c21]Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
:
The Emptiness Problem for Tree Automata with Global Constraints. LICS 2010: 263-272 - [c20]Florent Jacquemard, Michaël Rusinowitch:
Rewrite-based verification of XML updates. PPDP 2010: 119-130 - 2009
- [c19]Nihel Ben Youssef, Adel Bouhoula, Florent Jacquemard:
Automatic verification of conformance of firewall configurations to security policies. ISCC 2009: 526-531 - [c18]Florent Jacquemard, Francis Klay, Camille Vacher
:
Rigid Tree Automata. LATA 2009: 446-457 - [c17]Guillem Godoy, Florent Jacquemard:
Unique Normalization for Shallow TRS. RTA 2009: 63-77 - 2008
- [c16]Adel Bouhoula, Florent Jacquemard:
Automated Induction with Constrained Tree Automata. IJCAR 2008: 539-554 - [c15]Florent Jacquemard, Michaël Rusinowitch:
Closure of Hedge-Automata Languages by Hedge Rewriting. RTA 2008: 157-171 - [c14]Adrià Gascón, Guillem Godoy, Florent Jacquemard:
Closure of Tree Automata Languages under Innermost Rewriting. WRS@RTA 2008: 23-38 - 2007
- [c13]Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Tree Automata with Memory, Visibility and Structural Constraints. FoSSaCS 2007: 168-182 - 2006
- [c12]Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard:
The Confluence Problem for Flat TRSs. AISC 2006: 68-81 - [c11]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Tree Automata with Equality Constraints Modulo Equational Theories. IJCAR 2006: 557-571 - 2004
- [c10]Stéphanie Delaune, Florent Jacquemard:
A decision procedure for the verification of security protocols with explicit destructors. CCS 2004: 278-287 - [c9]Stéphanie Delaune, Florent Jacquemard:
A Theory of Dictionary Attacks and its Complexity. CSFW 2004: 2-15 - 2000
- [c8]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Compiling and Verifying Security Protocols. LPAR 2000: 131-160 - 1999
- [c7]Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes:
Decidable Fragments of Simultaneous Rigid Reachability. ICALP 1999: 250-260 - 1998
- [c6]Harald Ganzinger, Florent Jacquemard, Margus Veanes:
Rigid Reachability. ASIAN 1998: 4-21 - [c5]Florent Jacquemard, Christoph Meyer, Christoph Weidenbach:
Unification in Extension of Shallow Equational Theories. RTA 1998: 76-90 - 1997
- [c4]Hubert Comon, Florent Jacquemard:
Ground Reducibility is EXPTIME-Complete. LICS 1997: 26-34 - 1996
- [c3]Florent Jacquemard:
Decidable Approximations of Term Rewriting Systems. RTA 1996: 362-376 - 1994
- [c2]Anne-Cécile Caron
, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard:
Pumping, Cleaning and Symbolic Constraints Solving. ICALP 1994: 436-449 - [c1]Hubert Comon, Florent Jacquemard:
Ground Reducibility and Automata with Disequality Constraints. STACS 1994: 151-162
Parts in Books or Collections
- 2006
- [p1]Olivier Michel, Florent Jacquemard:
An Analysis of a Public Key Protocol with Membranes. Applications of Membrane Computing 2006: 283-302
Informal and Other Publications
- 2024
- [i7]Augustin Bouquillard, Florent Jacquemard:
Engraving Oriented Joint Estimation of Pitch Spelling and Local and Global Keys. CoRR abs/2402.10247 (2024) - 2023
- [i6]Emmanouil Karystinaios, Francesco Foscarin, Florent Jacquemard, Masahiko Sakai, Satoshi Tojo, Gerhard Widmer:
8+8=4: Formalizing Time Units to Handle Symbolic Music Durations. CoRR abs/2310.14952 (2023) - 2014
- [i5]Florent Jacquemard, Clément Poncelet Sanchez:
Antescofo Intermediate Representation. CoRR abs/1404.7335 (2014) - 2012
- [i4]Florent Jacquemard, Michaël Rusinowitch:
Rewrite Closure and CF Hedge Automata. CoRR abs/1212.5108 (2012) - 2009
- [i3]Florent Jacquemard, Michaël Rusinowitch:
Rewrite based Verification of XML Updates. CoRR abs/0907.5125 (2009) - 2008
- [i2]Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Visibly Tree Automata with Memory and Constraints. CoRR abs/0804.3065 (2008) - [i1]Adel Bouhoula, Florent Jacquemard:
Automated Induction for Complex Data Structures. CoRR abs/0811.4720 (2008)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint