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

CARBS

Financiado

Cerrado

Compositional Approximate Reasoning via Bialgebraic Semantics

Programming languages with probabilistic features are used extensively in computer science and beyond, to model uncertainty, perform quantitative analysis, inference and much more. To analyse programs in such languages, it is esse... ver más

31/01/2020

UNIVERSITY COLLEGE...

92K€

Presupuesto del proyecto: 92K€

Líder del proyecto

UNIVERSITY COLLEGE LONDON No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2020-01-31

MSCA-IF-2017: Individual Fellowships

I+D

Cerrada hace 7 años

0% 100% 100%

Información adicional privada

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

1 Participantes

UNIVERSITY COLLEGE LONDON

91.73K€ | Lider

Proyectos interesantes

IAGT

Software

Data Science

271K€ Cerrado

TIN2011-28194

Software

Data Science

102K€ Cerrado

MAD-SDN

Software

Data Science

173K€ Cerrado

CORNET

Software

Cybersecurity

1M€ Cerrado

ACCENT

Data Science

Software

176K€ Cerrado

OCEAN

Software

Data Science

8M€ Cerrado

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

Duración del proyecto: 21 meses Fecha Inicio: 2018-04-13
Fecha Fin: 2020-01-31

Líder del proyecto

UNIVERSITY COLLEGE LONDON No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 92K€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto Programming languages with probabilistic features are used extensively in computer science and beyond, to model uncertainty, perform quantitative analysis, inference and much more. To analyse programs in such languages, it is essential to have effective tools and techniques for approximate reasoning: for instance, determining the chance of congestion in a network, or the chance of failure of a system component. CARBS proposes a general mathematical framework of compositional proof techniques for approximate reasoning, with two essential points of focus: general applicability, to deal with the wide variety of different quantitative languages and models, and compositionality, to deal with large-scale systems. A motivating case study and application for the developed proof techniques is ProbNetKAT, a probabilistic language for describing randomized protocols and analysing quantitative properties in networks such as throughput or chance of failure. Approximate reasoning about such network programs is an important but also challenging problem, and the abundance of possible case studies will allow to immediately evaluate and apply the developed proof techniques. Approximate reasoning requires to move from behavioural equivalence to behavioural metrics, formalising how far apart two programs are. CARBS is based on integrating behavioural metrics in bialgebraic semantics, a categorical approach for a systematic study of languages and calculi based on the combination of algebra and coalgebra. Coalgebra allows to define behavioural metrics, in a general manner, whereas algebra integrates compositionality in the associated proof techniques. The overall envisaged result of CARBS is an extension of bialgebraic semantics to quantitative systems, providing on the one hand fundamental insights about quantiative coalgebras and compositionality, and on the other hand concrete, effective proof techniques for approximate reasoning.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores