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

FINABIS

Financiado

Finite-state abstractions of infinite-state systems

The algorithmic analysis of infinite-state systems is a central topic of theoretical computer science that is part of a popular approach to software verification. While analyzing infinite-state systems is indispensable when verif... ver más

31/12/2027

MPG

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

MAXPLANCKGESELLSCHAFT ZUR FORDERUNG DER WISSE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

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

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

I+D

Cerrada hace 2 años

0% 100% 100%

1 Participantes

MPG

1.48M€ | 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

RYC-2016-20281 Algorithmic Analysis of Infinite-State Systems 309K€ Cerrado

INFSYS Challenging Problems in Infinite State Systems 1M€ Cerrado

AVS-ISS Analysis Verification and Synthesis for Infinite State Sys... 2M€ Cerrado

LASD Logic and Automata over Sequences with Data 2M€ Cerrado

ADVANSYNT Theoretical Foundations of Advanced Synthesis 2M€ Cerrado

TIN2010-20967-C04-03 TEORIA, APLICACIONES Y SINERGIA EN SAT, CSP Y FDL 77K€ Cerrado

Duración del proyecto: 60 meses Fecha Inicio: 2022-12-20
Fecha Fin: 2027-12-31

Líder del proyecto

MAXPLANCKGESELLSCHAFT ZUR FORDERUNG DER WISSE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 1M€

Descripción del proyecto The algorithmic analysis of infinite-state systems is a central topic of theoretical computer science that is part of a popular approach to software verification. While analyzing infinite-state systems is indispensable when verifying software, finite-state sytems are far better understood and permit much more efficient analysis. In this project, I will pursue fundamental questions that arise when we want to abstract infinite-state systems by finite-state systems. The goal is to understand two types of problems: 1. Separability problems: Given two infinite-state systems, can we find a finite-state overapproximation of the first system whose behaviors are disjoint from those of the second system? Separability is a basic task for synthesizing certificates for disjointness and therefore safety properties in concurrent systems. 2. Closure computation. There are several non-constructive results that guarantee the existence of finite-state overapproximations of infinite-state systems that preserve some particular information. We are interested in how to compute these overapproximations effectively and efficiently. Examples include downward closures and upward closures with respect to the (scattered) subword ordering. Efficient procedures for closure computation would have immediate implications for infinite-state verification tasks that combine recursion with concurrency. In addition to directly attacking well-known deep open problems regarding these fundamental questions, the project will also develop methods that will likely be crucial for resolving further major open problems in infinite-state systems. Moreover, the obtained results would have immediate implications for software verification in settings that combine recursion with concurrency, which is a notoriously difficult task.

Conecta tu I+D

Entra hoy

¿Olvide mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores