Hola,
Are you new here?

HORNET

financed

Holistic Rigorous Numerical Verification

My goal is to make rigorous numerical verification widely applicable and practically usable. Rigorous verification proves at compile-time that a program computes for all valid inputs what it is expected to. It is especially import... see more

31/12/2029

1M€

Project Budget: 1M€

Project leader

UPPSALA UNIVERSITET No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

PARTICIPATION DEPralty Sin fecha límite de participación.

Financing granted El organismo HORIZON EUROPE notifico la concesión del proyecto The day 2025-01-01

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

I+D

Cerrada does 1 year

0% 100%

characteristics of the participant

Este proyecto no cuenta con búsquedas de partenariado abiertas en este momento.

Private Information

No hay información privada compartida para este proyecto. Habla con el coordinador.

Participantes

Leader

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

Project duration: 59 months Date Start: 2025-01-01
End date: 2029-12-31

Project leader

UPPSALA UNIVERSITET No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Project Budget 1M€

participation deadline Sin fecha límite de participación.

Project description My goal is to make rigorous numerical verification widely applicable and practically usable. Rigorous verification proves at compile-time that a program computes for all valid inputs what it is expected to. It is especially important for numerical programs, which are widely used across application domains and are often safety-critical. However, automated verification of numerical programs over finite-precision (e.g. floating-point) numbers is currently limited. Finite precision introduces rounding errors w.r.t. an ideal, real-valued specification and poses unique challenges for verification of program accuracy and other kinds of desirable properties. As a result, verification of non-trivial numerical programs today requires extensive expert knowledge and mostly manual proofs. Additionally, when verification fails, e.g. because a program is buggy, developers have little debugging help available.I will rethink automated verification and debugging techniques for numerical programs from the ground up with accuracy as a core property. I propose a novel approach for accuracy verification based on deductive relational reasoning that will be able to effectively bound the difference between the specified (real-valued) and actually computed (finite-precision) program results. My verification approach will be modular, automated, integrate with verification of non-accuracy properties and allow safe program optimizations for real-world programs. To further ensure the practical usability of the verifier, I will develop complementary techniques that will help developers to debug unsuccessful verification attempts, by helping to fix specifications, localize faults in the program and communicate effectively with the verifier.I will build on my comprehensive expertise with automated rigorous accuracy analysis and optimization of finite-precision arithmetic, and my recent efforts in deductive verification of floating-point runtime errors and numerical specification inference.

Conecta tu I+D

Entra hoy

Forgot your password?

Financing

Companies

CTIs/Universidades

Projects

researchers