Formally Verified Certificate Checkers for Hardest-to-Round Computation-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Formally Verified Certificate Checkers for Hardest-to-Round Computation

Published:2014-08-19 Issue:1 Volume:54 Page:1-29
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Martin-Dorel Érik,Hanrot Guillaume,Mayero Micaela,Théry Laurent

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10817-014-9312-2.pdf

Reference35 articles.

1. Augot, D., Pecquet, L.: A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes. IEEE Trans. Inf. Theory 46(7), 2605–2614 (2000)

2. Bernstein, D.J.: Simplified high-speed high-distance list decoding for alternant codes. In: Yang, B.-Y. (ed.) PQCrypto, volume 7071 of LNCS, pp. 200–216. Springer (2011)

3. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer-Verlag (2004)

4. Bertot, Y., Gonthier, G., Biha, S.O., Pasca, I.: Canonical big operators. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal. Proceedings, volume 5170 of LNCS, pp. 86–101. Springer (2008)

5. Boespflug, M., Dénès, M, Grégoire, B.: Full Reduction at Full Throttle. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP, volume 7086 of LNCS, pp. 362–377. Springer (2011)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formalizing Coppersmith’s Method in Isabelle/HOL;Lecture Notes in Computer Science;2024

2. A Verified Implementation of the Berlekamp–Zassenhaus Factorization Algorithm;Journal of Automated Reasoning;2019-06-17

3. A formal proof of Hensel's lemma over the p-adic integers;Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019;2019

4. Taylor Series Revisited;Theoretical Aspects of Computing – ICTAC 2019;2019

5. A formalization of the Berlekamp-Zassenhaus factorization algorithm;Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs;2017-01-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3