A Geometric Approach to the Problem of Unique Decomposition of Processes. - Thibaut Balabonski; Emmanuel Haucourt (CONCUR, 2010)

Optimality for dynamic patterns. - Thibaut Balabonski (PPDP, 2010)

On the Implementation of Dynamic Patterns - Thibaut Balabonski (HOR, 2010)

A unified approach to fully lazy sharing. - Thibaut Balabonski (POPL, 2012)

Axiomatic Sharing-via-Labelling. - Thibaut Balabonski (RTA, 2012)

Weak optimality, and the meaning of sharing. - Thibaut Balabonski (ICFP, 2013)

Type Soundness and Race Freedom for Mezzo. - Thibaut Balabonski; François Pottier; Jonathan Protzenko (FLOPS, 2014)

Towards a Formal Semantics of the TESL Specification Language. - Hai Nguyen Van; Thibaut Balabonski; Frédéric Boulanger; Safouan Taha; Benoît Valiron; Burkhart Wolff; Lina Ye (GEMOC+MPM@MoDELS, 2015)

Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it. - Viktor Vafeiadis; Thibaut Balabonski; Soham Chakraborty 001; Robin Morisset; Francesco Zappa Nardelli (POPL, 2015)

The Design and Formalization of Mezzo, a Permission-Based Programming Language. - Thibaut Balabonski; François Pottier; Jonathan Protzenko (ACM Trans. Program. Lang. Syst., 2016)

Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems. - Thibaut Balabonski; Pierre Courtieu; Lionel Rieg; Sébastien Tixeuil; Xavier Urbain (FMICS-AVoCS, 2017)

A Symbolic Operational Semantics for TESL - With an Application to Heterogeneous System Testing. - Hai Nguyen Van; Thibaut Balabonski; Frédéric Boulanger; Chantal Keller; Benoît Valiron; Burkhart Wolff (FORMATS, 2017)

Foundations of strong call by need. - Thibaut Balabonski; Pablo Barenbaum; Eduardo Bonelli; Delia Kesner (Proc. ACM Program. Lang., 2017)

A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs. - Thibaut Balabonski; Robin Pelle; Lionel Rieg; Sébastien Tixeuil (ICDCN, 2018)

Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. - Thibaut Balabonski; Pierre Courtieu; Robin Pelle; Lionel Rieg; Sébastien Tixeuil; Xavier Urbain (SSS, 2018)

Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. - Thibaut Balabonski; Pierre Courtieu; Robin Pelle; Lionel Rieg; Sébastien Tixeuil; Xavier Urbain (NETYS, 2019)

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm. - Thibaut Balabonski; Amélie Delga; Lionel Rieg; Sébastien Tixeuil; Xavier Urbain (Theory Comput. Syst., 2019)

On the Semantics of Polychronous Polytimed Specifications. - Hai Nguyen Van; Thibaut Balabonski; Frédéric Boulanger; Chantal Keller; Benoît Valiron; Burkhart Wolff (FORMATS, 2020)

Computer Aided Formal Design of Swarm Robotics Algorithms. - Thibaut Balabonski; Pierre Courtieu; Robin Pelle; Lionel Rieg; Sébastien Tixeuil; Xavier Urbain (SSS, 2021)

A strong call-by-need calculus. - Thibaut Balabonski; Antoine Lanco; Guillaume Melquiond (Log. Methods Comput. Sci., 2023)