Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Baelde, David
164  Ergebnisse:
Personensuche X
?
1

The Squirrel Prover and its Logic:

Baelde, David ; Delaune, Stéphanie ; Jacomme, Charlie..
ACM SIGLOG News.  11 (2024)  2 - p. 62-83 , 2024
Link: https://doi.org/10.1145/..
 
?
2

Proving Unlinkability Using ProVerif Through Desynchronised..:

, In: 2023 IEEE 36th Computer Security Foundations Symposium (CSF),
Baelde, David ; Debant, Alexandre ; Delaune, Stephanie - p. 75-90 , 2023
Link: https://doi.org/10.1109/..
 
?
3

A Higher-Order Indistinguishability Logic for Cryptographic..:

, In: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
Baelde, David ; Koutsos, Adrien ; Lallemand, Joseph - p. 1-13 , 2023
Link: https://doi.org/10.1109/..
 
?
4

Cracking the Stateful Nut: Computational Proofs of Stateful..:

, In: 2022 IEEE 35th Computer Security Foundations Symposium (CSF),
Baelde, David ; Delaune, Stephanie ; Koutsos, Adrien. - p. 289-304 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Bouncing Threads for Circular and Non-Wellfounded Proofs ..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,
Baelde, David ; Doumane, Amina ; Kuperberg, Denis. - p. 1-13 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

An Interactive Prover for Protocol Verification in the Comp..:

, In: 2021 IEEE Symposium on Security and Privacy (SP),
Baelde, David ; Delaune, Stephanie ; Jacomme, Charlie.. - p. 537-554 , 2021
Link: https://doi.org/10.1109/..
 
?
7

A Method for Proving Unlinkability of Stateful Protocols:

, In: 2020 IEEE 33rd Computer Security Foundations Symposium (CSF),
Baelde, David ; Delaune, Stephanie ; Moreau, Solene - p. 169-183 , 2020
Link: https://doi.org/10.1109/..
 
?
8

A special issue on structural proof theory, automated reaso..:

Baelde, David ; Felty, Amy ; Nadathur, Gopalan.
Mathematical Structures in Computer Science.  29 (2019)  8 - p. 1007-1008 , 2019
Link: https://doi.org/10.1017/..
 
?
9

Decidable XPath Fragments in the Real World:

, In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Baelde, David ; Lick, Anthony ; Schmitz, Sylvain - p. 285-302 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

POR for Security Protocol Equivalences: Beyond Action-Deter..:

, In: Computer Security; Lecture Notes in Computer Science,
Baelde, David ; Delaune, Stéphanie ; Hirschi, Lucca - p. 385-405 , 2018
Link: https://doi.org/10.1007/..
 
?
11

Towards Completeness via Proof Search in the Linear Time μ-..:

, In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science,
Doumane, Amina ; Baelde, David ; Hirschi, Lucca. - p. 377-386 , 2016
Link: https://dl.acm.org/doi/1..
 
?
12

A Method for Verifying Privacy-Type Properties: The Unbound..:

, In: 2016 IEEE Symposium on Security and Privacy (SP),
Hirschi, Lucca ; Baelde, David ; Delaune, Stephanie - p. 564-581 , 2016
Link: https://doi.org/10.1109/..
 
?
13

Least and Greatest Fixed Points in Linear Logic:

Baelde, David
ACM Transactions on Computational Logic.  13 (2012)  1 - p. 1-44 , 2012
Link: https://doi.org/10.1145/..
 
?
14

Combining Deduction Modulo and Logics of Fixed-Point Defini..:

, In: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science,
Baelde, David ; Nadathur, Gopalan - p. 105-114 , 2012
Link: https://dl.acm.org/doi/1..
 
?
15

Least and Greatest Fixed Points in Linear Logic:

Baelde, David
ACM Transactions on Computational Logic (TOCL).  13 (2012)  1 - p. 1-44 , 2012
Link: https://dl.acm.org/doi/1..
 
1-15