Program

Wednedsay, September 19th

9.00 - 9.20 Registration
9.20 - 9.30 Opening Session
9.30 - 10.30 Invited Lecture - Paolo Ferragina
Algorithms and data structures for massive data: what's next?
10.30 - 11.00 Coffee break
Session A Session B
11.00 - 11.30 Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta and Fabrizio Montecchiani: h-quasi planar Drawings of Bounded Treewidth Graphs in Linear Area Elena Giachino and Tudor Lascu: Lock Analysis for an Asynchronous Object Calculus
11.30 - 12.00 Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni and Daniele Romano: Efficient algorithms for distributed shortest paths on power-law networks Nicholas Fiorentini, Achille Frigeri, Liliana Pasquale and Paola Spoletini: Time Modalities over Many-valued Logics
12.00 - 12.30 Christoph Dittmann, Stephan Kreutzer and Alexandru I. Tomescu: Graph Operations on Parity Games and Polynomial-Time Algorithms Marina Lenisa and Daniel Pellarini: Hoare Logic for Multiprocessing
12.30 - 14.30 Lunch break
Session A Session B
14.30 - 15.00 Renza Campagni, Donatella Merlini and Renzo Sprugnoli: Data mining for a student database Daniele Mantovani, Paola Giannini and Albert Shaqiri: Leveraging dynamic typing through static typing
15.00 - 15.30 Jianyi Lin: Size constrained clustering problems in fixed dimension Davide Ancona, Matteo Barbieri and Viviana Mascardi: Global Session Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems
15.30 - 16.00 Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale and Giovanni Zappella: A Fast Active Learning Algorithm for Link Classification Letterio Galletta: A Reconstruction of a Types-and-Effects Analysis by Abstract Interpretation
16.00 - 16.30 Coffee break
Session A Session B
16.30 - 17.00 Paola Bonizzoni, Anna Paola Carrieri, Riccardo Dondi and Gabriella Trucco: The Binary Perfect Phylogeny with Persistent Characters Svetlana Jaksic: Input/Output Types for Dynamic Web Data
17.00 - 17.30 Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis: On the Complexity of the Swap Common Superstring Problemi Robert F. C. Walters, Davide Maglia, Nicoletta Sabadini and Filippo Schiavio: The algebra and geometry of networks
17.30 - 18.00 Bogdan Aman and Gabriel Ciobanu: Behavioural Equivalences over Mobile Membranes with Delays Stefano Bistarelli and Francesco Santini: Securely Accessing Shared Resources with Concurrent Constraint Programming

Thursday, September 20th

9.30 - 10.30 Invited Lecture - Ugo Montanari
On hierarchical graphs: reconciling bigraphs, gs-monoidal theories and gs-graphs
10.30 - 11.00 Coffee break
Session A Session B
11.00 - 11.30 Giovanna Lavado, Giovanni Pighizzini and Shinnosuke Seki: Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata Erika De Benedetti and Simona Ronchi Della Rocca: A complete polynomial lambda calculus
11.30 - 12.00 Violetta Lonati, Dino Mandrioli and Matteo Pradella: Automata and Logic for Floyd Languages Davide Basile: Service interaction contracts as security policies
12.00 - 12.30 Andreas Malcher, Katja Meckel, Carlo Mereghetti and Beatrice Palano: On Pushdown Store Languages Massimo Bartoletti, Tiziana Cimoli, G. Michele Pinna and Roberto Zunino: Circular causality in event structures
12.30 - 14.30 Lunch break
Award Cerimony for best PHD Theses in Theoretical Computer Science for 2011/2012
14.30 - 15.15 Fabio Mogavero. Logics in Computer Science
15.15 - 16.00 Rossano Venturini. On searching and extracting strings from compressed textual data
16.00 - 16.30 Coffee break
16.30 - 18.00 IC-EATCS Annual Assembly

20.00: Conference Dinner

Friday, September 21st

9.30 - 10.30 Invited Lecture - Antonio Restivo
On the expressive power of the shuffle product
10.30 - 11.00 Coffee break
Session A Session B
11.00 - 11.30 Gabriele Fici: A Characterization of Bispecial Sturmian Words Giorgio Delzanno and Riccardo Traverso: A Formal Model of Asynchronous Broadcast Communication
11.30 - 12.00 Gabriele Fici and Zsuzsanna Lipták: Words with the Smallest Number of Closed Factors Marcello M. Bersani and Achille Frigeri: Checking Satisfiability of CLTL without Automata
12.00 - 12.30 Giuseppa Castiglione and Marinella Sciortino: Moore Automata and Epichristoffel Words Emanuele Rodaro and Oznur Yeldan: A Continuous Cellular Automata Approach to Highway Traffic Modeling
12.30 - 14.30 Lunch break
Session A Session B
14.30 - 15.00 Carlo Comin and Maria Paola Bianchi: Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata Gabriel Ciobanu and Angelo Troina: Rate-Based Stochastic Fusion Calculus and Continuous Time Markov Chains
15.00 - 15.30 Artiom Alhazov, Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca and Claudio Zandron: Simulating EXPSPACE Turing machines using P systems with active membranes Federico Mari, Igor Melatti, Ivano Salvo and Enrico Tronci: Undecidability of Quantized State Feedback Control for Discrete Time Linear Hybrid Systems
15.30 - 16.00 Marcello M. Bersani, Achille Frigeri and Alessandra Cherubini: On the Complexity of Pure 2D Context-free Grammars) Emanuele Milani and Nicola Zago: Exploiting Fine Grained Parallelism on the SPE
16.00 - 16.30 Closing session