Category Archives: News

EPEW 2013 – In Venice

The European Workshop on Performance Engineering 2013 will be held in Venice on 16-17 September. The Deadline for the submission is May, 25th.
The European Performance Engineering Workshop is an annual event that aims to gather academic and industrial researchers working on all aspects of performance engineering. Original papers related to theoretical and methodological issues as well as case studies and automated tool support are solicited in the following three areas: Performance Modelling and Evaluation, System and network performance engineering, Software performance engineering.

See the call for papers
See the event website

Call for PhD positions – deadline May, 27th

Ca’ Foscari University of Venice announces 10 PhD positions (6 with scholarship) in Computer Science. The Doctoral programme in Computer Science trains scholars to design, develop and lead academic and industrial research projects. It provides students with the formal background and tools needed to perform research in a rigorous way, and with the methodologies for the design and evaluation of IT systems and applications.

See the call

20.03.2013 – EACTS best paper award!

Good news from ETAPS 2013!

The paper

Logical Foundations of Secure Resource Management in Protocol Implementations
by Michele Bugliesi, Stefano Calzavara, (Univ. Ca’ Foscari, ACADIA),
Fabienne Eigener, Matteo Maffei (Univ. of Saarland)

has been awarded the EATCS Best Paper prize  at ETAPS 2013, the European Joint Conference on Theory and Practice of Software, which includes the following conferences:

International Conference on Compiler Construction (CC)
European Symposium on Programming (ESOP)
Int. Conference on Fundamental Approaches to Software Engineering (FASE)
Int. Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
International Conference on Principles of Security and Trust (POST)
Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems  (TACAS)

The prize is awarded by the European Association for Theoretical Computer Science EATCS  to the best  theoretical paper amongst the papers presented at all the ETAPS conferences.

Open postdoc fellowship

We are seeking to recruit a post-doc fellow to conduct integrative theoretical and experimental research in modelling principles and analysis techniques for distributed and pervasive systems.

Requirements: Applicants must hold a Ph.D degree in Computer Science or related subject before the application deadline. The successful candidate will submit a scientifically excellent research proposal,  relevant to the topics of the call, and display:

  • Scientific knowledge across the relevant subjects,
  • Technical competence and a strong publication record,
  • Team working skills,
  • Leadership experience,
  • Ability to organize her/him self and others.

Funding: is for one year, renewable, at approximately 24,000 Euro gross, including mobility allowances (that corresponds to around 21,000 Euro net). The fellowship is expected to start in May / June 2013

See this page for full detalis.

08.02.2013 – Kick off progetto SmeD

Kick off progetto SmeD

Venerdì 8 febbraio 2013, ore 11:00, presso l’Università “Ca’ Foscari” di Venezia, al Dipartimento di Scienze Ambientali, Informatica e Statistica (DAIS) di Via Torino 155, Mestre-Venezia.


  1. Saluti e presentazione del DAIS
    Prof. Michele Bugliesi,
    Direttore DAIS, Università “Ca’ Foscari” di Venezia
  2. Gli obiettivi della collaborazione con l’Università “Ca’ Foscari” di Venezia
    Ing. Elvio Tasso,
    Direttore Sistemi Informativi della Regione del Veneto
  3. Il Laboratorio di eGovernment di Regione Veneto ed Università
    Prof. Agostino Cortesi, DAIS
    Responsabile Scientifico SmeD
  4. Il Progetto SmeD: struttura e pianificazione
    Dott. Antonio Candiello, DAIS
    Coordinatore del Progetto SmeD
  5. L’infrastruttura applicativa della Regione Veneto
    Ing. Andrea Boer
    Responsabile Unità Complessa e-Government e Società dell’Informazione
  6. Gli obiettivi a medio termine “di produzione” del progetto SmeD
    Dott. Antonino Mola,
    Responsabile PO “Sviluppo Piani e Programmi per la Società dell’Informazione”

07.02.2013 – Talk by Lucia Gallina

Title: Bisimulation-based pre-orders for  the analysis of Energy performance in Wireless Sensor Networks.
Time: 13:00
Location: Meeting room
Type: Research achievement
Speaker: Lucia Gallina

Wireless Sensor Networks are made of a large number of sensor nodes, which are small in size and have scarce energy resources. They use their processing abilities to locally carry out simple computations and transmit partially processed data. Sensor networks are widely used for several applications, such as military systems, environmental, health or other commercial applications.Since the sensor networks consist of large numbers of sensor nodes, with limited power sources, energy conservation is one of the most critical issues to deal with.

We present a probabilistic process calculus to model wireless sensor networks.
This model is specifically aimed at studying the performances of those networks with respect to various metrics, such as the energy consumption, the throughput or the time delay.

PRISM is a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour. We show how we can translate our calculus with the PRISM specification language to perform an automatic verification of the energy-aware performances of wireless sensor networks.

29.01.2013 – Talk by Silvia Crafa

Title: Process Calculi and Actor Model: two concurrent models of concurrency or two abstraction levels?
Time: 13:00
Location: Meeting room
Type: Research Talk
Speaker: Silvia Crafa (University of Padova)
The Actor model and Process Calculi are two mathematical models of concurrent computation that share some similarities but diverge in many ways. They both have been proposed in the ’70ies and they evolved “concurrently” with mutual influences. In this talk we will discuss the assets produced by the distinctive key features of the two models, providing insights and trying to device further cross-fertilizations.

25.01.2013 – Talk by Hoang Vu Tuan

Title: The PRISM tool and its applications
Time: 14:00
Location: Meeting room
Type: Tool presentation
Speaker: Hoang Vu Tuan

In this presentation, I will consider some models and show how it is possible to derive some meaningful properties by using the PRISM model checker. PRISM tool supports  four types of models whose underlying processes can be Discrete-time Markov chain (DTMC), Continuous-time
Markov chains (CTMC), Markov decision processes (MDP) and Probabilistic timed automata (PTA). For each of these classes, a set of properties can be analysed. The talk will rely on a case study to illustrate the PRISM functionalities. Specifically,  the Stable Matching problem will be addressed by applying the DTMC analysis.

16.01.2013 – Talk by Maria Grazia Vigliotti

Title: Separable solution for interacting stochastic automata

Date: 16/01/2013
Time: 1:30 pm
Location: Sala riunioni
Type: research talk
Speaker: Maria Grazia Vigliotti (Imperial College, London)

We present product-form solutions from the point of view of stochastic process algebra. In previous work  we have shown how to  derive
product-form solutions for a formalism called Labelled Markov Automata (LMA). LMA are very useful as their relation  with  the Continuous Time Markov Chains is very direct. The disadvantage  of using LMA is that the proofs of properties  are  cumbersome. In fact,  in LMA it is not possible  to use the inductive structure of the language in a proof.   In this paper we consider a simple stochastic process algebra that has the great advantage of simplifying  the  proofs. This simple language has been  inspired by PEPA, however,
detailed analysis of  the semantics of  cooperation  will  show the differences between  the two formalisms. It will  also  be shown that  the semantics of the cooperation in process algebra influences the correctness of the derivation of the product-form solutions.

10.01.2013 – Talk by Giovanni Bernardi

Title: Testing preorders for clients and peers

Date: 10/01/2012
Time: 1:00 pm
Location: Sala riunioni
Type: research talk
Speaker: Giovanni Bernardi (Trinity College, Dublin)

The must testing is a formalism that let us reason on the safety of  computations performed by two communicating parties; typically a  client (test) and a server (process). By using the must testing one can define three refinements that state when it is safe to replace servers, clients, or peers.
In this talk we explain the classic semantic characterisation of the must preorder for servers, and then we show how to generalise so as to characterise also the preorders for clients and peers.