David Baelde - RankMe

53 papers A* 8A 8B 10C 1Journal 19Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Propositional Logics of Overwhelming Truth. CSL Thibaut Antoine, David Baelde
2025	A	`conf`	SMT-Based Automation for Overwhelming Truth. CSF David Baelde, Stéphanie Delaune, Stanislas Riou
2024	A	`conf`	A Probabilistic Logic for Concrete Security. CSF David Baelde, Caroline Fontaine, Adrien Koutsos, Guillaume Scerri, Théo Vignon
2024	A*	`conf`	Foundations for Cryptographic Reductions in CCSA Logics. CCS David Baelde, Adrien Koutsos, Justine Sauvage
2024	J	`jnl`	The Squirrel Prover and its Logic. ACM SIGLOG News David Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos, Joseph Lallemand
2023	A*	`conf`	A Higher-Order Indistinguishability Logic for Cryptographic Reasoning. LICS David Baelde, Adrien Koutsos, Joseph Lallemand
2023	A	`conf`	Proving Unlinkability Using ProVerif Through Desynchronised Bi-Processes. CSF David Baelde, Alexandre Debant, Stéphanie Delaune
2022	A*	`conf`	Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
2022	A	`conf`	Cracking the Stateful Nut: Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant. CSF David Baelde, Stéphanie Delaune, Adrien Koutsos, Solène Moreau
2021	A*	`conf`	An Interactive Prover for Protocol Verification in the Computational Model. SP David Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos, Solène Moreau
2021	—	`book`	Contributions to the Verification of Cryptographic Protocols. (Contributions à la Vérification des Protocoles Cryptographiques). David Baelde
2020	A	`conf`	A Method for Proving Unlinkability of Stateful Protocols. CSF David Baelde, Stéphanie Delaune, Solène Moreau
2020	J	`jnl`	Bouncing threads for infinitary and circular proofs. CoRR David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
2019	J	`jnl`	A method for unbounded verification of privacy-type properties. J. Comput. Secur. Lucca Hirschi, David Baelde, Stéphanie Delaune
2019	J	`jnl`	A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday. Math. Struct. Comput. Sci. David Baelde, Amy P. Felty, Gopalan Nadathur, Alexis Saurin
2019	A*	`conf`	Decidable XPath Fragments in the Real World. PODS David Baelde, Anthony Lick, Sylvain Schmitz
2018	B	`conf`	A Hypersequent Calculus with Clusters for Linear Frames. Advances in Modal Logic David Baelde, Anthony Lick, Sylvain Schmitz
2018	—	`conf`	A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. FSTTCS David Baelde, Anthony Lick, Sylvain Schmitz
2018	—	`conf`	POR for Security Protocol Equivalences - Beyond Action-Determinism. ESORICS (1) David Baelde, Stéphanie Delaune, Lucca Hirschi
2018	J	`jnl`	POR for Security Protocol Equivalences: Beyond Action-Determinism. CoRR David Baelde, Stéphanie Delaune, Lucca Hirschi
2017	J	`jnl`	A Reduced Semantics for Deciding Trace Equivalence. CoRR David Baelde, Stéphanie Delaune, Lucca Hirschi
2017	J	`jnl`	A Reduced Semantics for Deciding Trace Equivalence. Log. Methods Comput. Sci. David Baelde, Stéphanie Delaune, Lucca Hirschi
2017	J	`jnl`	A method for unbounded verification of privacy-type properties. CoRR Lucca Hirschi, David Baelde, Stéphanie Delaune
2017	J	`jnl`	Preface. Fundam. Informaticae David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz
2017	A	`conf`	Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR. CSF David Baelde, Stéphanie Delaune, Ivan Gazeau, Steve Kremer
2016	A*	`conf`	A Method for Verifying Privacy-Type Properties: The Unbounded Case. IEEE Symposium on Security and Privacy Lucca Hirschi, David Baelde, Stéphanie Delaune
2016	B	`conf`	A Sequent Calculus for a Modal Logic on Finite Data Trees. CSL David Baelde, Simon Lunel, Sylvain Schmitz
2016	B	`conf`	Infinitary Proof Theory: the Multiplicative Additive Case. CSL David Baelde, Amina Doumane, Alexis Saurin
2016	A*	`conf`	Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions. LICS Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin
2015	B	`conf`	Least and Greatest Fixed Points in Ludics. CSL David Baelde, Amina Doumane, Alexis Saurin
2015	B	`conf`	Partial Order Reduction for Security Protocols. CONCUR David Baelde, Stéphanie Delaune, Lucca Hirschi
2015	J	`jnl`	Partial Order Reduction for Security Protocols. CoRR David Baelde, Stéphanie Delaune, Lucca Hirschi
2014	—	`ed.`	25. Journées francophones des langages applicatifs, Fréjus, France, January 8-11, 2014. JFLA Christine Tasson, David Baelde
2014	—	`conf`	A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems. POST David Baelde, Stéphanie Delaune, Lucca Hirschi
2014	J	`jnl`	A reduced semantics for deciding trace equivalence using constraint systems. CoRR David Baelde, Stéphanie Delaune, Lucca Hirschi
2014	J	`jnl`	Abella: A System for Reasoning about Relational Specifications. J. Formaliz. Reason. David Baelde, Kaustuv Chaudhuri, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu, Yuting Wang
2013	—	`ed.`	Proceedings Workshop on Fixed Points in Computer Science, FICS 2013, Turino, Italy, September 1st, 2013. FICS David Baelde, Arnaud Carayol
2012	J	`jnl`	Combining Deduction Modulo and Logics of Fixed-Point Definitions CoRR David Baelde, Gopalan Nadathur
2012	A*	`conf`	Combining Deduction Modulo and Logics of Fixed-Point Definitions. LICS David Baelde, Gopalan Nadathur
2012	J	`jnl`	Least and Greatest Fixed Points in Linear Logic. ACM Trans. Comput. Log. David Baelde
2012	B	`conf`	Towards Provably Robust Watermarking. ITP David Baelde, Pierre Courtieu, David Gross-Amblard, Christine Paulin-Mohring
2011	B	`conf`	Liquidsoap: A High-Level Programming Language for Multimedia Streaming. SOFSEM David Baelde, Romain Beauxis, Samuel Mimram
2011	J	`jnl`	Liquidsoap: a High-Level Programming Language for Multimedia Streaming CoRR David Baelde, Romain Beauxis, Samuel Mimram
2010	J	`jnl`	A Meta-Programming Approach to Realizing Dependently Typed Logic Programming CoRR Zachary Snow, David Baelde, Gopalan Nadathur
2010	C	`conf`	A meta-programming approach to realizing dependently typed logic programming. PPDP Zachary Snow, David Baelde, Gopalan Nadathur
2010	A	`conf`	Focused Inductive Theorem Proving. IJCAR David Baelde, Dale Miller, Zachary Snow
2010	J	`jnl`	Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search CoRR Zachary Snow, David Baelde, Gopalan Nadathur
2009	J	`jnl`	Least and greatest fixed points in linear logic CoRR David Baelde
2009	B	`conf`	On the Proof Theory of Regular Fixed Points. TABLEAUX David Baelde
2008	—	`conf`	On the Expressivity of Minimal Generic Quantification. LFMTP@LICS David Baelde
2007	B	`conf`	Least and Greatest Fixed Points in Linear Logic. LPAR David Baelde, Dale Miller
2007	A	`conf`	The Bedwyr System for Model Checking over Syntactic Expressions. CADE David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu
2007	J	`jnl`	The Bedwyr system for model checking over syntactic expressions CoRR David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu