About the school

Italian Computer Science PhD granting institutions under the auspices of GRIN, organizes an annual school offering three graduate-level courses aimed at first-year PhD students in Computer Science. In addition to introducing students to timely research topics, the school is meant to promote acquaintance and collaboration among young European researchers. The 2016 edition of the School is the 22th in the series.
The school will offer 3 courses each consisting of 13 hours of lectures:

• Advanced Topics in Programming Languages
  Prof. Giuseppe Castagna - Université Paris Diderot - Paris 7 (France)
• Models and Languages for Service-Oriented and Cloud Computing
  Prof. Gianluigi Zavattaro - University of Bologna (Italy)
• Algorithmic methods for mining large graphs
  Prof. Aristides Gionis, Aalto University (Finland)

A final evaluation for each course is possible through a final exam or project as determined by the instructor. The daily schedule admits laboratory and/or working group activities to be organized in addition to the lectures.
The registration fee for the School is 550.00 Euro and includes all local expenses from the evening of 6 March to 11 March afternoon including all meals and on-site lodging in double-occupancy rooms. A reduced registration fee of 300.00 Euro is available for local students which will not use the on-site lodging facilities (it includes local expenses for the lectures, coffee breaks and lunches). It is possible to require one additional night for the students that want to leave on Saturday the 12th. In this case the additional cost is 50 Euros.
Attendance is limited to 50 students and will be allocated on a first-come-first-served basis.

Advanced Topics in Programming Languages

Prof. Giuseppe Castagna, Université Paris Diderot - Paris 7

Program: In this course we study several "high level" aspects of programming languages. We introduce advanced concepts that complete the curricula on programming languages and can be used to compare different programming paradigms. We will use code excerpts of OCaml, Haskell, mainly, but also Scala, Perl 6, C#, Java, Erlang, Pascal, Python, Basic, CDuce, Xslt, Go, ... . The sense of this choice is that we want to focus more on programming concepts rather than on programming in a particular language.
Program: Program transformations. - The fuss about purity - A Refresher Course on Operational Semantics - Closure conversion - Defunctionalization - Exception passing style - State passing style - Continuations, generators, and coroutines - Continuation passing style Monadic Programming - Invent your first monad - More examples of monads - Monads and their laws - Program transformations and monads - Monads as a general programming technique - Monads and ML Functors Typing and Subtyping - Simple Types - Polymorphism - Recursive types XML Programming - XML basics - Set-theoretic types - Examples in Perl - Covariance and contravariance - XML Programming in CDuce

Slides: All(1.7MB),

Exam: Study topics on some research papers assigned by the instructor. For more info please email granwit [at] gmail.com indicating your name and university.

Models and Languages for Service-Oriented and Cloud Computing

Prof. Gianluigi Zavattaro, University of Bologna

Abstract: In modern technologies like Service-Oriented and Cloud Computing one of the most prominent challenges is related with the orchestration of the software artifacts that need to be properly composed and configured in order to provide the final user with the desired services. In the first part of this course we will review some of the models that have been proposed to perform a foundational study of the service composition problem, and we will present languages and tools developed to support the realization of “correct-by-construction” service compositions. In the second part of the course we will address the problem of deploying applications in the context of cloud computing, where it is necessary to provide the software artifacts with the required computing resources. We will discuss the deployment problem from a foundational perspective and, in the light of these foundational results, we will present a general approach to deal with deployment by separating it in two distinct problems: on the one hand, the computation of the distribution of the software artifacts over the available computing resources and, on the other hand, the automatic planning of the application configuration.

Slides: Orchestration(2.9MB), Choreography(5.9MB), Contracts(1.9MB) Deployment(8MB) Jolie Seminar(2.1MB)

Exam: Study and discuss some papers on a given topic.

Algorithmic methods for mining large graphs

Prof. Aristides Gionis, Aalto University

Program: Networks, or graphs, provide a powerful abstraction for modeling a wide variety of real-world data. Graph mining is the discipline of analyzing data represented as graphs. In this course we will provide an overview of some major problems in graph mining. We will then present fundamental algorithmic principles for solving those graph mining problems and discovering structure in large graphs; emphasis will be given in obtaining algorithms with provable guarantees and in the efficiency of the developed method.
Some of the algorithmic principles that will be discussed during the course are the following:
- combinatorial and graph-theoretic algorithms - optimization of submodular functions - sampling methods - methods for graph sketching and sparsification
The list of topics that will be covered includes: - efficient computation of motifs and graph statistics - finding dense subgraphs - inferrence of network structure - mining time-evolving networks and graph streams

Slides: Link,

Exam: Homework that should be submitted by the Apr 10 2016.

The registration fee for the School is 550.00 Euro and includes all local expenses from the evening of 6 March to 11 March afternoon including all meals and on-site lodging in double-occupancy rooms. A reduced registration fee of 300.00 Euro is available for local students which will not use the on-site lodging facilities (it includes local expenses for the lectures, coffee breaks and lunches). It is possible to require one additional night for the students that want to leave on Saturday the 12th. In this case the additional cost is 50 Euro. Attendance is limited to 50 students and will be allocated on a first-come-first-served basis.

In order to register all applicants must fill the form available at the following link: REGISTRATION FORM.

BISS 2015:

• Game Theory: Models, Numerical Methods, and Applications
• Protection of sensitive information
• Introduction to Modern Cryptography

BISS 2014:

• Big Data Analysis of Patterns in Media Content
• An Introduction to Probabilistic and Quantum Programming
• Development of dynamically evolving and self-adaptive software

BISS 2013:

• Foundations of Security: Cryptography, Protocols, Trust
• Stochastic Process Algebras for Quantitative Analysis
• Shape and Visual Apperance Acquisition for Photo-realistic Visualization

BISS 2012:

• Algorithms for the web and for social networks
• Software Verification and Interactive Theorem Proving
• Regularization methods for high dimensional learning

BISS 2011:

• Computational Aspects of Game Theory
• Trust in Anonymity Networks (TAN)
• Information Integration (II)
• Model Checking: From Finite-state to Infinite-state Systems (MCFIS)