Thibaut Balabonski

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 17

Top Topics

Specification Language

Formal Semantics

Discrete Valued

Top Venues

GEMOC+MPM@MoDELS

Publications

Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond
A strong call-by-need calculus. Log. Methods Comput. Sci. 19 (1) (2023)
Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond
A Strong Call-By-Need Calculus. FSCD (2021)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Computer Aided Formal Design of Swarm Robotics Algorithms. CoRR (2021)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Computer Aided Formal Design of Swarm Robotics Algorithms. SSS (2021)
Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond
A strong call-by-need calculus. CoRR (2021)
Hai Nguyen Van, Thibaut Balabonski, Frédéric Boulanger, Chantal Keller, Benoît Valiron, Burkhart Wolff
On the Semantics of Polychronous Polytimed Specifications. FORMATS (2020)
Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Synchronous Gathering without Multiplicity Detection: a Certified Algorithm. Theory Comput. Syst. 63 (2) (2019)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. NETYS (2019)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. SSS (2018)
Thibaut Balabonski, Robin Pelle, Lionel Rieg, Sébastien Tixeuil
A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs. ICDCN (2018)
Thibaut Balabonski, Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems. FMICS-AVoCS (2017)
Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner
Foundations of strong call by need. Proc. ACM Program. Lang. 1 (ICFP) (2017)
Hai Nguyen Van, Thibaut Balabonski, Frédéric Boulanger, Chantal Keller, Benoît Valiron, Burkhart Wolff
A Symbolic Operational Semantics for TESL - With an Application to Heterogeneous System Testing. FORMATS (2017)
Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm. SSS (2016)
Thibaut Balabonski, François Pottier, Jonathan Protzenko
The Design and Formalization of Mezzo, a Permission-Based Programming Language. ACM Trans. Program. Lang. Syst. 38 (4) (2016)
Hai Nguyen Van, Thibaut Balabonski, Frédéric Boulanger, Safouan Taha, Benoît Valiron, Burkhart Wolff, Lina Ye
Towards a Formal Semantics of the TESL Specification Language. GEMOC+MPM@MoDELS (2015)
Viktor Vafeiadis, Thibaut Balabonski, Soham Chakraborty, Robin Morisset, Francesco Zappa Nardelli
Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it. POPL (2015)
Thibaut Balabonski, François Pottier, Jonathan Protzenko
Type Soundness and Race Freedom for Mezzo. FLOPS (2014)
Thibaut Balabonski
Weak optimality, and the meaning of sharing. ICFP (2013)
Thibaut Balabonski
Axiomatic Sharing-via-Labelling. RTA (2012)
Thibaut Balabonski
A unified approach to fully lazy sharing. POPL (2012)
Thibaut Balabonski
On the Implementation of Dynamic Patterns HOR (2010)
Thibaut Balabonski, Emmanuel Haucourt
A Geometric Approach to the Problem of Unique Decomposition of Processes CoRR (2010)
Thibaut Balabonski
Optimality for dynamic patterns. PPDP (2010)
Thibaut Balabonski, Emmanuel Haucourt
A Geometric Approach to the Problem of Unique Decomposition of Processes. CONCUR (2010)