Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

CRETE

Financiado

Certified Refinement Types

Refinement types are a type-based, static verification technique designed to be practical. They enrich the types of an existing programming language with logical predicates to specify program properties and automatically validate... ver más

30/06/2027

IMDEA SOFTWARE INS...

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

IMDEA SOFTWARE INSTITUTE No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5 | 650K€

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2022-01-28

ERC-2021-STG: ERC STARTING GRANTS Scope:Objectives

I+D

Cerrada hace 3 años

0% 100% 100%

1 Participantes

IMDEA SOFTWARE INSTITUTE

1.50M€ | Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

TypeSynth Synthetic Methods in Program Verification 215K€ Cerrado

TIN2016-81699-ERC ESTRUCTURAS DE TIPO Y PRUEBA PARA VERIFICACION DE SOFTWARE C... 75K€ Cerrado

TIN2008-05624 DESARROLLO DE SOFTWARE VERIFICABLE Y EFICIENTE 505K€ Cerrado

AutoProbe Automated Probabilistic Black Box Verification 2M€ Cerrado

CHORDS Compositional Higher-Order Reasoning about Distributed Syste... 2M€ Cerrado

Nekoka Realizing the Promise of Higher-Order SMT and Superposition... 2M€ Cerrado

Duración del proyecto: 65 meses Fecha Inicio: 2022-01-28
Fecha Fin: 2027-06-30

Líder del proyecto

IMDEA SOFTWARE INSTITUTE No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5 | 650K€

Presupuesto del proyecto 2M€

Descripción del proyecto Refinement types are a type-based, static verification technique designed to be practical. They enrich the types of an existing programming language with logical predicates to specify program properties and automatically validate these specifications using SMT solvers. Refinement types are a promising verification technology that in the last decade has spread to mainstream languages (e.g., Haskell, C, Ruby, Scala, and the ML-family) to verify sophisticated properties of real world applications, e.g., safety of cryptographic protocols, memory and resource usage, and web security. The weakness of refinement types is that they do not meet the soundness standards set by theorem provers. A sound verification system accepts as safe only those programs that never violate their specifications. Refinement type checkers (e.g., Liquid Haskell, F*, and Stainless) approximately report five unsoundness bugs per year, as opposed to only one reported by the Coq theorem prover. This rarity of unsoundness bugs in Coq is unsurprising since Coq is designed to soundly machine check mathematical proofs. Coq's soundness design recipe though cannot be directly applied to refinement type checkers that aim to practically verify real world programs. The goal of CRETE is to design a sound and practical refinement type system. This is an ambitious goal that entails the development of a verification system that is as practical as refinement types and constructs machine-checked mathematical proofs. The system will be implemented on refinement type systems for mainstream languages (i.e., Haskell and Rust) and will be evaluated on real-world code, such as web applications and cryptographic protocols. CRETE is high-risk since it aims to develop a novel program logic in which SMT automation co-exists with real world programming. Yet, CRETE is high-gain since it proposes a low-cost, high-profit approach to formal verification that aims to be integrated in mainstream software development.

Conecta tu I+D

Entra hoy

¿Olvidó su contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores