default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThibaut Balabonski
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond:
A strong call-by-need calculus. Log. Methods Comput. Sci. 19(1) (2023)- 2021
- [c18]Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond
:
A Strong Call-By-Need Calculus. FSCD 2021: 9:1-9:22 - [c17]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Computer Aided Formal Design of Swarm Robotics Algorithms. SSS 2021: 469-473 - [i3]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Computer Aided Formal Design of Swarm Robotics Algorithms. CoRR abs/2101.06966 (2021) - [i2]Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond:
A strong call-by-need calculus. CoRR abs/2111.01485 (2021) - 2020
- [c16]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: 23-40
2010 – 2019
- 2019
- [j3]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): 200-218 (2019) - [c15]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: 93-109 - 2018
- [c14]Thibaut Balabonski, Robin Pelle, Lionel Rieg, Sébastien Tixeuil:
A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs. ICDCN 2018: 5:1-5:10 - [c13]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: 404-408 - 2017
- [j2]Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner:
Foundations of strong call by need. Proc. ACM Program. Lang. 1(ICFP): 20:1-20:29 (2017) - [c12]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: 165-181 - [c11]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: 318-334 - 2016
- [j1]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): 14:1-14:94 (2016) - [c10]Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm. SSS 2016: 7-19 - 2015
- [c9]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: 14-19 - [c8]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: 209-220 - 2014
- [c7]Thibaut Balabonski, François Pottier, Jonathan Protzenko:
Type Soundness and Race Freedom for Mezzo. FLOPS 2014: 253-269 - 2013
- [c6]Thibaut Balabonski:
Weak optimality, and the meaning of sharing. ICFP 2013: 263-274 - 2012
- [c5]Thibaut Balabonski:
A unified approach to fully lazy sharing. POPL 2012: 469-480 - [c4]Thibaut Balabonski:
Axiomatic Sharing-via-Labelling. RTA 2012: 85-100 - 2010
- [c3]Thibaut Balabonski, Emmanuel Haucourt:
A Geometric Approach to the Problem of Unique Decomposition of Processes. CONCUR 2010: 132-146 - [c2]Thibaut Balabonski:
Optimality for dynamic patterns. PPDP 2010: 231-242 - [c1]Thibaut Balabonski:
On the Implementation of Dynamic Patterns. HOR 2010: 16-30 - [i1]Thibaut Balabonski, Emmanuel Haucourt:
A Geometric Approach to the Problem of Unique Decomposition of Processes. CoRR abs/1004.2780 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
