LIST OF ACCEPTED PAPERS

Alessandro Aldini
Behavioral Equivalences and Approximations


Olaf Beyersdorff, Nicola Galesi and Massimo Lauria
A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games


Olaf Beyersdorff, Nicola Galesi and Massimo Lauria
The Strength of Parameterized Tree-like Resolution


Marcello Maria Bersani and Achille Frigeri
Bounded Reachability for Temporal Logic over Constraint Systems


Clara Bertolissi and Maribel Fernandez
Rewrite Specifications of Access Control Policies in Distributed Environments


Stefano Bistarelli, Paola Campli and Francesco Santini
Computing Coalitions of Arguments with CSPs


Daniela Briola, Maurizio Martelli and Viviana Mascardi
Specification, simulation and verification of negotiation protocols in a unified agent-based framework


Sara Brunetti, Elena Lodi and Walter Quattrociocchi
Stubborn Entities in Colored Toroidal Meshes


Federico Buti, Diletta Cacciagrano and Luca Tesei
BioShape: a uniform multi-scale simulator for biological systems


Carlo Cafaro, Sonia L'Innocente, Cosmo Lupo and Stefano Mancini
On Performance Quantifiers for Quantum Error Correcting Codes


Massimo Callisto De Donato and Maria Rita Di Berardini
A Framework for the Evaluation of Worst-Case System Efficiency


Domenico Cantone and Simone Faro
Fast Shortest Paths Algorithms in the Presence of Few Negative Arcs


Domenico Cantone, Andrea Formisano, Marianna Nicolosi Asmundo and Eugenio Omodeo
A graphical representation of relational formulae with complementation


Alberto Carraro and Antonino Salibra
Easy Lambda-terms are not Always Simple


Anton Cerny
Fuzzy words


Alessandra Cherubini, Claudia Nuccio and Emanuele Rodaro
On the alphabetical satisfiability of trace equations


Dario Colazzo and Carlo Sartiani
Precision and Complexity of X


Flavio Corradini, Andrea Polini, Alberto Polzonetti and Barbara Re
An User-Friendly Approach for Business Process Formal Verification


Flavio D'Alessandro and Arturo Carpi
Locally strongly transitive automata and the Hybrid Cerny-Road coloring problem


Luca D'Auria and Rosalba Zizza
A note on the McCloskey's algorithm for deciding whether a regular language is a code


Gianlorenzo D'Angelo, Daniele Frigioni and Vinicio Maurizio
An experimental study of distributed algorithms for shortest paths on real networks


Giovanna D'Agostino, Eugenio Omodeo, Alberto Policriti and Alexandru Tomescu
Mapping Hypersets into numbers


Angelo De Caro, Vincenzo Iovino and Giuseppe Persiano
Fully Secure Anonymous HIBE with Short Ciphertexts


Anita Eusebi and Stefano Mancini
On a quantum two-way deterministic and d-dimensional cryptographic scheme


Andrea Frosini, Simone Rinaldi, Khalil Tawbeh and Laurent Vuillon
Reconstruction of $2$-convex polyominoes


Marco Gaboardi and Alexis Saurin
A foundational calculus for computing with streams


Fabio Gadducci, Alberto Lluch Lafuente and Andrea Vandin
Counterpart Semantics for a Second-Order mu-Calculus


Sumit Ganguly and Purushottam Kar
Estimating first frequency moment of data stream in nearly optimal space and time


Laura Giambruno and Sabrina Mantaci
State complexities of transducers for bidirectional decoding of prefix codes


Furio Honsell, Marina Lenisa and Rekha Redamalla
Equivalences and Congruences on Infinite Games


M.Carmen Ruiz, Diego Pérez Leándrez, J.Jose Pardo and Diego Cazorla
BAL Tool: what else?


Blerina Sinaimeri and Tiziana Calamoneri
L(2,1)-Labeling of Oriented Planar Graphs


Salvatore Spinella, Eva Sciacca and Paola Giannini
Protein Sequence-Function Analysis Using Annotated Context-Free Grammars


Michele Tartara, Stefano Crespi Reghizzi and Simone Campanoni
Extending hammocks for parallelism detection