Gilles Barthe

Orcid: 0000-0002-3853-1777

Affiliations:
  • Max Planck Institute for Security and Privacy, Bochum, Germany
  • IMDEA Software Institute, Spain (2008 - 2018)
  • INRIA, Sophia-Antipolis, France (1999 - 2008)
  • University of Minho, Braga, Portugal (1998 - 1999)
  • Chalmers University, Gothenburg, Sweden (1997 - 1998)
  • Centrum Wiskunde & Informatica, Amsterdam, The Netherlands (1995 - 1997)
  • University of Nijmegen, The Netherlands (1993 - 1995)
  • University of Manchester, UK (PhD 1993)


According to our database1, Gilles Barthe authored at least 273 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Masking the GLP Lattice-Based Signature Scheme at Any Order.
J. Cryptol., March, 2024

Decision and Complexity of Dolev-Yao Hyperproperties.
Proc. ACM Program. Lang., January, 2024

High-assurance zeroization.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

A Modal Type Theory of Expected Cost in Higher-Order Probabilistic Programs.
Proc. ACM Program. Lang., 2024

Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs.
Proc. ACM Program. Lang., 2024

Protecting cryptographic code against Spectre-RSB.
IACR Cryptol. ePrint Arch., 2024

Preservation of Speculative Constant-time by Compilation.
IACR Cryptol. ePrint Arch., 2024

Formally verifying Kyber Episode V: Machine-checked IND-CCA security and correctness of ML-KEM in EasyCrypt.
IACR Cryptol. ePrint Arch., 2024

A quantitative probabilistic relational Hoare logic.
CoRR, 2024

"These results must be false": A usability evaluation of constant-time analysis tools.
Proceedings of the 33rd USENIX Security Symposium, 2024

They're not that hard to mitigate: What Cryptographic Library Developers Think About Timing Attacks.
Proceedings of the Software Engineering 2024, Fachtagung des GI-Fachbereichs Softwaretechnik, Linz, Austria, February 26, 2024

Testing Side-channel Security of Cryptographic Implementations against Future Microarchitectures.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

OBRA: Oracle-Based, Relational, Algorithmic Type Verification.
Proceedings of the Programming Languages and Systems - 22nd Asian Symposium, 2024

2023
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability.
ACM Trans. Priv. Secur., August, 2023

CoqQ: Foundational Verification of Quantum Programs.
Proc. ACM Program. Lang., January, 2023

Formally verifying Kyber Episode IV: Implementation correctness.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium.
IACR Cryptol. ePrint Arch., 2023

Formally verifying Kyber Part I: Implementation Correctness.
IACR Cryptol. ePrint Arch., 2023

A Survey of Algorithmic Recourse: Contrastive Explanations and Consequential Recommendations.
ACM Comput. Surv., 2023

Ultimate SLH: Taking Speculative Load Hardening to the Next Level.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields.
ACM Trans. Comput. Log., 2022

Safe couplings: coupled refinement types.
Proc. ACM Program. Lang., 2022

On Feller continuity and full abstraction.
Proc. ACM Program. Lang., 2022

A formal treatment of the role of verified compilers in secure computation.
J. Log. Algebraic Methods Program., 2022

Breaking and Fixing Speculative Load Hardening.
IACR Cryptol. ePrint Arch., 2022

Enforcing fine-grained constant-time policies.
IACR Cryptol. ePrint Arch., 2022

Typing High-Speed Cryptography against Spectre v1.
IACR Cryptol. ePrint Arch., 2022

Spectre Declassified: Reading from the Right Place at the Wrong Time.
IACR Cryptol. ePrint Arch., 2022

On Feller Continuity and Full Abstraction (Long Version).
CoRR, 2022

Flux: Liquid Types for Rust.
CoRR, 2022

SoK: Practical Foundations for Software Spectre Defenses.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Semantic Foundations for Cost Analysis of Pipeline-Optimized Programs.
Proceedings of the Static Analysis - 29th International Symposium, 2022

Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Tidy: Symbolic Verification of Timed Cryptographic Protocols.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Symbolic Synthesis of Indifferentiability Attacks.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Masking in Fine-Grained Leakage Models: Construction, Implementation and Verification.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Deciding accuracy of differential privacy schemes.
Proc. ACM Program. Lang., 2021

On continuation-passing transformations and expected cost analysis.
Proc. ACM Program. Lang., 2021

Higher-order probabilistic adversarial computations: categorical semantics and program logics.
Proc. ACM Program. Lang., 2021

A pre-expectation calculus for probabilistic sensitivity.
Proc. ACM Program. Lang., 2021

“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks.
IACR Cryptol. ePrint Arch., 2021

Structured Leakage and Applications to Cryptographic Constant-Time and Cost.
IACR Cryptol. ePrint Arch., 2021

EasyPQC: Verifying Post-Quantum Cryptography.
IACR Cryptol. ePrint Arch., 2021

SoK: Practical Foundations for Spectre Defenses.
CoRR, 2021

High-Assurance Cryptography in the Spectre Era.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Secure Compilation of Constant-Resource Programs.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

Scaling Guarantees for Nearest Counterfactual Explanations.
Proceedings of the AIES '21: AAAI/ACM Conference on AI, 2021

2020
Relational proofs for quantum programs.
Proc. ACM Program. Lang., 2020

A probabilistic separation logic.
Proc. ACM Program. Lang., 2020

Formal verification of a constant-time preserving C compiler.
Proc. ACM Program. Lang., 2020

Privacy Profiles and Amplification by Subsampling.
J. Priv. Confidentiality, 2020

Improved parallel mask refreshing algorithms: generic solutions with parametrized non-interference and automated optimizations.
J. Cryptogr. Eng., 2020

System-Level Non-interference of Constant-Time Cryptography. Part II: Verified Static Analysis and Stealth Memory.
J. Autom. Reason., 2020

High-Assurance Cryptography Software in the Spectre Era.
IACR Cryptol. ePrint Arch., 2020

PanCast: Listening to Bluetooth Beacons for Epidemic Risk Mitigation.
CoRR, 2020

A survey of algorithmic recourse: definitions, formulations, solutions, and prospects.
CoRR, 2020

The Last Mile: High-Assurance and High-Speed Cryptographic Implementations.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Constant-time foundations for the new spectre era.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Deciding Differential Privacy for Programs with Finite Inputs and Outputs.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Certified Compilation for Cryptography: Extended x86 Instructions and Constant-Time Verification.
Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020

On the Versatility of Open Logical Relations - Continuity, Automatic Differentiation, and a Containment Theorem.
Proceedings of the Programming Languages and Systems, 2020

Model-Agnostic Counterfactual Explanations for Consequential Decisions.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Hypothesis Testing Interpretations and Renyi Differential Privacy.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization.
Proc. ACM Program. Lang., 2019

Relational ⋆⋆\star-Liftings for Differential Privacy.
Log. Methods Comput. Sci., 2019

Program for TPDP 2016.
J. Priv. Confidentiality, 2019

Automated Analysis of Cryptographic Assumptions in Generic Group Models.
J. Cryptol., 2019

System-Level Non-interference of Constant-Time Cryptography. Part I: Model.
J. Autom. Reason., 2019

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.
J. Autom. Reason., 2019

GALACTICS: Gaussian Sampling for Lattice-Based Constant-Time Implementation of Cryptographic Signatures, Revisited.
IACR Cryptol. ePrint Arch., 2019

SoK: Computer-Aided Cryptography.
IACR Cryptol. ePrint Arch., 2019

A Machine-Checked Proof of Security for AWS Key Management Service.
IACR Cryptol. ePrint Arch., 2019

Machine-Checked Proofs for Cryptographic Standards.
IACR Cryptol. ePrint Arch., 2019

Automated Methods for Checking Differential Privacy.
CoRR, 2019

Towards Constant-Time Foundations for the New Spectre Era.
CoRR, 2019

Kantorovich Continuity of Probabilistic Programs.
CoRR, 2019

Coupling Techniques for Reasoning about Quantum Programs.
CoRR, 2019

Bidirectional type checking for relational properties.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

FaCT: a DSL for timing-sensitive computation.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Privacy Amplification by Mixing and Diffusion Mechanisms.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Verifying Relational Properties using Trace Logic.
Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

maskVerif: Automated Verification of Higher-Order Masking in Presence of Physical Defaults.
Proceedings of the Computer Security - ESORICS 2019, 2019

Symbolic Methods in Computational Cryptography Proofs.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Monadic refinements for relational cost analysis.
Proc. ACM Program. Lang., 2018

Proving expected sensitivity of probabilistic programs.
Proc. ACM Program. Lang., 2018

Symbolic Proofs for Lattice-Based Cryptography.
IACR Cryptol. ePrint Arch., 2018

maskVerif: a formal tool for analyzing software and hardware masked implementations.
IACR Cryptol. ePrint Arch., 2018

Improved Parallel Mask Refreshing Algorithms: Generic Solutions with Parametrized Non-Interference & Automated Optimizations.
IACR Cryptol. ePrint Arch., 2018

Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks.
IACR Cryptol. ePrint Arch., 2018

Formal verification of higher-order probabilistic programs.
CoRR, 2018

Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergences.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Almost Sure Productivity.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

An Assertion-Based Program Logic for Probabilistic Programs.
Proceedings of the Programming Languages and Systems, 2018

Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus.
Proceedings of the Programming Languages and Systems, 2018

Secure Compilation of Side-Channel Countermeasures: The Case of Cryptographic "Constant-Time".
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017
A relational logic for higher-order programs.
Proc. ACM Program. Lang., 2017

Provably secure compilation of side-channel countermeasures.
IACR Cryptol. ePrint Arch., 2017

A Note on 'Further Improving Efficiency of Higher-Order Masking Scheme by Decreasing Randomness Complexity'.
IACR Cryptol. ePrint Arch., 2017

Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions.
IACR Cryptol. ePrint Arch., 2017

A Fast and Verified Software Stack for Secure Function Evaluation.
IACR Cryptol. ePrint Arch., 2017

Reasoning about Divergences for Relaxations of Differential Privacy.
CoRR, 2017

Relational cost analysis.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Coupling proofs are probabilistic product programs.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Proving uniformity and independence by self-composition and coupling.
Proceedings of the LPAR-21, 2017

*-Liftings for Differential Privacy.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Reasoning about Probabilistic Defense Mechanisms against Remote Attacks.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

Is Your Software on Dope? - Formal Analysis of Surreptitiously "enhanced" Programs.
Proceedings of the Programming Languages and Systems, 2017

Verified Translation Validation of Static Analyses.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Jasmin: High-Assurance and High-Speed Cryptography.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Programming language techniques for differential privacy.
ACM SIGLOG News, 2016

Product programs and relational program logics.
J. Log. Algebraic Methods Program., 2016

Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds.
IET Inf. Secur., 2016

Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model.
IACR Cryptol. ePrint Arch., 2016

Generic Transformations of Predicate Encodings: Constructions and Applications.
IACR Cryptol. ePrint Arch., 2016

Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model.
IACR Cryptol. ePrint Arch., 2016

Advanced Probabilistic Couplings for Differential Privacy.
CoRR, 2016

Computer-Aided Verification for Mechanism Design.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Verifying Constant-Time Implementations.
Proceedings of the 25th USENIX Security Symposium, 2016

Proving Differential Privacy via Probabilistic Couplings.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Facets of Software Doping.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

A Program Logic for Union Bounds.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Advanced Probabilistic Couplings for Differential Privacy.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Differentially Private Bayesian Programming.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Strong Non-Interference and Type-Directed Higher-Order Masking.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Synthesizing Probabilistic Invariants via Doob's Decomposition.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
SEFM: software engineering and formal methods.
Softw. Syst. Model., 2015

High-Assurance Cryptography: Cryptographic Software We Can Trust.
IEEE Secur. Priv., 2015

Mind the Gap: Modular Machine-checked Proofs of One-Round Key Exchange Protocols.
IACR Cryptol. ePrint Arch., 2015

Verified Proofs of Higher-Order Masking.
IACR Cryptol. ePrint Arch., 2015

Compositional Verification of Higher-Order Masking: Application to a Verifying Masking Compiler.
IACR Cryptol. ePrint Arch., 2015

