Thibaut Balabonski

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