default search action
Thibault Dardinier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Thibault Dardinier, Anqi Li, Peter Müller:
Hypra: A Deductive Program Verifier for Hyper Hoare Logic. Proc. ACM Program. Lang. 8(OOPSLA2): 1279-1308 (2024) - [j12]Thibault Dardinier
, Peter Müller
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties. Proc. ACM Program. Lang. 8(PLDI): 1485-1509 (2024) - [j11]Gaurav Parthasarathy
Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language. Proc. ACM Program. Lang. 8(PLDI): 1510-1534 (2024) - [i6]Gaurav Parthasarathy, Thibault Dardinier, Benjamin Bonneau, Peter Müller, Alexander J. Summers:
Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language (extended version). CoRR abs/2404.03614 (2024) - [i5]Thibault Dardinier, Michael Sammler, Gaurav Parthasarathy, Alexander J. Summers, Peter Müller:
Formal Foundations for Translational Separation Logic Verifiers (extended version). CoRR abs/2407.20002 (2024) - 2023
- [j10]Thibault Dardinier:
Formalization of CommCSL: A Relational Concurrent Separation Logic for Proving Information Flow Security in Concurrent Programs. Arch. Formal Proofs 2023 (2023) - [j9]Thibault Dardinier:
Formalization of Hyper Hoare Logic: A Logic to (Dis-)Prove Program Hyperproperties. Arch. Formal Proofs 2023 (2023) - [j8]Thibault Dardinier
Verification-Preserving Inlining in Automatic Separation Logic Verifiers. Proc. ACM Program. Lang. 7(OOPSLA1): 789-818 (2023) - [j7]Marco Eilers
CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity. Proc. ACM Program. Lang. 7(PLDI): 1682-1707 (2023) - [i4]Thibault Dardinier, Peter Müller:
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version). CoRR abs/2301.10037 (2023) - 2022
- [j6]Thibault Dardinier:
Formalization of a Framework for the Sound Automation of Magic Wands. Arch. Formal Proofs 2022 (2022) - [j5]Thibault Dardinier:
A Restricted Definition of the Magic Wand to Soundly Combine Fractions of a Wand. Arch. Formal Proofs 2022 (2022) - [j4]Thibault Dardinier:
Unbounded Separation Logic. Arch. Formal Proofs 2022 (2022) - [j3]Thibault Dardinier
Fractional resources in unbounded separation logic. Proc. ACM Program. Lang. 6(OOPSLA2): 1066-1092 (2022) - [c4]Thibault Dardinier
Sound Automation of Magic Wands. CAV (2) 2022: 130-151 - [c3]David A. Basin
VeriMon: A Formally Verified Monitoring Tool. ICTAC 2022: 1-6 - [i3]Thibault Dardinier, Gaurav Parthasarathy, Noé Weeks, Alexander J. Summers, Peter Müller:
Sound Automation of Magic Wands (extended version). CoRR abs/2205.11325 (2022) - [i2]Thibault Dardinier, Gaurav Parthasarathy, Peter Müller:
Verification-Preserving Inlining in Automatic Separation Logic Verifiers (extended version). CoRR abs/2208.10456 (2022) - [i1]Marco Eilers
CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity. CoRR abs/2211.08459 (2022) - 2020
- [j2]Thibault Dardinier, Lukas Heimes, Martin Raszyk, Joshua Schneider, Dmitriy Traytel:
Formalization of an Optimized Monitoring Algorithm for Metric First-Order Dynamic Logic with Aggregations. Arch. Formal Proofs 2020 (2020) - [c2]David A. Basin, Thibault Dardinier
A Formally Verified, Optimized Monitor for Metric First-Order Dynamic Logic. IJCAR (1) 2020: 432-453
2010 – 2019
- 2019
- [j1]Thibault Dardinier:
Formalization of Multiway-Join Algorithms. Arch. Formal Proofs 2019 (2019) - 2018
- [c1]Raphaël Dang-Nhu, Thibault Dardinier
A new analysis method for evolutionary optimization of dynamic and noisy objective functions. GECCO 2018: 1467-1474
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-11-22 19:39 CET 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: