Day 1: 7th September

Conference Program
September 7th, Wednesday
9:00
Opening
9:30
Invited Talk – Chair: Antonio Caruso
Giampaolo Bella (University of Catania)
Cybersecurity’s Way Forward: to Beautify or to Disappear
People do not generally like Cybersecurity. Although they do believe it is
somewhat good to have, they often cannot be bothered to go through security
defences such as registrations, strong passwords’ choices, PINs’ long waits
through the post and all the like. I do believe they are essentially right,
especially if modern services are to be enjoyed on the move, while the user is
hopping on the tube, or pervasively, while the user is also watching television.
Sometimes users have to be bothered to go through such defences otherwise
they will not get the service they wanted. They may then be nastily rewarded
with senses of disappointment and frustration both if they opted to go on and if
their pride or boredom prevented them to. A layman at a cafe was arguing that
he found Cybersecurity especially hideous when he was in a rush to get some
service. Almost every researcher who looks at Cybersecurity from the sociotechnical angle will agree with that layman as much as I do. This position paper
outlines my view of the sole way forward for Cybersecurity: a fork in the road
that takes either to Beautiful City or to Invisible City. One may of course refuse
the fork and go back on the same road to Old City, where Cybersecurity often
failed for a variety of reasons, including purely technical bugs and humancentred mistakes. I will postulate how I envisage Beautiful City and Invisible
City to be. And do not worry you formal methodists: your help will be most
appreciated also in the new cities.
10:30
Coffee Break
Session I: Graph Algorithms – Chair: Paola Vocca
11:00
Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot and
Blerina Sinaimeri
On Maximal Chain Subgraphs and Covers of Bipartite Graphs
11:22
Tiziana Calamoneri, Matteo Dell’Orefice and Angelo Monti
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on
Simple Clique 3-Trees
11:44
Gennaro Cordasco, Luisa Gargano and Adele A. Rescigno
Active Spreading in Networks
12:06
Mattia D’Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci and Guido
Proietti
On the Clustered Shortest-Path Tree Problem
12:28
Gianlorenzo D’Angelo, Lorenzo Severini and Yllka Velaj
On the Influence Maximization in the Independent Cascade Model
12:50
Lunch
Session II: Semantics I – Chair: Marco Bernardo
14:20
Claudio Antares Mezzina and Jorge A Pérez
Reversible semantics in session-based concurrency
14:42
Jaime Arias, Mauricio Cano and Jorge A. Pérez
Towards A Practical Model of Reactive Communication-Centric Software
15:04
Giovanni Casu and G. Michele Pinna
An unifying framework for compacting Petri nets behaviors
15:26
Chiara Bodei and Letterio Galletta
The cost of securing IoT communications
15:48
Matteo Busi, Pierpaolo Degano and Letterio Galletta
A semantics for disciplined concurrency in COP
16:10
Coffee Break
16:40
Italian Chapter of EATCS Meeting
September 8th, Wednesday
9:00
Young TCS Research Award – Chair: Tiziana Calamoneri
Gianlorenzo D’Angelo
Approximation bounds for centrality maximization problems
10:00
Best PhD Thesis and Master Thesis in TCS – Chair: Stefano Bistarelli
Ilario Bonacina
Space in weak propositional proof systems
Massimo Cairo
10:30
Coffee Break
Session III: Automata, Logics and Model Checking – Chair: Riccardo
Focardi
11:00
Giovanna Lavado, Giovanni Pighizzini and Luca Prigioniero
Minimal and Reduced Reversible Automata
11:22
Domenico Cantone and Salvatore Cristofaro
A variant of Turing machines with no control states and its connection to
bounded temporal memory
11:44
Domenico Cantone, Marianna Nicolosi-Asmundo and Daniele Francesco
Santamaria
Conjunctive Query Answering via a Fragment of Set Theory
12:06
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron and Pietro
Sala
Interval Temporal Logic Model Checking Based on Track Bisimilarity and
Prefix Sampling
12:28
Bastien Maubert, Catalin Dima and Sophie Pinchinat
Relating paths in transition systems: the fall of the modal mu-calculus
12:50
Lunch
Session IV: Distributed Computing and Combinatorics of Words – Chair:
Gianlorenzo D’Angelo
14:20
Massimo Cafaro and Marco Pulimeno
Merging Frequent Summaries
14:42
Shantanu Das, Riccardo Focardi, Flaminia Luccio, Euripides Markou, Davide
Moro and Marco Squarcina
Gathering of Robots in a Ring with Mobile Faults
15:04
Mattia D’Emidio, Gabriele Di Stefano, Daniele Frigioni and Alfredo Navarra
Improved Protocols for Luminous Asynchronous Robots
15:26
Gabriele Fici, Antonio Restivo, Manuel Silva and Luca Quadro Zamboni
Anti-Powers in Infinite Words
15:48
Ananda Nayak, Amit Srivastava and Kalpesh Kapoor
On Exchange-Robust and Subst-Robust Partial Words
16:10
Coffee Break
Session V: Game Theory – Chair: Giovanni Pighizzini
16:40
Cosimo Vinci
Non-Atomic One-Round Walks in Polynomial Congestion Games
17:02
Vadim Malvone and Aniello Murano
Additional Winning Strategies in Two-Player Games
17:25
Giacomo Scornavacca, Andrea Clementi, Guido Proietti and Luciano Gualà
Fair Leader Election among Selfish Agents
17:47
Paolo Giuliodori, Stefano Bistarelli, Rosario Culmone and Stefano Mugnoz
A Mechanism Design Approach for Fair Allocation of Commodities
18:10
19:30
Social Dinner at the ristorante “Il Bastione” in Gallipoli
September 9th, Wednesday
9:30
Invited Talk – Chair: Vittorio Bilò
Gianluigi Greco (University of Calabria)
Mechanisms with Verification and Fair Allocation Problems
Whenever the outcome of some social choice process depends on the
information collected from a number of self-interested agents, strategic issues
come into play and mechanism design techniques have to be used in order to
motivate all agents to truthfully report the relevant information they own as
their private knowledge. The talk illustrates some general background on these
techniques and specific methods that can be applied when some kind of
verification on the declarations of the agents is possible. In particular, attention
is focused on analysing a class of mechanisms that naturally arise in the context
of allocation problems, by proposing to interpret them in terms of well-known
solution concepts for coalitional games. Complexity issues arising in this setting
are also discussed, and structural requirements are investigated which can be
used to identify islands of tractability.
10:30
Coffee Break
Session VI: Semantics II – Chair: Chiara Bodei
11:00
Paola Giannini, Elena Zucca and Marco Servetto
Transparent Aliasing and Mutation Control
11:22
Paola Giannini, Marco Servetto and Elena Zucca
Runtime checks as nominal types
11:44
Marino Miculan and Marco Peressotti
On the bisimulation hierarchy of state-to-function transition systems
12:06
Marco Bernardo and Marino Miculan
Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive
Probabilistic Systems
12:28
Vincenzo Mastandrea
Deadlock analysis with behavioral types for actors
12:50
Closing
12:55
Lunch
Lunches
Lunches will be served at Restaurant “Doppiozero”.
How to reach Restaurant “Doppiozero” from the conference venue:
Social dinner
The social dinner will take place at the Restaurant “Il Bastione” in Gallipoli (approx. 40
km from Lecce) on Thursday. There will be a bus leaving from Porta Napoli at 19:30.
Please be there on time.
How to reach Porta Napoli from the conference venue: