David Baelde
YOU?
Author Swipe
View article: Verifying Protocols with Squirrel: Making Strides Without Compromise
Verifying Protocols with Squirrel: Making Strides Without Compromise Open
Security protocols are concurrent processes that communicate using cryptography to achieve various security properties. Recent advancements in their formal verification have led to the development of procedures and tools for analysing them…
View article: Propositional Logics of Overwhelming Truth
Propositional Logics of Overwhelming Truth Open
Cryptographers consider that asymptotic security holds when, for any possible attacker running in polynomial time, the probability that the attack succeeds is negligible, i.e. that it tends fast enough to zero with the size of secrets. In …
View article: Foundations for Cryptographic Reductions in CCSA Logics
Foundations for Cryptographic Reductions in CCSA Logics Open
International audience
View article: A Probabilistic Logic for Concrete Security
A Probabilistic Logic for Concrete Security Open
International audience
View article: The Squirrel Prover and its Logic
The Squirrel Prover and its Logic Open
Security protocols are widely used today to secure transactions that take place over public channels like the Internet. Common uses include the secure transfer of sensitive information such as credit card numbers, or user authentication on…
View article: A Higher-Order Indistinguishability Logic for Cryptographic Reasoning
A Higher-Order Indistinguishability Logic for Cryptographic Reasoning Open
International audience
View article: On the Fair Termination of Client-Server Sessions
On the Fair Termination of Client-Server Sessions Open
Client-server sessions are based on a variation of the traditional interpretation of linear logic propositions as session types in which non-linear channels (those regulating the interaction between a pool of clients and a single server) a…
View article: Bouncing threads for circular and non-wellfounded proofs -- Towards compositionality with circular proofs (Extended version)
Bouncing threads for circular and non-wellfounded proofs -- Towards compositionality with circular proofs (Extended version) Open
International audience
View article: Proving Unlinkability using ProVerif through Desynchronized Bi-Processes
Proving Unlinkability using ProVerif through Desynchronized Bi-Processes Open
International audience
View article: Extending the SQUIRREL meta-logic for reasoning over security protocols: Work in Progress
Extending the SQUIRREL meta-logic for reasoning over security protocols: Work in Progress Open
The formal verification of security protocols can be carried out in two categories of models. Symbolic models, pioneered by Dolev and Yao, represent messages by first-order terms and attacker capabilities by inference rules or equational t…
View article: Contributions à la Vérification des Protocoles Cryptographiques
Contributions à la Vérification des Protocoles Cryptographiques Open
Formal methods use techniques from theoretical computer science for the designand verification of trustworthy systems. Since the 80’, the verification of cryptographicprotocols has been the topic of active research in this domain, which ha…
View article: Bouncing threads for infinitary and circular proofs
Bouncing threads for infinitary and circular proofs Open
We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed to take into account axioms and cuts. We show that it is sound and enjoys the cut…
View article: A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday
A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday Open
The genesis of this special issue was in a meeting that took place at Université Paris Diderot on December 15 and 16, 2016. Dale Miller, Professor at École polytechnique, had turned 60 a few days earlier. In a career spanning over three de…
View article: Decidable XPath Fragments in the Real World
Decidable XPath Fragments in the Real World Open
International audience
View article: A method for unbounded verification of privacy-type properties
A method for unbounded verification of privacy-type properties Open
In this paper, we consider the problem of verifying anonymity and unlinkability in the symbolic model, where protocols are represented as processes in a variant of the applied pi calculus, notably used in the [Formula: see text] tool. Exis…
View article: POR for Security Protocol Equivalences: Beyond Action-Determinism
POR for Security Protocol Equivalences: Beyond Action-Determinism Open
Formal methods have proved effective to automatically analyze protocols. Over the past years, much research has focused on verifying trace equivalence on protocols, which is notably used to model many interesting privacy properties, e.g., …
View article: A Hypersequent Calculus with Clusters for Linear Frames
A Hypersequent Calculus with Clusters for Linear Frames Open
International audience
View article: A Hypersequent Calculus with Clusters for Tense Logic over Ordinals
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals Open
Prior's tense logic forms the core of linear temporal logic, with both past- and future-looking modalities. We present a sound and complete proof system for tense logic over ordinals. Technically, this is a hypersequent system, enriched wi…
View article: A Reduced Semantics for Deciding Trace Equivalence
A Reduced Semantics for Deciding Trace Equivalence Open
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., wi…
View article: A Reduced Semantics for Deciding Trace Equivalence
A Reduced Semantics for Deciding Trace Equivalence Open
Many privacy-type properties of security protocols can be modelled using\ntrace equivalence properties in suitable process algebras. It has been shown\nthat such properties can be decided for interesting classes of finite processes\n(i.e.,…
View article: Symbolic verification of privacy-type properties for security protocols with XOR (extended version)
Symbolic verification of privacy-type properties for security protocols with XOR (extended version) Open
In symbolic verification of security protocols, process equivalences have recently been used extensively to model strong secrecy, anonymity and unlinkability properties. However, tool support for automated analysis of equivalence propertie…
View article: Towards Completeness via Proof Search in the Linear Time mu-Calculus: The case of Büchi inclusions
Towards Completeness via Proof Search in the Linear Time mu-Calculus: The case of Büchi inclusions Open
Modal µ-calculus is one of the central languages of logic and verification , whose study involves notoriously complex objects: au-tomata over infinite structures on the model-theoretical side; infinite proofs and proofs by (co)induction on…
View article: A Sequent Calculus for a Modal Logic on Finite Data Trees
A Sequent Calculus for a Modal Logic on Finite Data Trees Open
We investigate the proof theory of a modal fragment of XPath equipped with data (in)equality tests over finite data trees, i.e., over finite unranked trees where nodes are labelled with both a symbol from a finite alphabet and a single dat…
View article: Infinitary Proof Theory: the Multiplicative Additive Case
Infinitary Proof Theory: the Multiplicative Additive Case Open
Infinitary and regular proofs are commonly used in fixed point logics. Being natural intermediate devices between semantics and traditional finitary proof systems, they are commonly found in completeness arguments, automated deduction, ver…
View article: Partial Order Reduction for Security Protocols
Partial Order Reduction for Security Protocols Open
Security protocols are concurrent processes that communicate using cryptography with the aim of achieving various security properties. Recent work on their formal verification has brought procedures and tools for deciding trace equivalence…
View article: Abella: A System for Reasoning about Relational Specifications
Abella: A System for Reasoning about Relational Specifications Open
The Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive and co-inductive reasoning over relations. Abella supports the λ-tree approach to treating syntax containing binders: it allows simply type…
View article: Least and Greatest Fixed Points in Ludics
Least and Greatest Fixed Points in Ludics Open
Various logics have been introduced in order to reason over (co)inductive specifications and, through the Curry-Howard correspondence, to study computation over inductive and coinductive data. The logic mu-MALL is one of those logics, exte…
View article: Partial Order Reduction for Security Protocols
Partial Order Reduction for Security Protocols Open
Security protocols are concurrent processes that communicate using cryptography with the aim of achieving various security properties. Recent work on their formal verification has brought procedures and tools for deciding trace equivalence…