Transcompiling and Analysing Firewalls
June 11, 17.00 (Aula F) Palazzo delle Scienze - Cagliari
Letterio Galletta IMT Lucca (IT)
Abstract. Configuring and maintaining a firewall configuration is notoriously hard. On the one hand, network administrators have to know in detail the policy meaning, as well as the internals of the firewall systems and of their languages. On the other hand, policies are written in low-level, platform-specific languages where firewall rules are inspected and enforced along non trivial control flow paths. Further difficulties arise from Network Address Translation (NAT), an indispensable mechanism in IPv4 networking for performing port redirection and translation of addresses.
July 22, 15.00 (Aula C)
Abstract. Decentralised smart contracts represent the next step in the development of protocols that support the interaction of independent players without the presence of a coercing authority. Based on protocols à la BitCoin for digital currencies, smart contracts are believed to be a potentially enabling technology for a wealth of future applications. The validation of such an early developing technology is as necessary as it is complex. In this paper we combine game theory and formal models to tackle the new challenges posed by the validation of such systems.
SICSA Lecturer - University of Stirling (UK)
July 7, 15.00 (Aula C) Palazzo delle Scienze - Cagliari
Imperial College London
15.4.2016 h12.00 - Lab M (Massimo Bartoletti)
22.4.2016 h12.00 - Lab M (Tiziana Cimoli) -- Slides
29.4.2016 h11.00 - Lab M (Nicola Atzei) -- Slides
6.5.2016 h11.00 - Lab M (Stefano Lande) -- Slides
13.5.2016 - h11.00 - Lab M (Alessandro Sebastian Podda) -- Slides
20.5.2016 h11.00 - Lab M (Nicola Atzei and Tiziana Cimoli) -- Slides
27.5.2016 h11.00 - Lab M (Livio Pompianu) -- Slides
On the decidability of honesty and of its variants
September 3, 11.30 (Aula F)
Palazzo delle Scienze - Cagliari
Dipartimento di Matematica e Informatica, Università degli Studi di Cagliari
Abstract. We address the problem of designing distributed applications which require the interaction of loosely-coupled and mutually distrusting services. In this setting, services can use contracts to protect themselves from unsafe interactions with the environment: when their partner in an interaction does not respect its contract, it can be blamed (and punished) by the service infrastructure. We extend a core calculus for services, by using a semantic model of contracts which subsumes various kinds of behavioural types. In this formal framework, we study some notions of honesty for services, which measure their ability to respect contracts, under different assumptions about the environment. In particular, we find conditions under which these notions are (un)decidable.