Reynald Affeldt

Orcid: 0000-0002-2327-953X

Affiliations:
  • National Institute of Advanced Industrial Science and Technology, AIST, Japan


According to our database1, Reynald Affeldt authored at least 40 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Comprehensive Overview of the Lebesgue Differentiation Theorem in Coq.
CoRR, 2024

Taming Differentiable Logics with Coq Formalisation.
CoRR, 2024

2023
Measure Construction by Extension in Dependent Type Theory with Application to Integration.
J. Autom. Reason., September, 2023

A Practical Formalization of Monadic Equational Reasoning in Dependent-type Theory.
CoRR, 2023

Semantics of Probabilistic Programs using s-Finite Kernels in Coq.
Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2023

Experimenting with an Intrinsically-Typed Probabilistic Programming Language in Coq.
Proceedings of the Programming Languages and Systems - 21st Asian Symposium, 2023

2022
Towards a Practical Library for Monadic Equational Reasoning in Coq.
Proceedings of the Mathematics of Program Construction - 14th International Conference, 2022

2021
A trustful monad for axiomatic reasoning with probability and nondeterminism.
J. Funct. Program., 2021

2020
A Library for Formalization of Linear Error-Correcting Codes.
J. Autom. Reason., 2020

Extending Equational Monadic Reasoning with Monad Transformers.
Proceedings of the 26th International Conference on Types for Proofs and Programs, 2020

Formal Adventures in Convex and Conical Spaces.
Proceedings of the Intelligent Computer Mathematics - 13th International Conference, 2020

Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
A Hierarchy of Monadic Effects for Program Verification Using Equational Reasoning.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

Proving Tree Algorithms for Succinct Data Structures.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
Safe Low-level Code Generation in Coq Using Monomorphization and Monadification.
J. Inf. Process., 2018

Formalization Techniques for Asymptotic Reasoning in Classical Analysis.
J. Formaliz. Reason., 2018

Examples of Formal Proofs about Data Compression.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
Formal foundations of 3D geometry to model robot manipulators.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Formalization of Reed-Solomon codes and progress report on formalization of LDPC codes.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Formal Verification of the rank Algorithm for Succinct Data Structures.
Proceedings of the Formal Methods and Software Engineering, 2016

2015
Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory.
Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

2014
An Intrinsic Encoding of a Subset of C and its Application to TLS Network Packet Processing.
J. Formaliz. Reason., 2014

Formalization of Shannon's Theorems.
J. Autom. Reason., 2014

What could Coq do for Database Software? - A Progress Report.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Formalization of the variable-length source coding theorem: Direct part.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
On construction of a library of formally verified low-level arithmetic functions.
Innov. Syst. Softw. Eng., 2013

Towards formal verification of TLS network packet processing written in C.
Proceedings of the 7th Workshop on Programming languages meets program verification, 2013

2012
Certifying assembly with formal security proofs: The case of BBS.
Sci. Comput. Program., 2012

Formal network packet processing with minimal fuss: invertible syntax descriptions at work.
Proceedings of the sixth workshop on Programming Languages meets Program Verification, 2012

Formalization of Shannon's Theorems in SSReflect-Coq.
Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

2009
Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables.
Proceedings of the Formal to Practical Security, 2009

2007
Formal Proof of Provable Security by Game-Playing in a Proof Assistant.
Proceedings of the Provable Security, 2007

2006
Formal Verification of the Heap Manager of an Operating System Using Separation Logic.
Proceedings of the Formal Methods and Software Engineering, 2006

An Approach to Formal Verification of Arithmetic Functions in Assembly.
Proceedings of the Advances in Computer Science, 2006

2004
A Coq Library for Verification of Concurrent Programs.
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages, 2004

Partial Order Reduction for Verification of Spatial Properties of Pi-Calculus Processes.
Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

Les espaces d'interaction Vers une géométrie des systèmes d'agents mobiles.
Obj. Logiciel Base données Réseaux, 2004

2002
Supporting objects in run-time bytecode specialization.
Proceedings of the ACM SIGPLAN ASIA-PEPM 2002, 2002

Formalization and Verification of a Mail Server in Coq.
Proceedings of the Software Security -- Theories and Systems, 2002


  Loading...