Nombre de documents

75


Article dans une revue15 documents

Communication dans un congrès42 documents

  • Florent Jacquemard, Adrien Ycart. Interactive Music Transcription based on Rhythm Tree Languages. 16th Rhythm Production and Perception Workshop, Jul 2017, Birmingham, United Kingdom. 〈http://dmtlab.bcu.ac.uk/rppw2017/〉. 〈hal-01472646〉
  • Florent Jacquemard, Adrien Ycart, Masahiko Sakai. Generating equivalent rhythmic notations based on rhythm tree languages. Third International Conference on Technologies for Music Notation and Representation (TENOR), May 2017, Coroña, Spain. 2017, 〈http://www.udc.es/grupos/ln/tenor2017〉. 〈hal-01403982〉
  • Florent Jacquemard. Some results on confluence: decision and what to do without. 5th International Workshop on Confluence, Sep 2016, Obergurgl, Austria. 2016, Proceedings of the 5th International Workshop on Confluence. 〈hal-01367535〉
  • Adrien Ycart, Jean Bresson, Florent Jacquemard, Sławek Staworko. Une approche interactive pour la transcription rythmique dans OpenMusic. Journées d'Informatique Musicale 2016, Mar 2016, Albi, France. Journées d'Informatique Musicale 2016, 2016, Journées d'Informatique Musicale 2016. 〈hal-01298806〉
  • Adrien Ycart, Florent Jacquemard, Jean Bresson, Slawomir Staworko. A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration. International Computer Music Conference (ICMC), Sep 2016, Utrecht, Netherlands. 2016, Proceedings of the 42nd International Computer Music Conference (ICMC). 〈http://www.icmc2016.com〉. 〈hal-01315689v2〉
  • Jean Bresson, Dimitri Bouche, Jérémie Garcia, Thibaut Carpentier, Florent Jacquemard, et al.. Projet EFFICACE : Développements et perspectives en composition assistée par ordinateur. Journées d'Informatique Musicale, 2015, Montréal, Canada. 2015. 〈hal-01142022〉
  • Pierre Donat-Bouillud, Florent Jacquemard, Masahiko Sakai. Towards an Equational Theory of Rhythm Notation. Music Encoding Conference 2015, May 2015, Florence, Italy. 2015, 〈http://music-encoding.org/conference〉. 〈hal-01105418〉
  • Clément Poncelet, Florent Jacquemard. Model Based Testing of an Interactive Music System. Proceedings of the 30th ACM/SIGAPP Symposium On Applied Computing (ACM SAC), Apr 2015, Salamanca, Spain. ACM, 2015, 〈10.1145/2695664.2695804〉. 〈hal-01097345v2〉
  • Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai. Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies. Amy P. Felty and Aart Middeldorp. 25th International Conference on Automated Deduction (CADE’15), Aug 2015, Berlin, Germany. Springer, LNCS. 〈hal-01149319v2〉
  • Florent Jacquemard, Pierre Donat-Bouillud, Jean Bresson. A Structural Theory of Rhythm Notation based on Tree Representations and Term Rewriting. Tom Collins, David Meredith and Anja Volk. Mathematics and Computation in Music: 5th International Conference, MCM 2015, Jun 2015, London, United Kingdom. Springer, 9110, pp.12, 2015, Lecture Notes in Artificial Intelligence. 〈http://mcm2015.qmul.ac.uk〉. 〈hal-01138642〉
  • Clément Poncelet Sanchez, Florent Jacquemard. Test Methods for Score-Based Interactive Music Systems. ICMC SMC 2014, Sep 2014, Athen, Greece. 2014. 〈hal-01021617〉
  • Florent Jacquemard, Jean Bresson, Pierre Donat-Bouillud. Rhythm Tree Rewriting. Meeting of the IFIP WG 1.6 on Term Rewriting, Vienna Summer of Logic, Jul 2014, Vienna, Austria. 2014. 〈hal-01109666〉
  • Léa Fanchon, Florent Jacquemard. Formal Timing Analysis Of Mixed Music Scores. 2013 ICMC - International Computer Music Conference, Aug 2013, Perth, Australia. 2013. 〈hal-00829821v2〉
  • Arshia Cont, Jean-Louis Giavitto, Florent Jacquemard. From Authored to Produced Time in Computer-Musician Interactions. CHI 2013 Workshop on Avec le Temps! Time, Tempo, and Turns in Human-Computer Interaction, Apr 2013, Paris, France. ACM, 2013. 〈hal-00787033〉
  • Guillaume Baudart, Louis Mandel, Florent Jacquemard, Marc Pouzet. A Synchronous Embedding of Antescofo, a Domain-Specific Language for Interactive Mixed Music. EMSOFT 2013 - 13th International Conference on Embedded Software, Sep 2013, Montreal, Canada. 2013. 〈hal-00850299〉
  • Florent Jacquemard, Michaël Rusinowitch. Unranked Tree Rewriting and Effective Closures of Languages. Meeting of the IFIP WG 1.6 on Term Rewriting, Jun 2013, Eindhoven, Netherlands. 2013. 〈hal-00852379〉
  • Florent Jacquemard, Michael Rusinowitch. Rewrite Closure and CF Hedge Automata. 7th International Conference on Language and Automata Theory and Application, Apr 2013, Bilbao, Spain. Springer, 2013, Lecture Notes in Computer Science. 〈hal-00767719〉
  • Arshia Cont, José Echeveste, Jean-Louis Giavitto, Florent Jacquemard. Correct Automatic Accompaniment Despite Machine Listening or Human Errors in Antescofo. ICMC 2012 - International Computer Music Conference, Sep 2012, Ljubljana, Slovenia. 2012. 〈hal-00718854〉
  • José Echeveste, Arshia Cont, Florent Jacquemard, Jean-Louis Giavitto. Formalisation des relations temporelles entre une partition et une performance musicale dans un contexte d’accompagnement automatique : Accompagnement musical automatique. Modélisation des systèmes réactifs (MSR 11), Nov 2011, Lille, France. pp.109-124, 2011. 〈hal-01156639〉
  • Florent Jacquemard, Etienne Lozes, Ralf Treinen, Jules Villard. Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus. Mdersheim, Sebastian and Palamidessi, Catuscia. Theory of Security and Applications (TOSCA, joint workshop affiliated to ETAPS), Mar 2011, Saarbrücken, Germany. Springer, 6993, pp.166-185, 2011, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/h77512586g626833/〉. 〈10.1007/978-3-642-27375-9〉. 〈inria-00578896〉
  • Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai. Controlled Term Rewriting. C. Tinelli and V. Sofronie-Stokkermans. 8th International Symposium Frontiers of Combining Systems (FroCoS 2011), Oct 2011, Saarbrücken, Germany. Springer, 6989, pp.179-194, 2011, Lecture Notes in Artificial Intelligence. 〈hal-00643160〉
  • José Echeveste, Arshia Cont, Jean-Louis Giavitto, Florent Jacquemard. Formalisation des relations temporelles dans un contexte d'accompagnement musical automatique. Hermès. 8e Colloque sur la Modélisation des Systèmes Réactifs (MSR'11), Nov 2011, Lille, France. 45, pp.109-124, 2011. 〈hal-00642921〉
  • Luis Barguñó, Carlos Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher. The Emptiness Problem for Tree Automata with Global Constraints. Jouannaud, Jean-Pierre. 25th Annual IEEE Symposium on Logic in Computer Science (LICS), Jul 2010, Edinburgh, Scotland, United Kingdom. IEEE Computer Society Press, pp.263-272, 2010, 〈http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5571714〉. 〈10.1109/LICS.2010.28〉. 〈inria-00578901〉
  • Ryma Abassi, Florent Jacquemard, Michael Rusinowitch, Sihem Guemara El Fatmi. XML Access Control: from XACML to Annotated Schemas. Second International Conference on Communications and Networking (ComNet), Nov 2010, Tozeur, Tunisia. IEEE Computer Society Press, pp.1-8, 2010, 〈http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5699810〉. 〈10.1109/COMNET.2010.5699810〉. 〈inria-00578884〉
  • Florent Jacquemard, Michael Rusinowitch. Rewrite-Based Verification of XML Updates. Kutsia, Temur and Schreiner, Wolfgang and Fernández, Maribel. 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming (PPDP), Jul 2010, Hagenberg, Austria. ACM, 2010, 〈http://portal.acm.org/citation.cfm?doid=1836089.1836105〉. 〈10.1145/1836089.1836105〉. 〈inria-00578916〉
  • Florent Jacquemard, Francis Klay, Camille Vacher. Rigid Tree Automata. Adrian Horia Dediu and Armand Mihai Ionescu and Carlos Martín-Vide. Third International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. Springer, 5457, pp.446-457, 2009, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/m381707kkqh12401/〉. 〈10.1007/978-3-642-00982-2_38〉. 〈inria-00579001〉
  • Guillem Godoy, Florent Jacquemard. Unique Normalization for Shallow TRS. Treinen, Ralf. 20th International Conference on Rewriting Techniques and Applications (RTA), Jun 2009, Brazilia, Brazil. Springer, 5595, pp.63-77, 2009, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/21x87318813m43x3/〉. 〈10.1007/978-3-642-02348-4_5〉. 〈inria-00578959〉
  • Nihel Ben Youssef, Adel Bouhoula, Florent Jacquemard. Automatic Verification of Conformance of Firewall Configurations to Security Policies. IEEE Symposium on Computers and Communications (ISCC), Jul 2009, Sousse, Tunisia. IEEE Computer Society Press, pp.526-531, 2009, 〈http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5202309〉. 〈10.1109/ISCC.2009.5202309〉. 〈inria-00578926〉
  • Florent Jacquemard, Michael Rusinowitch. Closure of Hedge-Automata Languages by Hedge Rewriting. A. Voronkov. 19th International Conference on Rewriting Techniques and Applications - RTA 2008, 2008, Hagenberg, Austria. Springer Berlin / Heidelberg, 5117, pp.157-171, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-70590-1_11〉. 〈inria-00329803〉
  • Adria Gascon, Guillem Godoy, Florent Jacquemard. Closure of Tree Automata Languages under Innermost Rewriting. Middeldorp, Aart. 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS), Jul 2008, Hagenberg, Austria. Elsevier, 237, pp.23-38, 2008, Electronic Notes in Theoretical Computer Science. 〈http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-4VXW9BM-3&_user=10&_coverDate=04%2F04%2F2009&_rdoc=1&_fmt=high&_orig=gateway&_origin=gateway&_sort=d&_docanchor=&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=976e2294a5625d24b1268e55f91e14e7&searchtype=a〉. 〈10.1016/j.entcs.2009.03.033〉. 〈inria-00578966〉
  • Adel Bouhoula, Florent Jacquemard. Automated Induction with Constrained Tree Automata. Alessandro Armando and Peter Baumgartner and Gilles Dowek. 4th International Joint Conference on Automated Reasoning (IJCAR), Aug 2008, Sydney, Australia. Springer, 5195, pp.539-554, 2008, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/2t58870130542x16/〉. 〈10.1007/978-3-540-71070-7_44〉. 〈inria-00579004〉
  • Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin. Tree Automata with Memory, Visibility and Structural Constraints. Helmut Seidl. 10th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), Mar 2007, Braga, Portugal. Springer, 4423, pp.168-182, 2007, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/r7720vqm51248648/〉. 〈10.1007/978-3-540-71389-0_13〉. 〈inria-00579009〉
  • Adel Bouhoula, Florent Jacquemard. Verifying Regular Trace Properties of Security Protocols with Explicit Destructors and Implicit Induction. Degano, Pierpaolo and Ksters, Ralf and Vigan, Luca and Zdancewic, Steve. Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA), Jul 2007, Poland. pp.27-44, 2007, Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA). 〈inria-00579015〉
  • Florent Jacquemard, Michael Rusinowitch, Laurent Vigneron. Tree automata with equality constraints modulo equational theories. Ulrich Furbach and Natarajan Shankar. 3d International Joint Conference on Automated Reasoning (IJCAR), Aug 2006, Seattle, United States. Springer, 4130, pp.557-571, 2006, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/j354023699610786/〉. 〈10.1007/11814771_45〉. 〈inria-00579011〉
  • Adel Bouhoula, Florent Jacquemard. Security Protocol Verification with Implicit Induction and Explicit Destructors. Fernández, Maribel and Kirchner, Claude. 1st International Workshop on Security and Rewriting Techniques (SecReT), Jul 2006, Venice, Italy. pp.37-44, 2006, Proceedings of the 1st International Workshop on Security and Rewriting Techniques (SecReT). 〈inria-00579018〉
  • Ichiro Mitsuhashi, Michio Oyamaguch, Florent Jacquemard. The Confluence Problem for Flat TRSs. Jacques Calmet and Tetsuo Ida and Dongming Wang. 8th International Conference Artificial Intelligence and Symbolic Computation (AISC), Sep 2006, Beijing, China. Springer, 4120, pp.68-81, 2006, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/3m3n00k2661814um/〉. 〈10.1007/11856290_8〉. 〈inria-00579010〉
  • Adel Bouhoula, Florent Jacquemard. Automating Sufficient Completeness Check for Conditional and Constrained TRS. Levy, Jordi. 20th International Workshop on Unification (UNIF), Aug 2006, Seattle, United States. 2006, Proceedings of the 20th International Workshop on Unification (UNIF). 〈inria-00579017〉
  • Stéphanie Delaune, Florent Jacquemard. A Decision Procedure for the Verification of Security Protocols with Explicit Destructors. Atluri, Vijayalakshmi and Pfitzmann, Birgit and McDaniel, Patrick. 11th ACM Conference on Computer and Communications Security (CCS), Oct 2004, Washington D.C., United States. ACM Press, pp.278-287, 2004, Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS). 〈inria-00579012〉
  • Stéphanie Delaune, Florent Jacquemard. A Theory of Dictionary Attacks and its Complexity. 17th IEEE Computer Security Foundations Workshop (CSFW), Jun 2004, Asilomar, Pacific Grove, United States. IEEE Computer Society Press, pp.2-15, 2004, Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW). 〈inria-00579014〉
  • Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. Compiling and Verifying Security Protocols. Michel Parigot, Andrei Voronkov. International Conference on Logic Programming & Automated Reasoning - LPAR'2000, 2000, Reunion Island, France, Springer-Verlag, 1955, pp.131-160, 2000, Lecture Notes in Computer Science. 〈inria-00099161〉
  • Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. Compiling and narrowing cryptographic protocols. Workshop on Verification and Modelling, 1999, Besançon, France, 1 p, 1999. 〈inria-00098875〉
  • Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes. Decidable fragments of simultaneous rigid reachability. Jiri Wiedermann, Peter van Emde Boas, Mogens Nielsen. International Colloquium on Automata, Languages, & Programming - ICALP'99, Jul 1999, Prague, Czech Republic, Springer-Verlag, 1644, pp.250-260, 1999, Lecture notes in computer science. 〈inria-00098806〉

