Assenza 20-21 marzo

Per gli studenti e i tesisti: sarò assente il 20 e 21 febbraio per partecipare al Workshop on “Connecting young researchers: best practices of EU-India PhD programmes”, che si terrà a Lisbona. La lezione di Distributed Systems di mercoledì 22 si terrà regolarmente.

Coinductive Methods in Computer Science (and beyond) – F. Bonchi

We are happy to host Filippo Bonchi, Chargé de Recherche at the Ecole Normale Supérieure Lyon, who will give a PhD course about

Coinductive Methods in Computer Science (and beyond).

The lectures will take place at the Department of Mathematics, Computer Science and Physics, as follows:

  1. May 9, 10.30–12.30, Sala Riunioni – slides
  2. May 10, 10.30–12.30, Aula Multimediale – slides
  3. May 11, 14.30–16.30, Sala Riunioni
  4. May 12, 11.00–13.00, Sala Riunioni
  5. May 13, 10.00–12.00, Sala Riunioni

The induction principle is ubiquitous in computer science. For instance it is used to prove properties of programs involving finite data structures, such as natural numbers, lists and trees. For reasoning about concurrent programs or infinite data structures, like streams and infinite trees, one needs a dual principle — coinduction — which is the main topic of this course.
The relevance of coinductive reasoning has been usually associated with bisimilarity, a notion of equivalence that emerged at the end of the seventies in three different fields: non-well founded set theory, modal logics and concurrency theory. In the last years, coinductive methods has been studied in more and more areas of computer science, such as automata and type theory. Perhaps unexpectedly, applications to game theory and economy have been proposed recently.
We will introduce the coinductive definition and proof principles, several techniques to enhance coinductive proofs, and some algorithms to automatize such proofs. During the course, we will encounter examples stemming from different areas, with particular focus to automata and concurrency theory. If time allows, we will also give an overview to the theory of coalgebras, which is the abstract framework encompassing all these different examples.

Corso Game Logic – ultime lezioni

Le ultime 4 lezioni del mini-corso sulla Game Logic tenuto da Ernst-Erich Doberkat, si terranno giovedì 14 e venerdì 15 gennaio, presso la Sala Riunioni del DiMI (o come si chiama ora), secondo il seguente orario:
– Giovedì 14 gennaio:  10:00 – 11:30 e 14:30 – 16:00
– Venerdì 15 gennaio:  09:00 – 10:30 e 11:00 – 12:30.
Il titolo del queste lezioni è Coalgebras, the Giry Monad and Game Logics.
Le note per queste lezioni sono reperibili all’indirizzo
(Ricordo che le note della precedente lezione sono disponibili a

Lauree di ottobre 2015

Triennale Informatica:
– Elia Calligaris: Simulazione di sistemi reattivi bigrafici
– Matteo Comello: Yang2NetKit: un tool modulare basato su bigrafi per progettare e simulare reti di calcolatori
– Tiziano Mele: Previsione di anomalie di un sistema informativo mediante tecniche di data mining
Triennale TWM:
– Luca Geatti: Verifica di proprietà locali su BRS
Magistrale Informatica
– Andrea Toneguzzo: Memorie transazionali aperte componibili: Semantica formale e implementazione in Haskell


JLAMP special issue on MeMo – Call for Papers

A special issue of the Journal of Logical and Algebraic Methods in Programming (JLAMP) will be devoted to the themes of the “Meta Models for Process Languages” workshop series (MEMO; Berlin, June 2014, and Grenoble, June 2015). This is however an open call for papers and everyone is invited to submit. See the complete call for papers for more details.

Important Dates

  • Submission of papers: November 15, 2015
  • First round reviews: February 29, 2016
  • Submission of revised versions: April 30, 2016
  • Second round reviews: May 31, 2016
  • Final manuscript due: June 30, 2016
  • Publication: ~ September 2016