Thibault Dardinier

Orcid: 0000-0003-2719-4856

Affiliations:
  • EPFL, Switzerland
  • ETH Zurich, Switzerland (former)


According to our database1, Thibault Dardinier authored at least 33 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Hyper Separation Logic (extended version).
CoRR, April, 2026

Sound State Encodings in Translational Separation Logic Verifiers (Extended Version).
CoRR, March, 2026

2025
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs.
Proc. ACM Program. Lang., 2025

Formal Foundations for Translational Separation Logic Verifiers.
Proc. ACM Program. Lang., 2025

2024
Formal Foundations for Translational Separation Logic Verifiers - Artifact.
Dataset, October, 2024

Hypra: A Deductive Program Verifier for Hyperproperties (artifact).
Dataset, July, 2024

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (artifact).
Dataset, March, 2024

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (artifact).
Dataset, March, 2024

Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language.
Proc. ACM Program. Lang., 2024

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties.
Proc. ACM Program. Lang., 2024

Hypra: A Deductive Program Verifier for Hyper Hoare Logic.
Proc. ACM Program. Lang., 2024

Formal Foundations for Translational Separation Logic Verifiers (extended version).
CoRR, 2024

Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language (extended version).
CoRR, 2024

2023
Verification-Preserving Inlining in Automatic Separation Logic Verifiers.
Proc. ACM Program. Lang., April, 2023

CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity (Artifact).
Dataset, March, 2023

CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity.
Proc. ACM Program. Lang., 2023

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version).
CoRR, 2023

Formalization of Hyper Hoare Logic: A Logic to (Dis-)Prove Program Hyperproperties.
Arch. Formal Proofs, 2023

Formalization of CommCSL: A Relational Concurrent Separation Logic for Proving Information Flow Security in Concurrent Programs.
Arch. Formal Proofs, 2023

2022
Sound Automation of Magic Wands (Artifact).
Dataset, May, 2022

Sound Automation of Magic Wands (Artifact).
Dataset, May, 2022

Fractional resources in unbounded separation logic.
Proc. ACM Program. Lang., 2022

Verification-Preserving Inlining in Automatic Separation Logic Verifiers (extended version).
CoRR, 2022

Sound Automation of Magic Wands (extended version).
CoRR, 2022

Unbounded Separation Logic.
Arch. Formal Proofs, 2022

A Restricted Definition of the Magic Wand to Soundly Combine Fractions of a Wand.
Arch. Formal Proofs, 2022

Formalization of a Framework for the Sound Automation of Magic Wands.
Arch. Formal Proofs, 2022


Sound Automation of Magic Wands.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2020
Formalization of an Optimized Monitoring Algorithm for Metric First-Order Dynamic Logic with Aggregations.
Arch. Formal Proofs, 2020

A Formally Verified, Optimized Monitor for Metric First-Order Dynamic Logic.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Formalization of Multiway-Join Algorithms.
Arch. Formal Proofs, 2019

2018
A new analysis method for evolutionary optimization of dynamic and noisy objective functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018


  Loading...