Compositional Pre-processing for Automated Reasoning in Dependent Type Theory-Reference-Cited by-同舟云学术

Compositional Pre-processing for Automated Reasoning in Dependent Type Theory

Published:2023-01-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Blot Valentin¹,Cousineau Denis²,Crance Enzo³,de Prisque Louise Dubois¹,Keller Chantal⁴,Mahboubi Assia⁵,Vial Pierre⁶

Affiliation:

1. LMF, France / Inria, France / University of Paris-Saclay, France

2. Mitsubishi, France

3. Nantes Université, France / École Centrale Nantes, France / CNRS, France / Inria, France / LS2N, France / UMR 6004, France / Mitsubishi, France

4. LMF, France / University of Paris-Saclay, France

5. Nantes Université, France / École Centrale Nantes, France / CNRS, France / Inria, France / LS2N, France / UMR 6004, France

6. Inria, France

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3573105.3575676

Reference35 articles.

1. Qinxiang Cao Andrew W. Appel , Lennart Beringer and Josiah Dodds . 2022 . Verifiable C. https://github.com/PrincetonUniversity/VST/raw/master/doc/VC.pdf Qinxiang Cao Andrew W. Appel, Lennart Beringer and Josiah Dodds. 2022. Verifiable C. https://github.com/PrincetonUniversity/VST/raw/master/doc/VC.pdf

2. Verified Software Toolchain

3. Extending SMT Solvers to Higher-Order Logic

4. Fast Reflexive Arithmetic Tactics the Linear Case and Beyond

5. Frédéric Besson . 2017 . ppsimpl: a reflexive Coq tactic for canonising goals . In Coq Workshop on Programming Languages. https://popl17 .sigplan.org/details/main/3/ppsimpl-a-reflexive-Coq-tactic-for-canonising-goals Frédéric Besson. 2017. ppsimpl: a reflexive Coq tactic for canonising goals. In Coq Workshop on Programming Languages. https://popl17.sigplan.org/details/main/3/ppsimpl-a-reflexive-Coq-tactic-for-canonising-goals

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

1. Artifact Report: Trocq: Proof Transfer for Free, With or Without Univalence;Lecture Notes in Computer Science;2024