|
[1]
|
Yoshihiro Ishiguro and Reynald Affeldt.
The Radon-Nikodým theorem and the Lebesgue-Stieltjes
measure in Coq.
Computer
Software, 2024.
[ bib ]
To appear. pdf preprint
|
|
[2]
|
Reynald Affeldt and Cyril Cohen.
Measure construction by extension in dependent type theory with
application to integration.
Journal of
Automated Reasoning, 67(3):28:1--28:27, 2023.
[ bib ]
doi arXiv: cs.LO 2209.02345
|
|
[3]
|
Reynald Affeldt, Jacques Garrigue, David Nowak, and Takafumi Saikawa.
A trustful monad for axiomatic reasoning with probability and
nondeterminism.
Journal
of Functional Programming, 31(E17), 2021.
[ bib ]
doi arXiv: cs.LO 2003.09993
|
|
[4]
|
Reynald Affeldt, Jacques Garrigue, and Takafumi Saikawa.
Reasoning with conditional probabilities and joint distributions in
Coq.
Computer
Software, 37(3):79--95, 2020.
[ bib ]
open access doi pdf preprint project page
|
|
[5]
|
Reynald Affeldt, Jacques Garrigue, and Takafumi Saikawa.
A library for formalization of linear error-correcting codes.
Journal of
Automated Reasoning, 64:1123--1164, 2020.
[ bib ]
doi pdf preprint project page
|
|
[6]
|
Reynald Affeldt, Cyril Cohen, and Damien Rouhling.
Formalization techniques for asymptotic reasoning in classical
analysis.
Journal of Formalized Reasoning,
11(1):43--76, 2018.
[ bib ]
open access doi project page
|
|
[7]
|
Akira Tanaka, Reynald Affeldt, and Jacques Garrigue.
Safe low-level code generation in Coq using monomorphization and
monadification.
Journal of Information
Processing, 26:54--72, 2018.
[ bib ]
Reprinted from IPSJ Transactions on Programming 10(6), 2017 open access doi project page
|
|
[8]
|
Reynald Affeldt and Kazuhiko Sakaguchi.
An intrinsic encoding of a subset of C and its application to TLS
network packet processing.
Journal of Formalized
Reasoning, 7(1):63--104, 2014.
[ bib ]
pdf preprint open access doi project page
|
|
[9]
|
Reynald Affeldt, Manabu Hagiwara, and Jonas Sénizergues.
Formalization of Shannon's theorems.
Journal of
Automated Reasoning, 53(1):63--103, 2014.
[ bib ]
doi pdf preprint project page
|
|
[10]
|
Reynald Affeldt.
On construction of a library of formally verified low-level
arithmetic functions.
Innovations in
Systems and Software Engineering, 9(2):59--77, 2013.
[ bib ]
NASA/Springer doi pdf preprint project page
|
|
[11]
|
Reynald Affeldt, David Nowak, and Kiyoshi Yamada.
Certifying assembly with formal security proofs: the case of BBS.
Science
of Computer Programming, 77(10--11):1058--1074, 2012.
[ bib ]
doi pdf preprint project page
|
|
[12]
|
Reynald Affeldt and Hubert Comon-Lundh.
Verification of security protocols with a bounded number of sessions
based on resolution for rigid variables.
In Formal to Practical Security, volume 5458 of Lecture
Notes in Computer Science, State-of-the-Art Survey, pages 1--20. Springer,
May 2009.
[ bib ]
doi pdf preprint project page
|
|
[13]
|
Nicolas Marti and Reynald Affeldt.
A certified verifier for a fragment of separation logic.
Computer
Software, 25(3):135--147, 2008.
[ bib ]
Japan Society for Software Science and Technology. Iwanami Shoten open access doi project page Reprinted to Information and Media Technologies 4(2):304--316, 2009 doi pdf preprint
|
|
[14]
|
Reynald Affeldt, Naoki Kobayashi, and Akinori Yonezawa.
Verification of concurrent programs using the Coq proof assistant:
a case study.
IPSJ Transactions on Programming, 46(SIG1(PRO24)):110--120,
2005.
[ bib ]
Information Processing Society of Japan. Reprinted to IPSJ Digital Courier 1:117--127, 2005 open access doi pdf preprint project page
|
|
[1]
|
Reynald Affeldt and Ayumu Saito.
Experimenting with an intrinsically-typed probabilistic programming
language in Coq.
In 21st Asian Symposium on Programming Languages and Systems
(APLAS 2023), Taipei,
Taiwan, November 26--29, 2023, volume 14405, pages 182--202. Springer, Nov
2023.
[ bib ]
doi pdf preprint
|
|
[2]
|
Reynald Affeldt, Cyril Cohen, and Ayumu Saito.
Semantics of probabilistic programs using s-finite kernels in Coq.
In 12th ACM SIGPLAN Conference on Certified Programs and Proofs
(CPP 2023), Boston, MA, USA,
January 16--17, 2023, pages 3--16. ACM Press, Jan 2023.
[ bib ]
doi open access
|
|
[3]
|
Ayumu Saito and Reynald Affeldt.
Towards a practical library for monadic equational reasoning in
Coq.
In 14th International Conference on Mathematics of Program
Construction (MPC 2022), Tbilisi,
Georgia, September 26--28, 2022, volume 13544 of Lecture Notes in
Computer Science, pages 151--177. Springer, Sep 2022.
[ bib ]
pdf preprint doi project page
|
|
[4]
|
Reynald Affeldt and David Nowak.
Extending equational monadic reasoning with monad transformers.
In 26th International Conference on Types for Proofs and
Programs (TYPES 2020), volume 188 of
Leibniz International Proceedings in Informatics, pages 2:1--2:21.
Schloss Dagstuhl, Jun 2021.
[ bib ]
doi Post-Proceedings. arXiv preprint cs.LO 2011.03463
|
|
[5]
|
Reynald Affeldt, Jacques Garrigue, and Takafumi Saikawa.
Formal adventures in convex and conical spaces.
In 13th Conference on Intelligent Computer Mathematics
(CICM 2020), Bertinoro, Forli,
Italy, July 26--31, 2020, volume 12236 of Lecture Notes in Artificial
Intelligence, pages 23--38. Springer, Jul 2020.
[ bib ]
doi open access
|
|
[6]
|
Reynald Affeldt, Cyril Cohen, Marie Kerjean, Assia Mahboubi, Damien Rouhling,
and Kazuhiko Sakaguchi.
Competing inheritance paths in dependent type theory: a case study in
functional analysis.
In 10th International Joint Conference on Automated Reasoning
(IJCAR 2020), Paris, France, June 29--July 6,
2020, volume 12167 of Lecture Notes in Artificial Intelligence, pages
3--20. Springer, Jul 2020.
[ bib ]
doi open access
|
|
[7]
|
Reynald Affeldt, David Nowak, and Takafumi Saikawa.
A hierarchy of monadic effects for program verification using
equational reasoning.
In 13th International Conference on Mathematics of Program
Construction (MPC 2019),
Porto, Portugal, October 7--9, 2019, volume 11825 of Lecture Notes in
Computer Science, pages 226--254. Springer, Oct 2019.
[ bib ]
doi pdf preprint project page
|
|
[8]
|
Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, and Kazunari Tanaka.
Proving tree algorithms for succinct data structures.
In 10th International Conference on Interactive Theorem Proving
(ITP 2019), Portland, OR, USA, September
8-13, 2019, volume 141 of Leibniz International Proceedings in
Informatics, pages 28:1--28:19. Schloss Dagstuhl, Sep 2019.
[ bib ]
open access doi pdf preprint project page
|
|
[9]
|
Reynald Affeldt, Jacques Garrigue, and Takafumi Saikawa.
Examples of formal proofs about data compression.
In International Symposium on Information Theory and Its
Applications (ISITA 2018),
Singapore, October 28--31, 2018, pages 633--637. IEEE, Oct 2018.
[ bib ]
doi pdf preprint project page
|
|
[10]
|
Reynald Affeldt and Cyril Cohen.
Formal foundations of 3D geometry to model robot manipulators.
In 6th ACM SIGPLAN Conference on Certified Programs and Proofs
(CPP 2017), Paris, France, January
16--17, 2017, pages 30--42. ACM Press, Jan 2017.
[ bib ]
doi pdf preprint project page slides
|
|
[11]
|
Akira Tanaka, Reynald Affeldt, and Jacques Garrigue.
Formal verification of the rank algorithm for succinct data
structures.
In 18th International Conference on Formal Engineering Methods
(ICFEM 2016), Tokyo, Japan, November 14--18, 2016, volume 10009 of
Lecture Notes in Computer Science, pages 243--260. Springer, Nov 2016.
[ bib ]
doi pdf preprint project page
|
|
[12]
|
Reynald Affeldt, Jacques Garrigue, and Takafumi Saikawa.
Formalization of Reed-Solomon codes and progress report on
formalization of LDPC codes.
In International Symposium on Information Theory and Its
Applications (ISITA 2016),
Monterey, California, USA, October 30--November 2, 2016, pages 537--541.
IEICE. IEEE Xplore, Oct 2016.
[ bib ]
doi pdf preprint project page
|
|
[13]
|
Reynald Affeldt and Jacques Garrigue.
Formalization of error-correcting codes: from Hamming to modern
coding theory.
In 6th Conference on Interactive Theorem Proving
(ITP 2015), Nanjing,
China, August 24--27, 2015, volume 9236 of Lecture Notes in Computer
Science, pages 17--33. Springer, Aug 2015.
[ bib ]
doi pdf preprint project page
|
|
[14]
|
Ryosuke Obi, Manabu Hagiwara, and Reynald Affeldt.
Formalization of variable-length source coding theorem: Direct part.
In International Symposium on Information Theory and Its
Applications (ISITA 2014), Melbourne, Australia, October 26--29, 2014, pages
201--205. IEICE. IEEE Xplore, Oct 2014.
[ bib ]
|
|
[15]
|
Reynald Affeldt and Nicolas Marti.
Towards formal verification of TLS network packet processing
written in C.
In 7th ACM SIGPLAN Workshop on Programming Languages meets
Program Verification (PLPV 2013), Rome,
Italy, January 22, 2013, pages 35--46. ACM Press, Jan 2013.
[ bib ]
doi pdf preprint
|
|
[16]
|
Reynald Affeldt and Manabu Hagiwara.
Formalization of Shannon's theorems in SSReflect-Coq.
In 3rd Conference on Interactive Theorem Proving
(ITP 2012), Princeton, New Jersey,
USA, August 13--15, 2012, volume 7406 of Lecture Notes in Computer
Science, pages 233--249. Springer, Aug 2012.
[ bib ]
doi pdf preprint project page slides
|
|
[17]
|
Reynald Affeldt.
On construction of a library of formally verified low-level
arithmetic functions.
In 27th ACM SIGAPP Symposium On Applied Computing
(SAC 2012), Riva del Garda
(Trento), Italy, March 26--30, 2012, volume 2, pages 1326--1331. ACM Press,
Mar 2012.
[ bib ]
pdf preprint doi Software Verification and Testing Track project page
|
|
[18]
|
Reynald Affeldt, David Nowak, and Yutaka Oiwa.
Formal network packet processing with minimal fuss: Invertible syntax
descriptions at work.
In 6th ACM SIGPLAN Workshop on Programming Languages meets
Program Verification (PLPV 2012), Philadelphia, USA, January 24, 2012, pages
27--36. ACM Press, Jan 2012.
[ bib ]
pdf preprint doi
|
|
[19]
|
Reynald Affeldt, David Nowak, and Kiyoshi Yamada.
Certifying assembly with formal cryptographic proofs: the case of
BBS.
In
Electronic
Communications of the EASST, volume 23. European Association of Software
Science and Technology, Jan 2010.
[ bib ]
doi pdf preprint project page Proceedings of the 9th International Workshop on Automated Verification of Critical Systems (AVoCS 2009), Swansea University Computer Science, September 23--25, 2009. Preliminary version: Technical Report of Computer Science, Swansea University CSR-2-2009
|
|
[20]
|
Reynald Affeldt and Hubert Comon-Lundh.
A note on first-order logic and security protocols.
In Joint Workshop on Foundations of Computer Security, Automated
Reasoning for Security Protocol Analysis and Issues in the Theory of Security
(FCS-ARSPA-WITS
2008), Pittsburgh, PA, USA, June 21--22, 2008, pages 11--20, Jun 2008.
[ bib ]
pdf preprint project page
|
|
[21]
|
Reynald Affeldt, Miki Tanaka, and Nicolas Marti.
Formal proof of provable security by game-playing in a proof
assistant.
In 1st International Conference on Provable Security (Provsec
2007), Wollongong, NSW, Australia, November 1--2, 2007, volume 4784 of
Lecture Notes in Computer Science, pages 151--168. Springer, Nov 2007.
[ bib ]
doi pdf preprint
|
|
[22]
|
Reynald Affeldt and Nicolas Marti.
An approach to formal verification of arithmetic functions in
assembly.
In 11th Annual Asian Computing Science Conference (ASIAN 2006),
Focusing on Secure Software and Related Issues, Tokyo, Japan, December 6--8,
2006, volume 4435 of Lecture Notes in Computer Science, pages
346--360. Springer, Jan 2008.
[ bib ]
doi pdf preprint project page
|
|
[23]
|
Nicolas Marti, Reynald Affeldt, and Akinori Yonezawa.
Formal verification of the heap manager of an operating system using
separation logic.
In 8th International Conference on Formal Engineering Methods
(ICFEM 2006), Macao SAR, China, October 29--November 3, 2006, volume 4260 of
Lecture Notes in Computer Science, pages 400--419. Springer, Oct 2006.
[ bib ]
doi pdf preprint
|
|
[24]
|
Reynald Affeldt and Naoki Kobayashi.
Partial order reduction for verification of spatial properties of
pi-calculus processes.
Electronic Notes in Theoretical Computer Science,
128(2):151--168, Apr 2005.
[ bib ]
doi Elsevier. Proceedings of the 11th International Workshop on Expressiveness in Concurrency (EXPRESS 2004), London, UK, August 30, 2004 pdf preprint pdf preprint
|
|
[25]
|
Reynald Affeldt and Naoki Kobayashi.
A Coq library for verification of concurrent programs.
Electronic Notes in Theoretical Computer Science, 199:17--32,
Feb 2008.
[ bib ]
doi pdf preprint project page Elsevier. Proceedings of the 4th International Workshop on Logical Frameworks and Meta-Languages (LFM 2004), Cork, Ireland, July 5, 2004
|
|
[26]
|
Reynald Affeldt and Naoki Kobayashi.
Formalization and verification of a mail server in Coq.
In International Symposium on Software Security, Tokyo, Japan,
November 8--10, 2002, volume 2609 of Lecture Notes in Computer Science,
Hot Topics, pages 217--233. Springer, Feb 2003.
[ bib ]
doi pdf preprint slides
|
|
[27]
|
Reynald Affeldt, Hidehiko Masuhara, Eijiro Sumii, and Akinori Yonezawa.
Supporting objects in run-time bytecode specialization.
In ACM SIGPLAN Asian Symposium on Partial Evaluation and
Semantics-based Program Manipulation (ASIA-PEPM 2002), Aizu, Japan, September
12--14, 2002, pages 50--60. ACM Press, Sep 2002.
[ bib ]
doi pdf preprint slides
|
|
[1]
|
Ayumu Saito and Reynald Affeldt.
An intrinsically-typed probabilistic programming language in Coq
(extended abstract).
The Workshop on Type-Driven Development (TyDe 2023), Seattle,
Washington, United States, September 4, 2023, Sep 2023.
[ bib ]
pdf preprint open access
|
|
[2]
|
Reynald Affeldt, Jacques Garrigue, and Takafumi Saikawa.
Environment-friendly monadic equational reasoning for OCaml.
The Coq Workshop 2023, Białystok, Poland, July 31, 2023, Jul 2023.
[ bib ]
pdf preprint project page open access
|
|
[3]
|
Reynald Affeldt and Cyril Cohen.
Formalization of the Lebesgue measure in MathComp-Analysis.
The Coq Workshop 2021, online, July 2, 2021, Jul 2021.
[ bib ]
pdf preprint project page open access
|
|
[4]
|
Reynald Affeldt, Xavier Allamigeon, Yves Bertot, Quentin Canu, Cyril Cohen,
Pierre Roux, Kazuhiko Sakaguchi, Enrico Tassi, Laurent Théry, and Anton
Trunov.
Porting the Mathematical Components library to Hierarchy Builder.
The Coq Workshop 2021, online, July 2, 2021, Jul 2021.
[ bib ]
open access
|
|
[5]
|
Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, and Kazunari Tanaka.
Experience report: Type-driven development of certified tree
algorithms in Coq.
The Coq Workshop 2019, Portland, OR, USA, September 8, 2019, Sep
2019.
[ bib ]
open access
|
|
[6]
|
Reynald Affeldt, Cyril Cohen, Assia Mahboubi, Damien Rouhling, and Pierre-Yves
Strub.
Classical analysis with Coq.
The Coq Workshop 2018, Oxford, UK, July 8, 2018, Jul 2018.
[ bib ]
project page pdf preprint
|
|
[7]
|
Reynald Affeldt and Jacques Garrigue.
Formalization of error-correcting codes using SSReflect.
The 6th Coq Workshop, Vienna, Austria, July 7, 2014, Jul 2014.
[ bib ]
project page
|
|
[8]
|
Reynald Affeldt and Kazuhiko Sakaguchi.
First building blocks for implementations of security protocols
verified in Coq.
The 5th Coq Workshop, Rennes, France, July 22, 2013, Jul 2013.
[ bib ]
project page
|
|
[9]
|
Nicolas Marti, Reynald Affeldt, and Akinori Yonezawa.
Verification of the heap manager of an operating system using
separation logic.
The 3rd Workshop on Semantics, Program Analysis, and Computing
Environments for Memory Management (SPACE 2006), Charleston SC, USA, January
14, 2006, Jan 2006.
[ bib ]
pdf preprint Informal proceedings. Pages 61--72 slides project page
|
|
[1]
|
Reynald Affeldt and Zachary Stone.
Towards the fundamental theorem of calculus for the Lebesgue
integral in Coq.
In 35st Journées Francophones des Langages Applicatifs (JFLA
2024), Saint-Jacut-de-la-Mer, France, January 30--February 2, pages
300--304. Inria and others, Jan 2024.
[ bib ]
open access
|
|
[2]
|
Yoshihiro Ishiguro and Reynald Affeldt.
A progress report on formalization of measure theory with
MathComp-Analysis.
In 25th Workshop on Programming and Programming Languages
(PPL2023), Nagoya University, March 6--8, 2023, Mar 2023.
[ bib ]
15 pages. pdf preprint conference website
|
|
[3]
|
Ayumu Saito and Reynald Affeldt.
Practical aspects of monadic equational reasoning in Coq.
In 24th Workshop on Programming and Programming Languages
(PPL2022), March 6--8, 2022, Mar 2022.
[ bib ]
17 pages. pdf preprint conference website
|
|
[4]
|
Célestine Sauvage, Reynald Affeldt, and David Nowak.
Vers la formalisation en Coq des transformateurs de monades
modulaires.
In 31st Journées Francophones des Langages Applicatifs (JFLA
2020), Gruissan, France, January 29--February 1, pages 23--30. CEA List and
others, Jan 2020.
[ bib ]
pdf preprint open access
|
|
[5]
|
Reynald Affeldt, Jacques Garrigue, and Takafumi Saikawa.
Reasoning with conditional probabilities and joint distributions in
Coq.
In 21st Workshop on Programming and Programming Languages
(PPL2019), Iwate-ken, Hanamaki-shi, March 6--8, 2019, Mar 2019.
[ bib ]
16 pages. pdf preprint conference website
|
|
[6]
|
Akira Tanaka, Reynald Affeldt, and Jacques Garrigue.
Formal verification of the rank function for succinct data
structures.
In 18th Workshop on Programming and Programming Languages
(PPL2016), Okayama-ken, Tamano-shi, March 7--9, 2016, Mar 2016.
[ bib ]
15 pages. Best paper award conference website project page
|
|
[7]
|
Yoichi Hirai and Reynald Affeldt.
What could Coq do for database software?---a progress report.
In 25th Journées Francophones des Langages Applicatifs (JFLA
2014), Fréjus, France, January 8--11, pages 33--48, Jan 2014.
[ bib ]
|
|
[8]
|
Reynald Affeldt.
Toward formal construction of assembly arithmetic functions from
pseudo-code.
In 12th Workshop on Programming and Programming Languages
(PPL2010), Kagawa-ken, Kotohira Onsen, March 3--5, 2010, pages 1--14, Mar
2010.
[ bib ]
pdf preprint conference website project page
|
|
[9]
|
Nicolas Marti and Reynald Affeldt.
A certified verifier for a fragment of separation logic.
In 9th Workshop on Programming and Programming Languages
(PPL2007), Ishikawa-ken, Kaga-shi, March 8--10, 2007, pages 187--199, Mar
2007.
[ bib ]
Best paper award project page
|
|
[1]
|
Reynald Affeldt and David Nowak.
Experimenting with monadic equational reasoning in Coq.
In the proceedings of the 35th Meeting of the Japan Society for
Software Science and Technology
(JSSST 2018), Osaka-fu, Suita-shi,
August 29--31, 2018, Aug 2018.
[ bib ]
14 pages project page pdf preprint
|
|
[2]
|
Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, and Kazunari Tanaka.
Proving tree algorithms for succinct data structures.
In the proceedings of the 35th Meeting of the Japan Society for
Software Science and Technology
(JSSST 2018), Osaka-fu, Suita-shi,
August 29--31, 2018, Aug 2018.
[ bib ]
13 pages project page pdf preprint
|
|
[3]
|
Akira Tanaka, Reynald Affeldt, and Jacques Garrigue.
Extension of a C code generator for Coq with a linearity checker.
In the proceedings of the 35th Meeting of the Japan Society for
Software Science and Technology
(JSSST 2018), Osaka-fu, Suita-shi,
August 29--31, 2018, Aug 2018.
[ bib ]
11 pages (in Japanese) pdf preprint
|
|
[4]
|
Reynald Affeldt and Cyril Cohen.
Formal foundations for rigid body transformation.
In the proceedings of the 33rd Meeting of the Japan Society for
Software Science and Technology
(JSSST 2016), Miyagi-ken,
Sendai-shi, September 6--9, 2016, Sep 2016.
[ bib ]
11 pages project page pdf preprint
|
|
[5]
|
Reynald Affeldt.
An intrinsic encoding of a subset of C and its application to TLS
network packet processing.
In Annual Workshop of the Japan Society for Industrial and
Applied Mathematics 2015, Kanazawa University, Kakuma campus, September 9-11,
2015, pages 306--307, Sep 2015.
[ bib ]
project page pdf preprint
|
|
[6]
|
Reynald Affeldt and Jacques Garrigue.
Formalization of error-correcting codes using SSReflect.
In MI Lecture Note Workshop on Theorem proving and provers for
reliable theory and implementations (TPP2014), Kyushu University, December
3--5, 2014, volume 61, pages 76--78, Dec 2014.
[ bib ]
project page
|
|
[7]
|
Reynald Affeldt.
Formalization of Shannon's theorems using the Coq
proof-assistant.
In proceedings of the 2013 IEICE General Conference, The
Institute of Electronics, Information and Communication Engineers, Fukuoka
Institute of Technology, September 17--20, 2013, pages 39--44, Sep 2013.
[ bib ]
pdf preprint project page conference website IEICE, Technical Committee on Information Theory
|
|
[8]
|
Reynald Affeldt.
About the formal verification of Shannon's theorems.
In COE Lecture Note Kyushu University Institute of Mathematics
for Industry, Workshop of the Joint Research Projects: From Modern Coding
Theory To Postmodern Coding Theory, Kyushu University, March 4--7, 2013,
volume 44, pages 86--94, Mar 2013.
[ bib ]
pdf preprint project page
|
|
[9]
|
Reynald Affeldt.
Toward a library of verified arithmetic functions.
In Annual Workshop of the Japan Society for Industrial and
Applied Mathematics 2011, Doshisha University, September 14--16, 2011, pages
377--378, Sep 2011.
[ bib ]
project page
|
|
[10]
|
Reynald Affeldt and Kiyoshi Yamada.
Formal verification of C programs for implementations of
communication protocols.
In the proceedings of the 28th Meeting of the Japan Society for
Software Science and Technology
(JSSST 2011), Okinawa-ken,
Naha-shi, September 26--29, 2011, Sep 2011.
[ bib ]
pdf preprint project page
|
|
[11]
|
Reynald Affeldt, David Nowak, and Kiyoshi Yamada.
Certifying assembly with formal cryptographic proofs: the case of
BBS.
In Annual Workshop of the Japan Society for Industrial and
Applied Mathematics 2009
(JSIAM 2009),
Osaka University, September 28--30, 2009, pages 53--54, Sep 2009.
[ bib ]
pdf preprint slides (in Japanese) project page
|
|
[12]
|
Reynald Affeldt and Hubert Comon-Lundh.
Towards verification with no false attack of security protocols in
first-order logic.
In Annual Workshop of the Japan Society for Industrial and
Applied Mathematics 2008
(JSIAM 2008),
The University of Tokyo, Kashiwa campus, September 17--19, 2008, pages
177--178, Sep 2008.
[ bib ]
pdf preprint slides project page
|
|
[13]
|
Reynald Affeldt and Yusuke Kawamoto.
Report on FCS-ARSPA-WITS, CSF, FCC'08---about automated
verification and certification.
In Annual Workshop of the Japan Society for Industrial and
Applied Mathematics 2008, The University of Tokyo, Kashiwa campus, September
17--19, 2008, pages 187--188, Sep 2008.
[ bib ]
|
|
[14]
|
Yusuke Kawamoto and Reynald Affeldt.
Report on FCS-ARSPA-WITS, CSF, FCC'08---about formalization of
security properties.
In Annual Workshop of the Japan Society for Industrial and
Applied Mathematics 2008, The University of Tokyo, Kashiwa campus, September
17--19, 2008, pages 185--186, Sep 2008.
[ bib ]
(in Japanese)
|
|
[15]
|
Reynald Affeldt, Miki Tanaka, and Nicolas Marti.
Formal proof of provable security by game-playing in a proof
assistant.
In Annual Workshop of the Japan Society for Industrial and
Applied Mathematics 2017
(JSIAM 2007), Hokkaido
University, September 15--17, 2007, pages 44--45, Sep 2007.
[ bib ]
pdf preprint (in Japanese)
|
|
[16]
|
Reynald Affeldt and Nicolas Marti.
Formal verification of arithmetic functions in SmartMIPS assembly.
In the proceedings of the 23rd Meeting of the Japan Society for
Software Science and Technology, The University of Tokyo, Hongo campus,
September 13--15, 2006, Sep 2006.
[ bib ]
pdf preprint project page
|
|
[17]
|
Nicolas Marti, Reynald Affeldt, and Akinori Yonezawa.
Model-checking of a multi-threaded operating system.
In the proceedings of the 23rd Meeting of the Japan Society for
Software Science and Technology, The University of Tokyo, Hongo campus,
September 13--15, 2006, Sep 2006.
[ bib ]
pdf preprint project page
|
|
[18]
|
Nicolas Marti, Reynald Affeldt, and Akinori Yonezawa.
Towards formal verification of memory properties using separation
logic.
In the proceedings of the 22nd Meeting of the Japan Society for
Software Science and Technology, Tohoko University, Aobayama campus,
September 13--15, 2005, Sep 2005.
[ bib ]
pdf preprint slides project page
|
|
[19]
|
Reynald Affeldt, Hidehiko Masuhara, Eijiro Sumii, and Akinori Yonezawa.
Supporting objects in run-time bytecode specialization.
In the proceedings of the 18th Meeting of the Japan Society for
Software Science and Technology
(JSSST 2011), Future
University Hakodate, September 18--20, 2001, Sep 2001.
[ bib ]
pdf preprint
|
|
[1]
|
Reynald Affeldt and Zachary Stone.
The fundamental theorem of calculus for the Lebesgue integral in
MathComp-Analysis.
Oct 2023.
[ bib ]
19th Theorem Proving and Provers Meeting (TPP2023), Tokyo Institute of Technology, 2023/10/30
|
|
[2]
|
Ayumu Saito and Reynald Affeldt.
A tentative formalization of a syntax for a probabilistic programming
language.
Mar 2023.
[ bib ]
Poster. 25th Workshop on Programming and Programming Languages (PPL2023), Nagoya University, 2023/03/06-07
|
|
[3]
|
Reynald Affeldt and Cyril Cohen.
Formalization of integration theory in Coq.
Mar 2022.
[ bib ]
Poster. 24th Workshop on Programming and Programming Languages (PPL2022), 2022/03/08
|
|
[4]
|
Reynald Affeldt and Cyril Cohen.
Progress report on the formalization of the Lebesgue integral in
MathComp-Analysis.
Nov 2021.
[ bib ]
17th Theorem Proving and Provers Meeting (TPP2021), Kitami Institute of Technology, 2021/11/22
|
|
[5]
|
Ayumu Saito and Reynald Affeldt.
Extending Monae to formalize quicksort using monads in Coq.
Nov 2021.
[ bib ]
17th Theorem Proving and Provers Meeting (TPP2021), Kitami Institute of Technology, 2021/11/22
|
|
[6]
|
Reynald Affeldt and Cyril Cohen.
Formalization of measure theory in Coq.
Mar 2021.
[ bib ]
Poster. 23rd Workshop on Programming and Programming Languages (PPL2021), 2021/03/08
|
|
[7]
|
Akira Tanaka, Reynald Affeldt, and Jacques Garrigue.
Future work towards a Coq library of succinct data structures.
Mar 2018.
[ bib ]
Poster. 20th Workshop on Programming and Programming Languages (PPL2018), Tottori-ken, Yonago-shi, 2018/03/06
|
|
[8]
|
Reynald Affeldt.
Toward a library for information theory and error-correcting codes.
2017.
[ bib ]
13th Theorem Proving and Provers Meeting (TPP2017), Kyoto University, 2017/12/07, (in Japanese)
|
|
[9]
|
Akira Tanaka, Reynald Affeldt, and Jacques Garrigue.
Safe low-level code generation in Coq using monomorphization and
monadification.
2017.
[ bib ]
The 114th Meeting of the IPSJ SIG on Programming (PRO114), Shizuoka-shi, 2017/06/09
|
|
[10]
|
Akira Tanaka, Reynald Affeldt, and Jacques Garrigue.
Certified mon{omorphiz|adific}ation of Gallina for low-level
code extraction.
Mar 2017.
[ bib ]
Poster. 19th Workshop on Programming and Programming Languages (PPL2017), Yamanashi-ken, Fuefuki-shi, 2017/03/09
|
|
[11]
|
Reynald Affeldt.
Report on the Coq coding sprint.
Sep 2015.
[ bib ]
11th Theorem Proving and Provers Meeting (TPP2015), Kanagawa University, Shonan Hiratsuka campus, 2015/09/17, (in Japanese)
|
|
[12]
|
Reynald Affeldt and Kazuhiko Sakaguchi.
Demo of a Coq library for verification of C programs.
Mar 2014.
[ bib ]
Poster. 16th Workshop on Programming and Programming Languages (PPL2014), Kumamoto-ken, Aso-shi, 2014/03/05, (in Japanese)
|
|
[13]
|
Reynald Affeldt and Kazuhiko Sakaguchi.
Presentation of a Coq library for formal verification of C
programs.
Nov 2013.
[ bib ]
9th Theorem Proving and Provers Meeting (TPP2013), Shinshu University, 2013/11/21, (in Japanese) pdf preprint
|
|
[14]
|
Reynald Affeldt and Kazuhiko Sakaguchi.
First building blocks for implementations of security protocols
verified in Coq.
Sep 2013.
[ bib ]
Poster. 30th Meeting of the Japan Society for Software Science and Technology, The University of Tokyo, Hongo campus, 2013/09/10
|
|
[15]
|
Reynald Affeldt, Manabu Hagiwara, and Jonas Sénizergues.
Formal verification of Shannon's theorems.
Nov 2012.
[ bib ]
8th Theorem Proving and Provers Meeting (TPP2012), Chiba University, 2012/11/21
|
|
[16]
|
Reynald Affeldt and Manabu Hagiwara.
Formalization of Shannon's theorems.
Mar 2012.
[ bib ]
Annual Spring Meeting of the Japan Society for Industrial and Applied Mathematics 2012, Kyushu University, 2012/03/08, (in Japanese)
|
|
[17]
|
Reynald Affeldt.
On construction of a library of formally verified low-level
arithmetic functions.
Nov 2011.
[ bib ]
7th Theorem Proving and Provers Meeting (TPP2011), National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba Central, 2011/11/17
|
|
[18]
|
Reynald Affeldt and Kiyoshi Yamada.
Mechanical verification of C programs using separation logic.
Mar 2011.
[ bib ]
Poster. 13th Workshop on Programming and Programming Languages (PPL2011), Hokkaido, Sapporo, 2011/03/10
|
|
[19]
|
Reynald Affeldt.
Instrumenting error-correcting codes with SSReflect.
Nov 2010.
[ bib ]
6th Theorem Proving and Provers Meeting (TPP2010), Nagoya University, 2010/11/26
|
|
[20]
|
Reynald Affeldt.
A note about the formalization of error-correcting codes using
SSReflect.
Mar 2010.
[ bib ]
Annual Spring Meeting of the Japan Society for Industrial and Applied Mathematics 2010 (JSIAM Spring 2010), Tsukuba University, 2010/03/08, (in Japanese) slides
|
|
[21]
|
Reynald Affeldt, David Nowak, and Kiyoshi Yamada.
Certifying assembly with formal cryptographic proofs: the case of
BBS.
Nov 2009.
[ bib ]
5th Theorem Proving and Provers Meeting (TPP2009), Kwansei Gakuin University, 2009/11/21
|
|
[22]
|
Reynald Affeldt.
Verification in coq of an implementation of modular exponentiation
for an embedded system.
Mar 2009.
[ bib ]
Poster. 11th Workshop on Programming and Programming Languages (PPL2009), Gifu-ken, Takayama-shi, 2009/03/09 poster file
|
|
[23]
|
Reynald Affeldt.
Verification of security protocols with a bounded number of sessions
based on resolution for rigid variables.
Nov 2008.
[ bib ]
4th Theorem Proving and Provers Meeting (TPP2008), Tohoko University, 2008/11/26
|
|
[24]
|
Nicolas Marti, Reynald Affeldt, and Akinori Yonezawa.
Tools and experiments for formal verification of operating systems.
Mar 2006.
[ bib ]
Poster. 8th Workshop on Programming and Programming Languages (PPL2006), Shiga-ken, Ootsu-shi, 2006/03/05
|
|
[25]
|
Reynald Affeldt, Naoki Kobayashi, and Akinori Yonezawa.
Verification of concurrent programs using the Coq theorem prover: a
case study.
Jul 2004.
[ bib ]
Summer United Workshops on Parallel, Distributed and Cooperative Processing (SWoPP 2004), Aomori, 2004/07/30
|
日本語版