default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Baelde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
[b1]David Baelde:
Contributions to the Verification of Cryptographic Protocols. (Contributions à la Vérification des Protocoles Cryptographiques). University of Paris-Saclay, France, 2021
Journal Articles
- 2024
- [j7]David Baelde
, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos, Joseph Lallemand:
The Squirrel Prover and its Logic. ACM SIGLOG News 11(2): 62-83 (2024) - 2019
- [j6]Lucca Hirschi, David Baelde, Stéphanie Delaune:
A method for unbounded verification of privacy-type properties. J. Comput. Secur. 27(3): 277-342 (2019) - [j5]David Baelde, Amy P. Felty, Gopalan Nadathur, Alexis Saurin:
A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday. Math. Struct. Comput. Sci. 29(8): 1007-1008 (2019) - 2017
- [j4]David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz:
Preface. Fundam. Informaticae 150(3-4): i-ii (2017) - [j3]David Baelde, Stéphanie Delaune, Lucca Hirschi:
A Reduced Semantics for Deciding Trace Equivalence. Log. Methods Comput. Sci. 13(2) (2017) - 2014
- [j2]David Baelde, Kaustuv Chaudhuri, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu, Yuting Wang:
Abella: A System for Reasoning about Relational Specifications. J. Formaliz. Reason. 7(2): 1-89 (2014) - 2012
- [j1]David Baelde:
Least and Greatest Fixed Points in Linear Logic. ACM Trans. Comput. Log. 13(1): 2:1-2:44 (2012)
Conference and Workshop Papers
- 2024
- [c28]David Baelde, Caroline Fontaine, Adrien Koutsos, Guillaume Scerri, Théo Vignon:
A Probabilistic Logic for Concrete Security. CSF 2024: 324-339 - 2023
- [c27]David Baelde, Alexandre Debant, Stéphanie Delaune:
Proving Unlinkability Using ProVerif Through Desynchronised Bi-Processes. CSF 2023: 75-90 - [c26]David Baelde, Adrien Koutsos, Joseph Lallemand:
A Higher-Order Indistinguishability Logic for Cryptographic Reasoning. LICS 2023: 1-13 - 2022
- [c25]David Baelde, Stéphanie Delaune, Adrien Koutsos, Solène Moreau:
Cracking the Stateful Nut: Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant. CSF 2022: 289-304 - [c24]David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS 2022: 63:1-63:13 - 2021
- [c23]David Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos, Solène Moreau:
An Interactive Prover for Protocol Verification in the Computational Model. SP 2021: 537-554 - 2020
- [c22]David Baelde, Stéphanie Delaune, Solène Moreau:
A Method for Proving Unlinkability of Stateful Protocols. CSF 2020: 169-183 - 2019
- [c21]David Baelde, Anthony Lick, Sylvain Schmitz:
Decidable XPath Fragments in the Real World. PODS 2019: 285-302 - 2018
- [c20]David Baelde, Anthony Lick, Sylvain Schmitz:
A Hypersequent Calculus with Clusters for Linear Frames. Advances in Modal Logic 2018: 43-62 - [c19]David Baelde, Stéphanie Delaune, Lucca Hirschi:
POR for Security Protocol Equivalences - Beyond Action-Determinism. ESORICS (1) 2018: 385-405 - [c18]David Baelde, Anthony Lick, Sylvain Schmitz:
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. FSTTCS 2018: 15:1-15:19 - 2017
- [c17]David Baelde, Stéphanie Delaune, Ivan Gazeau, Steve Kremer:
Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR. CSF 2017: 234-248 - 2016
- [c16]David Baelde, Simon Lunel, Sylvain Schmitz:
A Sequent Calculus for a Modal Logic on Finite Data Trees. CSL 2016: 32:1-32:16 - [c15]David Baelde, Amina Doumane, Alexis Saurin:
Infinitary Proof Theory: the Multiplicative Additive Case. CSL 2016: 42:1-42:17 - [c14]Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin:
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions. LICS 2016: 377-386 - [c13]Lucca Hirschi, David Baelde, Stéphanie Delaune:
A Method for Verifying Privacy-Type Properties: The Unbounded Case. IEEE Symposium on Security and Privacy 2016: 564-581 - 2015
- [c12]David Baelde, Stéphanie Delaune, Lucca Hirschi:
Partial Order Reduction for Security Protocols. CONCUR 2015: 497-510 - [c11]David Baelde, Amina Doumane, Alexis Saurin:
Least and Greatest Fixed Points in Ludics. CSL 2015: 549-566 - 2014
- [c10]David Baelde, Stéphanie Delaune, Lucca Hirschi:
A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems. POST 2014: 1-21 - 2012
- [c9]David Baelde, Pierre Courtieu, David Gross-Amblard, Christine Paulin-Mohring:
Towards Provably Robust Watermarking. ITP 2012: 201-216 - [c8]David Baelde, Gopalan Nadathur:
Combining Deduction Modulo and Logics of Fixed-Point Definitions. LICS 2012: 105-114 - 2011
- [c7]David Baelde, Romain Beauxis, Samuel Mimram:
Liquidsoap: A High-Level Programming Language for Multimedia Streaming. SOFSEM 2011: 99-110 - 2010
- [c6]David Baelde, Dale Miller, Zachary Snow:
Focused Inductive Theorem Proving. IJCAR 2010: 278-292 - [c5]Zachary Snow, David Baelde, Gopalan Nadathur:
A meta-programming approach to realizing dependently typed logic programming. PPDP 2010: 187-198 - 2009
- [c4]David Baelde:
On the Proof Theory of Regular Fixed Points. TABLEAUX 2009: 93-107 - 2008
- [c3]David Baelde:
On the Expressivity of Minimal Generic Quantification. LFMTP@LICS 2008: 3-19 - 2007
- [c2]David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu:
The Bedwyr System for Model Checking over Syntactic Expressions. CADE 2007: 391-397 - [c1]David Baelde, Dale Miller:
Least and Greatest Fixed Points in Linear Logic. LPAR 2007: 92-106
Editorship
- 2014
- [e2]Christine Tasson, David Baelde:
25. Journées francophones des langages applicatifs, Fréjus, France, January 8-11, 2014. 2014 [contents] - 2013
- [e1]David Baelde, Arnaud Carayol:
Proceedings Workshop on Fixed Points in Computer Science, FICS 2013, Turino, Italy, September 1st, 2013. EPTCS 126, 2013 [contents]
Informal and Other Publications
- 2020
- [i12]David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing threads for infinitary and circular proofs. CoRR abs/2005.08257 (2020) - 2018
- [i11]David Baelde, Stéphanie Delaune, Lucca Hirschi:
POR for Security Protocol Equivalences: Beyond Action-Determinism. CoRR abs/1804.03650 (2018) - 2017
- [i10]David Baelde, Stéphanie Delaune, Lucca Hirschi:
A Reduced Semantics for Deciding Trace Equivalence. CoRR abs/1704.08540 (2017) - [i9]Lucca Hirschi, David Baelde, Stéphanie Delaune:
A method for unbounded verification of privacy-type properties. CoRR abs/1710.02049 (2017) - 2015
- [i8]David Baelde, Stéphanie Delaune, Lucca Hirschi:
Partial Order Reduction for Security Protocols. CoRR abs/1504.04768 (2015) - 2014
- [i7]David Baelde, Stéphanie Delaune, Lucca Hirschi:
A reduced semantics for deciding trace equivalence using constraint systems. CoRR abs/1401.2854 (2014) - 2012
- [i6]David Baelde, Gopalan Nadathur:
Combining Deduction Modulo and Logics of Fixed-Point Definitions. CoRR abs/1204.6236 (2012) - 2011
- [i5]David Baelde, Romain Beauxis, Samuel Mimram:
Liquidsoap: a High-Level Programming Language for Multimedia Streaming. CoRR abs/1104.2681 (2011) - 2010
- [i4]Zachary Snow, David Baelde, Gopalan Nadathur:
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming. CoRR abs/1005.4379 (2010) - [i3]Zachary Snow, David Baelde, Gopalan Nadathur:
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search. CoRR abs/1007.0779 (2010) - 2009
- [i2]David Baelde:
Least and greatest fixed points in linear logic. CoRR abs/0910.3383 (2009) - 2007
- [i1]David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu:
The Bedwyr system for model checking over syntactic expressions. CoRR abs/cs/0702116 (2007)
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-10-07 22:11 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:
