Realizing the Promise of Higher-Order SMT and Superposition for Interactive Verification
The Nekoka project aims to enhance higher-order SMT and λ-superposition for automated proof assistance, integrating them into tools for software verification and mathematical formalization.
Projectdetails
Introduction
Proof assistants (also called interactive theorem provers) have a long history of being very tedious to use. The situation has improved markedly in the past decade with the integration of first-order automatic theorem provers as backends.
Recent Developments
Recently, there have been exciting developments for more expressive logics, with the emergence of automatic provers based on optimized higher-order calculi.
Project Aim
The Nekoka project's aim is to make higher-order SMT and λ-superposition a perfect fit for logical problems emerging from the verification of software and mathematics.
Implementation Strategy
- We will start by extending higher-order SMT and λ-superposition and implementing them in automatic provers to provide push-button proof automation for lemmas expressed in higher-order logics.
- To reach end users, we will integrate the automatic provers in interactive tools: both general-purpose proof assistants and software verification platforms.
Case Studies
As case studies, we will use our own provers and integrations to:
- Formalize quantum information theory
- Verify a big data framework in collaboration with domain experts.
Community Building
Beyond providing representative case studies, this will help build a user community around our tools and technologies.
Scientific Impact
In terms of scientific impact, the improved higher-order SMT and λ-superposition calculi will substantially advance the art of higher-order automation and help reorient research in automated reasoning towards the needs of end users, whether computer scientists or mathematicians.
Long-term Vision
Our tools will outlive the project, serving end users and continuing to be useful for future research.
Societal Impact
At the societal level, the project will herald a future in which automatic provers and proof assistants are routinely deployed in tandem to:
- Verify critical computing infrastructure
- Formalize research in computer science and mathematics
This will lead to more trustworthy software and science.
Financiële details & Tijdlijn
Financiële details
Subsidiebedrag | € 2.000.000 |
Totale projectbegroting | € 2.000.000 |
Tijdlijn
Startdatum | 1-7-2023 |
Einddatum | 30-6-2028 |
Subsidiejaar | 2023 |
Partners & Locaties
Projectpartners
- LUDWIG-MAXIMILIANS-UNIVERSITAET MUENCHENpenvoerder
Land(en)
Vergelijkbare projecten binnen European Research Council
Project | Regeling | Bedrag | Jaar | Actie |
---|---|---|---|---|
Higher Observational Type TheoryThis project aims to create an innovative type theory that simplifies homotopy type theory by defining equality through computation, enhancing mathematical formalization and software verification. | ERC Consolid... | € 1.897.375 | 2025 | Details |
CertiFOX: Certified First-Order Model ExpansionThis project aims to develop methodologies for ensuring 100% correctness in combinatorial optimization solutions by providing end-to-end proof logging from user specifications to solver outputs. | ERC Consolid... | € 1.999.928 | 2024 | Details |
Formalisation of Constructive Univalent Type TheoryThe project aims to explore the correspondence between dependent type theory and homotopy theory to develop new mathematical foundations and enhance proof systems for complex software and proofs. | ERC Advanced... | € 2.499.776 | 2022 | Details |
Fast Proofs for Verifying ComputationsThe FASTPROOF project aims to enhance computational proof-systems by minimizing interaction, reducing proving time to linear complexity, and optimizing memory usage, while relying on cryptographic assumptions. | ERC Starting... | € 1.435.000 | 2022 | Details |
Web3 Platform for Formal MathematicsDevelop a Web3 platform for formal proofs that connects mathematicians and businesses, integrates AI and blockchain, and rewards contributions to enhance collaboration and verification. | ERC Proof of... | € 150.000 | 2024 | Details |
Higher Observational Type Theory
This project aims to create an innovative type theory that simplifies homotopy type theory by defining equality through computation, enhancing mathematical formalization and software verification.
CertiFOX: Certified First-Order Model Expansion
This project aims to develop methodologies for ensuring 100% correctness in combinatorial optimization solutions by providing end-to-end proof logging from user specifications to solver outputs.
Formalisation of Constructive Univalent Type Theory
The project aims to explore the correspondence between dependent type theory and homotopy theory to develop new mathematical foundations and enhance proof systems for complex software and proofs.
Fast Proofs for Verifying Computations
The FASTPROOF project aims to enhance computational proof-systems by minimizing interaction, reducing proving time to linear complexity, and optimizing memory usage, while relying on cryptographic assumptions.
Web3 Platform for Formal Mathematics
Develop a Web3 platform for formal proofs that connects mathematicians and businesses, integrates AI and blockchain, and rewards contributions to enhance collaboration and verification.