Posts by Collection

Constrained Tree Automata

Term Rewriting Systems

Automation of Inductive Theorem Proving

Hedge Automata and Rewriting, Data Tree

Specification and verification of security protocols

Automated Music Transcription

Tree-Structured Representations of Timed Data

Comparison of Digital Music Scores

Pitch Spelling

Symbolic Weighted Automata

Test and Verification of Realtime Interactive Music Systems

1999 Calife

post.name

2000 Aviss

post.name

2000 Eva

post.name

2003 Prouve Permalink

post.name

2003 Rossignol

post.name

2006 Stic

post.name

2007 Avote Permalink

post.name

2008 Fox Permalink

post.name

2008 Stic

post.name

2009 Webdam Permalink

post.name

2010 Access Permalink

post.name

2010 Stic Permalink

post.name

2012 Inedit Permalink

post.name

2013 Efficace Permalink

post.name

2015 Letitbe

post.name

2015 Musical Permalink

post.name

2016 Gioqoso Permalink

post.name

2016 Rq Permalink

post.name

2017 Munir Permalink

post.name

2017 Yamaha Permalink

post.name

2017 Polymir

post.name

2020 Codex Permalink

post.name

2020 Collabscore Permalink

post.name

2020 Jsps

post.name

2021 Polifonia Permalink

post.name

Compiling and Verifying Security Protocols

A Theory of Dictionary Attacks and its Complexity

Narrowing-based constraint solving for the verification of security protocols

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

An analysis of a public key protocol with membranes

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

Tree automata with equality constraints modulo equational theories

Tree Automata with Memory, Visibility and Structural Constraints

Verifying Regular Trace Properties of Security Protocols with Explicit Destructors and Implicit Induction

Tree Automata Techniques and Applications

Closure of Hedge-Automata Languages by Hedge Rewriting

Tree automata with equality constraints modulo equational theories

Visibly Tree Automata with Memory and Constraints

Closure of Tree Automata Languages under Innermost Rewriting

Automated Induction with Constrained Tree Automata

Rigid Tree Automata

Unique Normalization for Shallow TRS

Automatic Verification of Conformance of Firewall Configurations to Security Policies

Rewrite-Based Verification of XML Updates

The Emptiness Problem for Tree Automata with Global Constraints

XML Access Control: from XACML to Annotated Schemas

Rigid Tree Automata and Applications

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

Controlled Term Rewriting

Formalisation des relations temporelles dans un contexte d'accompagnement musical automatique

Formalisation des relations temporelles entre une partition et une performance musicale dans un contexte d'accompagnement automatique

Sufficient Completeness Verification for Conditional and Constrained Term Rewriting Systems

Correct Automatic Accompaniment Despite Machine Listening or Human Errors in Antescofo

Antescofo à l'avant-garde de l'informatique musicale

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

From Authored to Produced Time in Computer-Musician Interactions

Rewrite Closure and CF Hedge Automata

Unranked Tree Rewriting and Effective Closures of Languages

Formal Timing Analysis Of Mixed Music Scores

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

A Synchronous Embedding of Antescofo, a Domain-Specific Language for Interactive Mixed Music

Rhythm Tree Rewriting

Test Methods for Score-Based Interactive Music Systems

Projet EFFICACE : Développements et perspectives en composition assistée par ordinateur

Model Based Testing of an Interactive Music System

Towards an Equational Theory of Rhythm Notation

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

Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies

An Automatic Test Framework for Interactive Music Systems

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

Model-Based Testing for Building Reliable Realtime Interactive Music Systems

One-variable context-free hedge automata

Une approche interactive pour la transcription rythmique dans OpenMusic

A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration

Some results on confluence: decision and what to do without

Generating equivalent rhythmic notations based on rhythm tree languages

Interactive Music Transcription based on Rhythm Tree Languages

Évaluation de la correction rythmique des partitions numérisées

Gioqoso, an online Quality Assessment Tool for Music Notation

Evaluating musical score difference: a two-level comparison

Modeling and Learning Rhythm Structure

A Parse-based Framework for Coupled Rhythm Quantization and Score Structuring

Optimization of audio graphs by resampling

A diff procedure for music score files

Computation and Visualization of Differences between two XML Music Score Files

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

Weighted Automata Computation of Edit Distances with Consolidations and Fragmentations

Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription

MIDI To Score Automated Drum Transcription

Automated Transcription of Electronic Drumkits

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

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

Tokenization of MIDI Sequences for Transcription

Automated MEI Transcription of a Dataset of Electronic Drum Kit Recordings

Pitch Spelling Jazz Lead Sheets and Solo Transcriptions

Pitch Spelling Jazz Lead Sheets, Solo Transcriptions, Classical Piano and Monophonic Scores

Music Score Comparison based on a Tree-structured Intermediate Representation

A new parallel-tree-traversal algorithm for the comparison of music score files

1996 Maude

1997 Spass Permalink

1999 Casrul Permalink

2000 Tl

2006 Tace Permalink

2012 Antescofo Permalink

2013 Ascotest

2016 Rq Permalink

2017 Qparse

2019 Scorediff

2022 Tsm

2023 Pse

2026 Tsmdiff Permalink

Lambda Calculus

Seminar, École Normale Supérieure , 2003 — 2006.

I supervised a practical seminar (exercises) for the lecture of Jean Goubault Larrecq on Lambda Calculus at Master Parisien de Recherche en Informatique (MPRI), a common esearch-oriented Master programme in Computer Science between ENS Paris-Saclay. ENS Ulm, Institut Polytechnique de Paris, Université Paris-Cité, for 3 years, between 2003 and 2006 (36h/year). Read more

Tree Automata Theory

Workshop, University Paris-Saclay , 2006 — 2011.

Lecture on Tree Automata Theory at Master Parisien de Recherche en Informatique (MPRI), a common esearch-oriented Master programme in Computer Science between ENS Paris-Saclay. ENS Ulm, Institut Polytechnique de Paris, Université Paris-Cité. I gave the lecture for 5 years, between 2006 and 2011 (36h/year), as a module of level 2 of the Master in 2006 and 2007, and a module of level 1 for the other years. Read more

Tree Automata Techniques and Applications

Book, ENS Paris Saclay , 2017.

I am a co-author of the collective online book Tree Automata Techniques and Applications, widely used for teaching this discipline in universities. Read more

Tree Automata Techniques for Infinite Systems Verification

Summer School, Université de Liège , 2011.

Lecture (6h) at the summer school VTSA 2011 (Verification Technology, Systems & Applications), Liège, Belgium, on Tree Automata Techniques for Infinite Systems Verification. Read more

Music and Automata

Conference, ENS Paris-Saclay, Computer Science Department , 2017.

Lecture (3h) for the opening semester seminar 2017 at École Normale Supérieure Paris-Saclay, on Music and Automata. Read more

Rewriting Music

Summer School, École des Mines , 2019.

lectures (5h) at the International Summer School on Rewriting (ISR), in July 2019, on Rewriting Music. Read more

Object Oriented Programming

Master programme 1st year, INALCO , 2022 — 2025.

This lecture is part of the first year of the Master programme on NLP at INALCO, Paris. It is been given for 3 academic years, 2 semesters each year, for 40 hours per semester. Read more