Proof theoretical Approaches to Concurrency Theory
This project aims at providing a mathematical understanding of software exploiting modern distributed computer architectures, through the study of type systems for concurrent programs from a logical perspective. Type systems are a...
ver más
¿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
TIN2015-71819-P
TECNOLOGIAS RIGUROSAS PARA EL ANALISIS Y VERIFICACION DE SOF...
108K€
Cerrado
VELOX
VELOX An Integrated Approach to Transactional Memory on Mul...
4M€
Cerrado
VAPLCS
Verification Aware Programming Language Concurrency Semantic...
1M€
Cerrado
Mathador
Type and Proof Structures for Concurrent Software Verificati...
2M€
Cerrado
PolyBar
A new approach to polymorphism through bar recursion
185K€
Cerrado
TIN2012-38137-C02-01
TECNICAS AVANZADAS DE VERIFICACION DE APLICACIONES CONCURREN...
115K€
Cerrado
Información proyecto PACT
Duración del proyecto: 30 meses
Fecha Inicio: 2016-03-17
Fecha Fin: 2018-09-30
Fecha límite de participación
Sin fecha límite de participación.
Descripción del proyecto
This project aims at providing a mathematical understanding of software exploiting modern distributed computer architectures, through the study of type systems for concurrent programs from a logical perspective. Type systems are an essential part of modern programming languages, that have proved to be a reliable support for the development of trustworthy software in the standard setting of sequential (functional) computing. However, the mathematical foundations and associated techniques underlying the type systems of functional programming languages have not yet been transferred to the distributed setting, although this is a crucial step in the development of concurrent programming languages.
A cornerstone of the development of functional type systems was the connection between proof systems, in formal logic, and programming languages. Proof theory is a flexible tool that naturally leads to a precise, mathematical specification of type systems that can be very expressive. The goal of the project is to leverage recent work in computational logic (in particular linear logic and its extensions) to design type systems for process calculi (a mathematical representation of distributed software) that support the features necessary to the development of a programming language. Specifically, the question of the sequentiality of computing steps in this parallel setting is the major point of contention, that needs to be addressed for such a programming language to be reasonably conceived. This proof-theoretical approach to concurrency theory (the mathematical study of distributed software) is the key to the development of type systems that would validate well-behaved distributed programs: the main objectives of the project are the integration of explicit sequentiality to state-of-the-art systems, and the establishment of a precise relation between the typeability of a program (its validity according to the type system) and its implementability.