Explore the words cloud of the ProFoundNet project. It provides you a very rough idea of what is the project "ProFoundNet" about.
The following table provides information about the project.
Coordinator |
UNIVERSITY COLLEGE LONDON
Organization address contact info |
Coordinator Country | United Kingdom [UK] |
Project website | http://www.profoundnet.org |
Total cost | 1˙500˙000 € |
EC max contribution | 1˙500˙000 € (100%) |
Programme |
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC)) |
Code Call | ERC-2015-STG |
Funding Scheme | ERC-STG |
Starting year | 2016 |
Duration (year-month-day) | from 2016-04-01 to 2021-03-31 |
Take a look of project's partnership.
# | ||||
---|---|---|---|---|
1 | UNIVERSITY COLLEGE LONDON | UK (LONDON) | coordinator | 1˙500˙000.00 |
In an ever-connected world, increasingly complex network systems play a crucial role in many daily tasks. This results in an acute need for methods/tools that can enable easy control of the network and, at the same time, provide rigorous guarantees about its behavior, performance, and security. Recent years saw the growth of a new software ecosystem -Software-defined networking (SDN)- which advocates a clean and open interface between networking devices and the software that controls them. Yet, existing SDN languages do not support reasoning about crucial quantitative aspects, such as: ``How much congestion is there?' or ``Is the network resilient under failure?'. Enabling compositional quantitative reasoning is the major breakthrough needed to fully realize the vision of SDN.
The central objective of this project is to develop new abstractions for programming of networks, with high-level modular constructs. We will provide rigorous semantic probabilistic foundations, enabling quantitative reasoning. This will serve as a solid platform for program analysis tools where compositional reasoning about complex interactions will be a reality. Our goal will be achieved through an interdisciplinary research effort: using techniques from concurrency and formal methods, areas where akin challenges can be found in the quest to design correct software systems. We will leverage the wealth of recent advances in those areas (some of which from the PI's own research) to networks, and bring awareness and new challenges arising from applications in networking to the other two communities.
The project will significantly advance the foundations of network programming/verification in new and previously unexplored directions. This line of research will not only result in fundamental theoretical contributions and insights in their own right but will also impact the practice of network programming and lead to new and more powerful techniques for the use of engineers and programmers.
year | authors and title | journal | last update |
---|---|---|---|
2017 |
Gerco van Heerdt, Matteo Sammartino, Alexandra Silva CALF: Categorical Automata Learning Framework published pages: , ISSN: , DOI: 10.4230/LIPIcs.CSL.2017.29 |
2019-06-19 | |
2017 |
Paul Brunet Reversible Kleene lattices published pages: , ISSN: , DOI: 10.4230/LIPIcs.MFCS.2017.66 |
2019-06-19 | |
2017 |
Paul Brunet, Damien Pous, Georg Struth On Decidability of Concurrent Kleene Algebra published pages: , ISSN: , DOI: 10.4230/LIPIcs.CONCUR.2017.28 |
2019-06-19 | |
2017 |
Alexandra Silva Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk) published pages: , ISSN: , DOI: 10.4230/LIPIcs.FSCD.2017.3 |
2019-06-19 | |
2017 |
Filippo Bonchi, Alexandra Silva, Ana Sokolova The Power of Convex Algebras published pages: , ISSN: , DOI: 10.4230/LIPIcs.CONCUR.2017.23 |
2019-06-19 | |
2017 |
Tobias Kappe, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages published pages: , ISSN: , DOI: 10.4230/LIPIcs.CONCUR.2017.25 |
2019-06-19 | |
2017 |
Fredrik Dahlqvist, David Pym Coalgebraic completeness-via-canonicity for distributive substructural logics published pages: 1-22, ISSN: 2352-2208, DOI: 10.1016/j.jlamp.2017.07.002 |
Journal of Logical and Algebraic Methods in Programming 93 | 2019-06-19 |
2017 |
Aws Albarghouthi, Justin Hsu Synthesizing coupling proofs of differential privacy published pages: 1-30, ISSN: 2475-1421, DOI: 10.1145/3158146 |
Proceedings of the ACM on Programming Languages 2/POPL | 2019-05-14 |
2017 |
Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub Proving expected sensitivity of probabilistic programs published pages: 1-29, ISSN: 2475-1421, DOI: 10.1145/3158145 |
Proceedings of the ACM on Programming Languages 2/POPL | 2019-05-14 |
2018 |
Kanazawa, Makoto; Kappé, Tobias Decision problems for Clark-congruential languages published pages: , ISSN: , DOI: |
Proceedings of Machine Learning Research 1 | 2019-05-09 |
2018 |
\"Harsh Beohar, Barbara K{\"\"{o}}nig, Sebastian K{\"\"\"\"{u}}per, Alexandra Silva, Thorsten Wi{ss}mann\"\"\" A coalgebraic treatment of conditional transition systems with upgrades published pages: , ISSN: 1860-5974, DOI: 10.23638/LMCS-14(1:19)2018 |
Logical Methods in Computer Science | 2019-05-09 |
2017 |
Kappé, Tobias; Brunet, Paul; Luttik, Bas; Silva, Alexandra; Zanasi, Fabio Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages published pages: , ISSN: , DOI: |
In: Meyer, R and Nestmann;, U, (eds.) Proceedings of the CONCUR 2017 : 28th International Conference on Concurrency Theory. (pp. 25:1-25:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany. (2017) 3 | 2019-05-09 |
2018 |
Alejandro Aguirre, Gilles Barthe, Justin Hsu, Alexandra Silva Almost Sure Productivity published pages: , ISSN: , DOI: 10.4230/LIPIcs.ICALP.2018.113 |
2019-05-09 | |
2018 |
Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, Alexandra Silva Borel Kernels and their Approximation, Categorically published pages: , ISSN: , DOI: |
2019-05-09 | |
2017 |
Van Heerdt, G.; Sammartino, M.; Silva, A. CALF: Categorical automata learning framework published pages: , ISSN: , DOI: |
In: Goranko, V and Dam, M, (eds.) Proceedings of the 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). (pp. 29:1-29:24). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany. (2017) 1 | 2019-05-09 |
2018 |
\"J{\"\"{o}}rg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva\"\"\" Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic published pages: , ISSN: 1860-5974, DOI: 10.23638/LMCS-14(1:3)2018 |
Logical methods in Computer Science | 2019-05-09 |
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "PROFOUNDNET" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "PROFOUNDNET" are provided by the European Opendata Portal: CORDIS opendata.