Verifiable side-channel security of cryptographic implementations: constant-time MEE-CBC.
IACR Cryptol. ePrint Arch., 2015

Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181).
Dagstuhl Reports, 2015

Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Relational Reasoning via Probabilistic Coupling.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Automated Proofs of Pairing-Based Cryptography.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Formal Verification of an SSA-Based Middle-End for CompCert.
ACM Trans. Program. Lang. Syst., 2014

Synthesis of Fault Attacks on Cryptographic Implementations.
IACR Cryptol. ePrint Arch., 2014

Making RSA-PSS Provably Secure Against Non-Random Faults.
IACR Cryptol. ePrint Arch., 2014

System-level non-interference for constant-time cryptography.
IACR Cryptol. ePrint Arch., 2014

Verified Implementations for Secure and Verifiable Computation.
IACR Cryptol. ePrint Arch., 2014

The Synergy Between Programming Languages and Cryptography (Dagstuhl Seminar 14492).
Dagstuhl Reports, 2014

Leakage Resilience against Concurrent Cache Attacks.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

Probabilistic relational verification for cryptographic implementations.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Proving Differential Privacy in Hoare Logic.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

Certified Synthesis of Efficient Batch Verifiers.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

2013
Probabilistic Relational Reasoning for Differential Privacy.
ACM Trans. Program. Lang. Syst., 2013

A certified lightweight non-interference Java bytecode verifier.
Math. Struct. Comput. Sci., 2013

Verified indifferentiable hashing into elliptic curves.
J. Comput. Secur., 2013

Certified computer-aided cryptography: efficient provably secure machine code from high-level implementations.
IACR Cryptol. ePrint Arch., 2013

Formally Verified Implementation of an Idealized Model of Virtualization.
Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

Computer-Aided Security Proofs.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

From relational verification to SIMD loop synthesis.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

EasyCrypt: A Tutorial.
Proceedings of the Foundations of Security Analysis and Design VII, 2013

Verified Computational Differential Privacy with Applications to Smart Metering.
Proceedings of the 2013 IEEE 26th Computer Security Foundations Symposium, 2013

Fully automated analysis of padding-based encryption in the computational model.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Preface.
J. Comput. Secur., 2012

Verified Security of Redundancy-Free Encryption from Rabin and RSA.
IACR Cryptol. ePrint Arch., 2012

Automated Analysis and Synthesis of Padding-Based Encryption Schemes.
IACR Cryptol. ePrint Arch., 2012

Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.
IACR Cryptol. ePrint Arch., 2012

Computer-Aided Cryptographic Proofs.
Proceedings of the Static Analysis - 19th International Symposium, 2012

Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs.
Proceedings of the Mathematics of Program Construction - 11th International Conference, 2012

Computer-Aided Cryptographic Proofs.
Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

Secure Multi-Execution through Static Program Transformation.
Proceedings of the Formal Techniques for Distributed Systems, 2012

A Formally Verified SSA-Based Middle-End - Static Single Assignment Meets CompCert.
Proceedings of the Programming Languages and Systems, 2012

Cache-Leakage Resilient OS Isolation in an Idealized Model of Virtualization.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

Verified Security of Merkle-Damgård.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs.
Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2011
An Abstract Model of Certificate Translation.
ACM Trans. Program. Lang. Syst., 2011

Secure information flow by self-composition.
Math. Struct. Comput. Sci., 2011

Information-theoretic Bounds for Differentially Private Mechanisms.
IACR Cryptol. ePrint Arch., 2011

Static Enforcement of Information Flow Policies for a Concurrent JVM-like Language.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Verifiable Security of Boneh-Franklin Identity-Based Encryption.
Proceedings of the Provable Security - 5th International Conference, 2011

A Computational Indistinguishability Logic for the Bounded Storage Model.
Proceedings of the Foundations and Practice of Security, 2011

Relational Verification Using Product Programs.
Proceedings of the FM 2011: Formal Methods, 2011

Formally Verifying Isolation and Availability in an Idealized Model of Virtualization.
Proceedings of the FM 2011: Formal Methods, 2011

Beyond Provable Security Verifiable IND-CCA Security of OAEP.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

