Collaborative Research: SHF: Medium: Efficient and Trustworthy Proof Engineering

合作研究：SHF：中：高效且值得信赖的证明工程

• 批准号: 2107206
• 负责人: Leonidas Lampropoulos
• 金额: $ 54万
• 依托单位: University of Maryland, College Park
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2021
• 资助国家: 美国
• 起止时间: 2021-05-01 至 2025-04-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2107206&HistoricalAwards=false
• 关键词: Collaborative; Research; SHF; Medium; Efficient

Formal verification of software in a proof assistant (such as Coq) can establish the correctness of software, preventing software bugs that could otherwise lead to significant financial losses or even loss of life. Unfortunately, proof assistants are not currently well adapted to large-scale software development and are expensive to use in terms of both development time and expertise. The goal of this project is to increase productivity of proof engineers (i.e., users of proof assistants) via techniques that simplify development and maintenance of large verification projects, as well as to increase trustworthiness in the toolchain commonly used by proof engineers. The project's novelties include learning-based and analytical approaches for proof construction, extraction, and maintenance, as well as testing techniques for establishing the trustworthiness of proof assistants. The project's impacts are increased productivity and increased software quality.This project develops techniques that help proof engineers (1) construct proofs by learning and enforcing conventions, automatically locating relevant lemmas, and synthesizing generalized invariants; (2) augment the extraction of executable code from verified artifacts with runtime monitoring for checking assumption violations and with novel support for generating executable variants of logical specifications; and (3) facilitate the maintenance of large proof repositories by detecting brittle proof scripts, as well as learning common transformations. Furthermore, to increase trust in the proof engineering toolchain, the investigators develop testing techniques that target the core components of proof assistants.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

在证明助手（如Coq）中对软件进行正式验证可以确定软件的正确性，防止可能导致重大财务损失甚至生命损失的软件错误。不幸的是，证明助理目前还不能很好地适应大规模的软件开发，并且在开发时间和专业知识方面都很昂贵。该项目的目标是提高证明工程师的生产力（即，证明助理的用户）通过简化大型验证项目的开发和维护的技术，以及增加证明工程师常用的工具链中的可信度。该项目的创新之处包括基于学习和分析的证明构建、提取和维护方法，以及用于建立证明助手可信度的测试技术。该项目的影响是提高生产力和提高软件质量。该项目开发的技术，帮助证明工程师（1）通过学习和执行约定，自动定位相关引理，合成广义不变量来构建证明;（二）通过运行时监控来检查假设违反，并通过对生成逻辑规格;以及（3）通过检测脆弱证明脚本以及学习常见转换来促进大型证明库的维护。此外，为了增加对验证工程工具链的信任，研究人员开发了针对验证助理核心组件的测试技术。该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Deeper Shallow Embeddings

更深浅的嵌入

• 发表时间: 2022
• 期刊: International Conference on Interactive Theorem Proving
• 作者: Prinz, Jacob;Kavvos, G. A.;Lampropoulos, Leonidas
• 通讯作者: Lampropoulos, Leonidas

Random testing of a higher-order blockchain language (experience report)

高阶区块链语言的随机测试（体验报告）

• DOI: 10.1145/3547653
• 发表时间: 2022
• 期刊: Proceedings of the ACM on Programming Languages
• 作者: Hoang, Tram;Trunov, Anton;Lampropoulos, Leonidas;Sergey, Ilya
• 通讯作者: Sergey, Ilya

Computing correctly with inductive relations

利用归纳关系正确计算

• DOI: 10.1145/3519939.3523707
• 发表时间: 2022
• 期刊: Programming Language Design and Implementation
• 作者: Paraskevopoulou, Zoe;Eline, Aaron;Lampropoulos, Leonidas
• 通讯作者: Lampropoulos, Leonidas

Liquid proof macros

防液宏

• DOI: 10.1145/3546189.3549921
• 发表时间: 2022
• 期刊: International Symposium on Haskell
• 作者: Blanchette, Henry;Vazou, Niki;Lampropoulos, Leonidas
• 通讯作者: Lampropoulos, Leonidas

Generating Well-Typed Terms That Are Not “Useless”

生成类型正确但并非“无用”的术语

• DOI: 10.1145/3632919
• 发表时间: 2024
• 期刊: Proceedings of the ACM on Programming Languages
• 作者: Frank, Justin;Quiring, Benjamin;Lampropoulos, Leonidas
• 通讯作者: Lampropoulos, Leonidas