Program

The following document is a Preliminary Program.  

Final Program
(news!)

Wednesday, September 7

9:00 – 9:30

Opening and Registration

Get your badge, grab some coffee and a seat, and get ready to start! Please bring with you a copy of the bank transaction if you wanna get a receipt of the payment.

9:30 – 10:30

Invited Talk I: Giampaolo Bella

(Chair: Antonio Caruso)

Cybersecurity’s Way Forward: to get Beautiful or Invisible

10:30 – 11:00

Coffee Break

Session I: Graph Algorithms (chair: Paola Vocca)

11:00 – 11:22
Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot and Blerina Sinaimeri
On Maximal Chain Subgraphs and Covers of Bipartite Graphs

11:22 – 11:44
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 – 12:06
Gennaro Cordasco, Luisa Gargano and Adele A. Rescigno.
Active Spreading in Networks

12:06 – 12:28
Mattia D’Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci and Guido Proietti.
On the Clustered Shortest-Path Tree Problem

12:28 – 12:50
Gianlorenzo D’Angelo, Lorenzo Severini and Yllka Velaj.
On the Influence Maximization in the Independent Cascade Model

12:50 – 14:15

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

Thursday, September 8

9:00 – 10:00

Young TCS Research Award

(Chair: Tiziana Calamoneri)

Gianlorenzo D’Angelo

Approximation bounds for centrality maximization problems

10:00 – 10:30

Best PhD Thesis and Master Thesis in TCS

(Chair: Stefano Bistarelli)

Ilario Bonacina – Space in weak propositional proof systems

Massimo Cairo

10:30 – 11:00

Coffee Break

Session III: Automata, Logics and Model Checking
(Chair: Riccardo Focardi)

11:00 – 11:22
Giovanna Lavado, Giovanni Pighizzini and Luca Prigioniero
Minimal and Reduced Reversible Automata

11:22 – 11:44
Domenico Cantone and Salvatore Cristofaro
A variant of Turing machines with no control states and its connection to bounded temporal memory

11:44 – 12:06
Domenico Cantone, Marianna Nicolosi-Asmundo and Daniele Francesco Santamaria
Conjunctive Query Answering via a Fragment of Set Theory

12:06 – 12:28
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 – 12:50
Bastien Maubert, Catalin Dima and Sophie Pinchinat
Relating paths in transition systems: the fall of the modal mu-calculus

12:50 – 14:00

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

19:30

Social Dinner (info at the Conference)

Friday, September 9

9:30 – 10:30

Invited Talk II: Gianluigi Greco

(Chair: Vittorio Bilò)

Mechanisms with Verification and Fair Allocation Problems

10:30 – 11:00

Coffee Break

Session VI: Semantics II – (Chair: Chiara Bodei)

11:00 – 11:22
Paola Giannini, Elena Zucca and Marco Servetto
Transparent Aliasing and Mutation Control

11:22 – 11:44
Paola Giannini, Marco Servetto and Elena Zucca
Runtime checks as nominal types

11:44 – 12:06
Marino Miculan and Marco Peressotti
On the bisimulation hierarchy of state-to-function transition systems

12:06 – 12:28
Marco Bernardo and Marino Miculan
Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive
Probabilistic Systems

12:28 – 12:44
Vincenzo Mastandrea
Deadlock analysis with behavioral types for actors

12:50

Closing

13:00

Lunch

List of accepted papers:

  1. Claudio Antares Mezzina and Jorge A Pérez. Reversible semantics in session-based concurrency
  2. Jaime Arias, Mauricio Cano and Jorge A. Pérez. Towards A Practical Model of Reactive Communication-Centric Software
  3. Paola Giannini, Elena Zucca and Marco Servetto. Transparent Aliasing and Mutation Control
  4. Paola Giannini, Marco Servetto and Elena Zucca. Runtime checks as nominal types
  5. Massimo Cafaro and Marco Pulimeno. Merging Frequent Summaries
  6. Giovanna Lavado, Giovanni Pighizzini and Luca Prigioniero. Minimal and Reduced Reversible Automata
  7. Domenico Cantone and Salvatore Cristofaro. A variant of Turing machines with no control states and its connection to bounded temporal memory
  8. Cosimo Vinci. Non-Atomic One-Round Walks in Polynomial Congestion Games
  9. Paolo Giuliodori, Stefano Bistarelli, Rosario Culmone and Stefano Mugnoz. A Mechanism Design Approach for Fair Allocation of Commodities
  10. Domenico Cantone, Marianna Nicolosi-Asmundo and Daniele Francesco Santamaria. Conjunctive Query Answering via a Fragment of Set Theory
  11. Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot and Blerina Sinaimeri. On Maximal Chain Subgraphs and Covers of Bipartite Graphs
  12. Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron and Pietro Sala. Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling
  13. Shantanu Das, Riccardo Focardi, Flaminia Luccio, Euripides Markou, Davide Moro and Marco Squarcina. Gathering of Robots in a Ring with Mobile Faults
  14. Bastien Maubert, Catalin Dima and Sophie Pinchinat. Relating paths in transition systems: the fall of the modal mu-calculus.
  15. Gabriele Fici, Antonio Restivo, Manuel Silva and Luca Quadro Zamboni. Anti-Powers in Infinite Words 
  16. Giovanni Casu and G. Michele Pinna. An unifying framework for compacting Petri nets behaviors
  17. Tiziana Calamoneri, Matteo Dell’Orefice and Angelo Monti. A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees
  18. Vadim Malvone and Aniello Murano. Additional Winning Strategies in Two-Player Games
  19. Giacomo Scornavacca, Andrea Clementi, Guido Proietti and Luciano Gualà. Fair Leader Election among Selfish Agents
  20. Mattia D’Emidio, Gabriele Di Stefano, Daniele Frigioni and Alfredo Navarra. Improved Protocols for Luminous Asynchronous Robots
  21. Marino Miculan and Marco Peressotti. On the bisimulation hierarchy of state-to-function transition systems
  22. Gennaro Cordasco, Luisa Gargano and Adele A. Rescigno. Active Spreading in Networks
  23. Chiara Bodei and Letterio Galletta. The cost of securing IoT communications
  24. Matteo Busi, Pierpaolo Degano and Letterio Galletta. A semantics for disciplined concurrency in COP
  25. Marco Bernardo and Marino Miculan. Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems
  26. Ananda Nayak, Amit Srivastava and Kalpesh Kapoor. On Exchange-Robust and Subst-Robust Partial Words
  27. Vincenzo Mastandrea. Deadlock analysis with behavioral types for actors.
  28. Mattia D’Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci and Guido Proietti. On the Clustered Shortest-Path Tree Problem
  29. Gianlorenzo D’Angelo, Lorenzo Severini and Yllka Velaj. On the Influence Maximization in the Independent Cascade Model