Verification of Timed Automata Using Rewrite Rules and Strategies - Emmanuel Beffara; Olivier Bournez; Hassen Kacem; Claude Kirchner (CoRR, 2001)

Disjunctive normal forms and local exceptions. - Emmanuel Beffara; Vincent Danos (ICFP, 2003)

A Concurrent Model for Linear Logic. - Emmanuel Beffara (MFPS, 2005)

Logique, Réalisabilité et Concurrence. (Logic, Realisability and Concurrency). - Emmanuel Beffara (2005)

Concurrent nets: A study of prefixing in process calculi. - Emmanuel Beffara; François Maurel (Theor. Comput. Sci., 2006)

An Algebraic Process Calculus. - Emmanuel Beffara (LICS, 2008)

Quantitative testing semantics for non-interleaving - Emmanuel Beffara (CoRR, 2009)

Linear combinations of orders - Emmanuel Beffara (CoRR, 2009)

Functions as proofs as processes - Emmanuel Beffara (CoRR, 2011)

Proofs as Executions. - Emmanuel Beffara; Virgile Mogbil (IFIP TCS, 2012)

A logical view on scheduling in concurrency. - Emmanuel Beffara (CL&C, 2014)

Unifying type systems for mobile processes. - Emmanuel Beffara (CoRR, 2015)

Order algebras: a quantitative model of interaction. - Emmanuel Beffara (Math. Struct. Comput. Sci., 2018)

Concurrent Realizability on Conjunctive Structures. - Emmanuel Beffara; Félix Castro; Mauricio Guillermo (CoRR, 2021)

Concurrent Realizability on Conjunctive Structures. - Emmanuel Beffara; Félix Castro; Mauricio Guillermo; Étienne Miquey (FSCD, 2023)

L'algorithme: pourquoi et comment le définir pour l'enseigner. - Emmanuel Beffara (CoRR, 2024)