Poster1 document

  • Clément Poncelet, Florent Jacquemard. Test methods for Score-Based Interactive Music Systems Toward a formal Specification. ICMC/SMC 2014, Sep 2014, Athène, Greece. 〈hal-01133597〉

Document associé à des manifestations scientifiques1 document

  • Emmanuel Filiot, Florent Jacquemard, Sophie Tison. Tree Automata with Constraints: a brief survey. Tree Transducers and Formal Methods (Dagstuhl Seminar 13192), May 2013, Wadern, Germany. pp.1-18, 2013. 〈hal-00840959〉

Chapitre d'ouvrage1 document

  • Olivier Michel, Florent Jacquemard. An Analysis of a Public-Key Protocol with Membranes. Ciobanu, G. and Paun, G. and Pérez-Jiménez, J. Applications of Membrane Computing, Springer Verlag, pp.283--302, 2005, Natural Computing Series, 〈10.1007/3-540-29937-8〉. 〈hal-00340140〉

Pré-publication, Document de travail1 document

  • Florent Jacquemard, Michaël Rusinowitch. Rewrite Closure and CF Hedge Automata. 2012. 〈hal-00752496v2〉

Rapport13 documents

  • Clément Poncelet, Florent Jacquemard. Offline methods of conformance testing for Antescofo. [Research Report] RR-8700, IRCAM; INRIA Paris-Rocquencourt; INRIA. 2015. 〈hal-01132155〉
  • Clément Poncelet, Florent Jacquemard. Compilation of the Intermediate Representation V1. [Research Report] RR-8701, IRCAM; INRIA Paris-Rocquencourt; INRIA. 2015. 〈hal-01132159〉
  • Florent Jacquemard. Rapport d’étape et bilan financier 2015 PHC AMADEUS 2015 « LETITBE » N° 33808SC. [Contrat] Institut français de Vienne. 2015. 〈hal-01254591〉
  • Florent Jacquemard, Pierre Donat-Bouillud, Jean Bresson. A Term Rewriting Based Structural Theory of Rhythm Notation. [Research Report] ANR-13-JS02-0004-01 - EFFICACe. 2015, pp.11. 〈hal-01134096v3〉
  • Florent Jacquemard, Clément Poncelet Sanchez. Antescofo Intermediate Representation. [Research Report] RR-8520, INRIA. 2014, pp.13. 〈hal-00979359〉
  • Léa Fanchon, Florent Jacquemard. Formal Timing Analysis of Mixed Music Scores. [Research Report] 2013, pp.10. 〈hal-00797595〉
  • Florent Jacquemard, Michael Rusinowitch. Rewrite based Verification of XML Updates. [Research Report] RR-7007, INRIA. 2009, pp.39. 〈inria-00408162〉
  • Adel Bouhoula, Florent Jacquemard. Automatic Verification of Sufficient Completeness for Conditional Constrained Term Rewriting Systems. [Research Report] RR-5863, INRIA. 2006, pp.17. 〈inria-00070163〉
  • Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. Tree Automata with Equality Constraints Modulo Equational Theories. [Research Report] RR-5754, INRIA. 2005, pp.27. 〈inria-00071215〉
  • Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. Compiling and Verifying Security Protocols. [Research Report] RR-3938, INRIA. 2000, pp.25. 〈inria-00072712〉
  • Hubert Comon, Florent Jacquemard. Ground Reducibility is EXPTIME-complete. [Research Report] RR-3800, INRIA. 1999, pp.26. 〈inria-00072859〉
  • Florent Jacquemard, Christoph Meyer, Christoph Weidenbach. Unification in Extensions of Shallow Equational Theories. [Intern report] 98-R-387 || jacquemard98a, 1998, 33 p. 〈inria-00098740〉
  • Harald Ganzinger, Florent Jacquemard, Margus Veanes. Rigid Reachability. [Intern report] 98-R-388 || ganzinger98a, 1998, 24 p. 〈inria-00098741〉

HDR1 document

  • Florent Jacquemard. Extended Tree Automata Models for the Verification of Infinite State Systems. Formal Languages and Automata Theory [cs.FL]. École normale supérieure de Cachan - ENS Cachan, 2011. 〈tel-00643595〉