ICTCS 2016
Italian Conference on Theoretical Computer Science

Table of Contents

• Preface I-IX
  Vittorio Bilò, Antonio Caruso

Invited Papers

• Cybersecurity’s Way Forward: to get Beautiful or Invisible 1-7
  Gianpaolo Bella
• Mechanisms with Verification and Fair Allocation Problems 8
  Gianluca Greco

Regular Papers

• Non-Atomic One-Round Walks in Polynomial Congestion Games 11-22
  Cosimo Vinci
• Conjunctive Query Answering via a Fragment of Set Theory 23-35
  Domenico Cantone, Marianna Nicolosi-Asmundo, Daniele Francesco Santamaria
• A Variant of Turing Machines with no Control States and its Connection to Bounded Temporal Memory 36-48
  Domenico Cantone, Salvatore Cristofaro
• Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling 49-61
  Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
• Types for Immutability and Aliasing Control 62-74
  Paola Giannini, Marco Servetto, Elena Zucca
• Runtime Checks as Nominal Types 75-87
  Paola Giannini, Marco Servetto, Elena Zucca
• On the Bisimulation Hierarchy of State-to-Function Transition Systems 88-102
  Marino Miculan, Marco Peressotti
• A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees 103-121
  Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti
• Gathering of Robots in a Ring with Mobile Faults 122-135
  Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Davide Moro, Marco Squarcina
• Improved Protocols for Luminous Asynchronous Robots 136-148
  Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
• Active Spreading in Networks 149-162
  Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
• The Cost of Securing IoT Communications 163-176
  Chiara Bodei, Letterio Galletta
• A Semantics for Disciplined Concurrency in COP 177-189
  Matteo Busi, Pierpaolo Degano, Letterio Galletta
• On Exchange-Robust and Subst-Robust Primitive Partial Words 190-202
  Ananda Chandra Nayak, Amit Kumar Srivastava, Kalpesh Kapoor
• Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems 203-220
  Marco Bernardo, Marino Miculan

Communications

• Reversible Semantics in Session-based Concurrency 221-226
  Claudio Antares Mezzina, Jorge Andres Pèrez
• Towards A Practical Model of Reactive Communication-Centric Software 227-233
  Jaime Arias, Mauricio Cano, Jorge Andres Pèrez
• Minimal and Reduced Reversible Automata 234-239
  Giovanna J.Lavado, Giovanni Pighizzini, Luca Prigioniero
• Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus 240-244
  Catalin Dima, Bastien Maubert, Sophie Pinchinat
• An Unifying Framework for Compacting Petri Nets Behaviors 245-250
  Giovanni Casu, G. Michele Pinna
• Additional Winning Strategies in Two-Player Games 251-256
  Vadim Malvone, Aniello Murano
• Deadlock Analysis with Behavioral Types for Actors 257-262
  Vincenzo Mastandrea
• On the Clustered Shortest-Path Tree Problem 263-268
  Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
• Influence Maximization in the Independent Cascade Model 269-274
  Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
• A Mechanism Design Approach for Allocation of Commodities 275-279
  Stefano Bistarelli, Rosario Culmone, Paolo Giuliodori, Stefano Mugnoz
• Merging Frequent Summaries 280-285
  Massimo Cafaro, Marco Pulimeno
• On Maximal Chain Subgraphs and Covers of Bipartite Graphs 286-291
  Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri

Papers Published Elsewhere

• Anti-Powers in Infinite Words
  Gabriele Fici, Antonio Restivo, Manuel Silva, Luca Quadro Zamboni