Computer-Aided Security Proofs for the Working Cryptographer.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Security of multithreaded programs by compilation.
ACM Trans. Inf. Syst. Secur., 2010

Perspectives in Certificate Translation.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

On the Equality of Probabilistic Terms.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Programming Language Techniques for Cryptographic Proofs.
Proceedings of the Interactive Theorem Proving, First International Conference, 2010

A Functional Framework for Result Checking.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

Robustness Guarantees for Anonymity.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

A Machine-Checked Formalization of Sigma-Protocols.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

Computational indistinguishability logic.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
Certificate translation for optimizing compilers.
ACM Trans. Program. Lang. Syst., 2009

Formally Certifying the Security of Digital Signature Schemes.
Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009

Formal certification of code-based cryptographic proofs.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Implementing a Direct Method for Certificate Translation.
Proceedings of the Formal Methods and Software Engineering, 2009

2008
Preservation of Proof Pbligations for Hybrid Verification Methods.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

A Tutorial on Type-Based Termination.
Proceedings of the Language Engineering and Rigorous Software Development, International LerNet ALFA Summer School 2008, Piriapolis, Uruguay, February 24, 2008

Formal Certification of ElGamal Encryption.
Proceedings of the Formal Aspects in Security and Trust, 5th International Workshop, 2008

An Introduction to Certificate Translation.
Proceedings of the Foundations of Security Analysis and Design V, 2008

Certificate translation for specification-preserving advices.
Proceedings of the 7th Workshop on Foundations of Aspect-Oriented Languages, 2008

Certificate Translation in Abstract Interpretation.
Proceedings of the Programming Languages and Systems, 2008

Type-Based Termination with Sized Products.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Tractable Enforcement of Declassification Policies.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Preservation of Proof Obligations from Java to the Java Virtual Machine.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Certificate Translation.
Proceedings of the 5th International Verification Workshop in connection with IJCAR 2008, 2008

Certified Reasoning in Memory Hierarchies.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007
Secure information flow for a concurrent language with scheduling.
J. Comput. Secur., 2007

Security types preserving compilation.
Comput. Lang. Syst. Struct., 2007

The MOBIUS Proof Carrying Code Infrastructure.
Proceedings of the Formal Methods for Components and Objects, 6th International Symposium, 2007

07091 Abstracts Collection - Mobility, Ubiquity and Security.
Proceedings of the Mobility, Ubiquity and Security, 25.02. - 02.03.2007, 2007

07091 Executive Summary - Mobility, Ubiquity and Security.
Proceedings of the Mobility, Ubiquity and Security, 25.02. - 02.03.2007, 2007

2006
Remarks on the equational theory of non-normalizing pure type systems.
J. Funct. Program., 2006

MOBIUS: Mobility, Ubiquity, Security.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Deriving an Information Flow Checker and Certifying Compiler for Java.
Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006

CIC[^( )]: Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions.
Proceedings of the Logic for Programming, 2006

JACK - A Tool for Validation of Security and Behaviour of Java Applications.
Proceedings of the Formal Methods for Components and Objects, 5th International Symposium, 2006

Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant.
Proceedings of the Functional and Logic Programming, 8th International Symposium, 2006

2005
A computational view of implicit coercions in type theory.
Math. Struct. Comput. Sci., 2005

Tool-Assisted Specification and Verification of Typed Low-Level Languages.
J. Autom. Reason., 2005

Preventing Timing Leaks Through Transactional Branching Instructions.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages, 2005

Non-interference for a JVM-like language.
Proceedings of TLDI'05: 2005 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2005

Practical Inference for Type-Based Termination in a Polymorphic Setting.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

Precise Analysis of Memory Consumption using Program Logics.
Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 2005

Proof Obligations Preserving Compilation.
Proceedings of the Formal Aspects in Security and Trust, Third International Workshop, 2005

Formal Methods for Smartcard Security.
Proceedings of the Foundations of Security Analysis and Design III, 2005

2004
Type-based termination of recursive definitions.
Math. Struct. Comput. Sci., 2004

Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming.
J. Funct. Program., 2004

Security Types Preserving Compilation: (Extended Abstract).
Proceedings of the Verification, 2004

A Machine-Checked Formalization of the Random Oracle Model.
Proceedings of the Types for Proofs and Programs, International Workshop, 2004

A Tool-Assisted Framework for Certified Bytecode Verification.
Proceedings of the Fundamental Approaches to Software Engineering, 2004

Formally verifying information flow type systems for concurrent and thread systems.
Proceedings of the 2004 ACM Workshop on Formal Methods in Security Engineering, 2004

Enforcing High-Level Security Properties for Applets.
Proceedings of the Smart Card Research and Advanced Applications VI, 2004

A Machine-Checked Formalization of the Generic Model and the Random Oracle Model.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003
Setoids in type theory.
J. Funct. Program., 2003

Validation of the JavaCard Platform with Implicit Induction Techniques.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Pure patterns type systems.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

2002
Preface.
Proceedings of the International Workshop in Types in Programming, 2002

A Formal Correspondence between Offensive and Defensive JavaCard Virtual Machines.
Proceedings of the Verification, 2002

Efficient Reasoning about Executable Specifications in Coq.
Proceedings of the Theorem Proving in Higher Order Logics, 15th International Conference, 2002

CPS translating inductive and coinductive types.
Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '02), 2002

Compositional Verification of Secure Applet Interactions.
Proceedings of the Fundamental Approaches to Software Engineering, 2002

Tool-Assisted Specification and Verification of the JavaCard Platform.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Weak normalization implies strong normalization in a class of non-dependent pure type systems.
Theor. Comput. Sci., 2001

An induction principle for pure type systems.
Theor. Comput. Sci., 2001

Type Isomorphisms and Proof Reuse in Dependent Type Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

A Formal Executable Semantics of the JavaCard Platform.
Proceedings of the Programming Languages and Systems, 2001

Jakarta: A Toolset for Reasoning about JavaCard.
Proceedings of the Smart Card Programming and Security, 2001

Tipos principales y cierre semi-completo para sistemas de tipos puros extendidos (trabajo en desarrollo).
Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

2000
Domain-free pure type systems.
J. Funct. Program., 2000

Static Reduction Analysis for Imperative Object Oriented Languages.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

Constructor Subtyping in the Calculus of Inductive Constructions.
Proceedings of the Foundations of Software Science and Computation Structures, 2000

An Introduction to Dependent Type Theory.
Proceedings of the Applied Semantics, International Summer School, 2000

1999
CPS Translations and Applications: The Cube and Beyond.
High. Order Symb. Comput., 1999

Type-checking injective pure type systems.
J. Funct. Program., 1999

Order-Sorted Inductive Types.
Inf. Comput., 1999

Expanding the Cube.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

Partial Evaluation and Non-interference for Object Calculi.
Proceedings of the Functional and Logic Programming, 4th Fuji International Symposium, 1999

Constructor Subtyping.
Proceedings of the Programming Languages and Systems, 1999

1998
The Semi-Full Closure of Pure Type Systems.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

The Relevance of Proof-Irrelevance.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Existence and Uniqueness of Normal Forms in Pure Type Systems with betaeta-Conversion.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997
Monadic Type Systems: Pure Type Systems for Impure Settings.
Proceedings of the Second Workshop on Higher-Order Operational Techniques in Semantics, 1997

A notion of classical pure type system.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

Reflections on Reflections.
Proceedings of the Programming Languages: Implementations, 1997

Termination of Algebraic Type Systems: The Syntactic Approach.
Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

Explicit Substitutions for the Lambda-Calculus.
Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1996
Towards Lean Proof Checking.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1996

On the Subject Reduction Property for Algebraic Type Systems.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995
A Two-Level Approach Towards Lean Proof-Checking.
Proceedings of the Types for Proofs and Programs, 1995

Implicit Coercions in Type Systems.
Proceedings of the Types for Proofs and Programs, 1995

Extensions of Pure Type Systems.
Proceedings of the Typed Lambda Calculi and Applications, 1995

Modular Properties of Algebraic Type Systems.
Proceedings of the Higher-Order Algebra, 1995

A Simple Abstract Semantics for Equational Theories.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Congruence Types.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995


  Loading...