|
|
Invited speakers
Accepted papers
- Artiom Alhazov, Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca and Claudio Zandron. Simulating EXPSPACE Turing machines using P systems with active membranes.
- Bogdan Aman and Gabriel Ciobanu. Behavioural Equivalences over Mobile Membranes with Delays.
- Davide Ancona, Matteo Barbieri and Viviana Mascardi. Global Session Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems.
- Massimo Bartoletti, Tiziana Cimoli, G. Michele Pinna and Roberto Zunino. Circular causality in event structures.
- Davide Basile. Service interaction contracts as security policies.
- Marcello M. Bersani and Achille Frigeri. Checking Satisfiability of CLTL without Automata.
- Marcello M. Bersani, Achille Frigeri and Alessandra Cherubini. On the Complexity of Pure 2D Context-free Grammars.
- Stefano Bistarelli and Francesco Santini. Securely Accessing Shared Resources with Concurrent Constraint Programming.
- Paola Bonizzoni, Anna Paola Carrieri, Riccardo Dondi and Gabriella Trucco. The Binary Perfect Phylogeny with Persistent Characters.
- Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis. On the Complexity of the Swap Common Superstring Problem.
- Renza Campagni, Donatella Merlini and Renzo Sprugnoli. Data mining for a student database.
- Giuseppa Castiglione and Marinella Sciortino. Moore Automata and Epichristoffel Words.
- Nicolo' Cesa-Bianchi, Claudio Gentile, Fabio Vitale and Giovanni Zappella. A Fast Active Learning Algorithm for Link Classification.
- Gabriel Ciobanu and Angelo Troina. Rate-Based Stochastic Fusion Calculus and Continuous Time Markov Chains.
- Carlo Comin and Maria Paola Bianchi. Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata.
- Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni and Daniele Romano. Efficient algorithms for distributed shortest paths on power-law networks.
- Erika De Benedetti and Simona Ronchi Della Rocca. A complete polynomial lambda calculus.
- Giorgio Delzanno and Riccardo Traverso. A Formal Model of Asynchronous Broadcast (Preliminary Results).
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta and Fabrizio Montecchiani. h-quasi planar Drawings of Bounded Treewidth Graphs in Linear Area.
- Christoph Dittmann, Stephan Kreutzer and Alexandru I. Tomescu. Graph Operations on Parity Games and Polynomial-Time Algorithms.
- Gabriele Fici. A Characterization of Bispecial Sturmian Words.
- Gabriele Fici and Zsuzsanna Lipták. Words with the Smallest Number of Closed Factors.
- Nicholas Fiorentini, Achille Frigeri, Liliana Pasquale and Paola Spoletini. Time Modalities over Many-valued Logics.
- Letterio Galletta. A Reconstruction of a Types-and-Effects Analysis by Abstract Interpretation.
- Elena Giachino and Tudor Lascu. Lock Analysis for an Asynchronous Object Calculus.
- Svetlana Jaksic. Input/Output Types for Dynamic Web Data.
- Giovanna Lavado, Giovanni Pighizzini and Shinnosuke Seki. Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata.
- Marina Lenisa and Daniel Pellarini. Hoare Logic for Multiprocessing.
- Jianyi Lin. Size constrained clustering problems in fixed dimension.
- Violetta Lonati, Dino Mandrioli and Matteo Pradella. Automata and Logic for Floyd Languages.
- Andreas Malcher, Katja Meckel, Carlo Mereghetti and Beatrice Palano. On Pushdown Store Languages.
- Daniele Mantovani, Paola Giannini and Albert Shaqiri. Leveraging dynamic typing through static typing.
- Federico Mari, Igor Melatti, Ivano Salvo and Enrico Tronci. Undecidability of Quantized State Feedback Control for Discrete Time Linear Hybrid Systems.
- Emanuele Milani and Nicola Zago. Exploiting Fine Grained Parallelism on the SPE.
- Emanuele Rodaro and Oznur Yeldan. A Continuous Cellular Automata Approach to Highway Traffic Modeling.
- Robert F. C. Walters, Davide Maglia, Nicoletta Sabadini and Filippo Schiavio. The algebra and geometry of networks.
|
