(London House Small Common Room, Goodenough College )
Session 1: Theme:
9:50 - 10:45
Geoffrey Smith (Invited speaker)
Quantitative Information Flow and Min-Entropy
10:45 - 11:00 Catuscia Palamidessi Bayesian risk in information hiding.
Session 2: Theme:
Algebra,  Logic, Types, Quantitative Information Flow
Jonathan Heusser Lattice of Information, Quantitative Information Flow and Declassification
12:00-12:40 Joshua Guttman Specifying paths of information flow via linear temporal logic
12:40-12:55 Sebastian Hunt A cubic algorithm for erasure type inference


Session 3: Theme:
Statistical Measurements and Channel Capacity
14:10 -14:50 Tom Chothia Statistical Measurement of Information Leakage
14:50 -15:30 Han Chen Channel Capacity for Anonymity Protocols and Programs

Session 4: Theme
Implementative aspects of Quantitative Information Flow

15:40 - 16:20 Boris Köpf Automatic Discovery and Quantification of Information Leaks
16:20 - 16:35 Henning Sudbrock Increasing the Precision of the Combining Calculus
16:35 - 16:50 Ping Zhu Qualitative relational properties to improve the precision of quantitative info flow analysis
16:50 - 17:15 Herbert Wiklickly Timing leaks and how to fix them
17:30 -18:00 Discussion and Conclusion Perspectives for Quantitative Information flow

Location Registration and Date

The workshop will be held in central London in the beautiful location of Goodenough College on the 30th of March 2009 (Talks will be in the London house small common room). The workshop is sponsored by EPSRC and will be free to participants. To register email the organizer Pasquale Malacaria (there is a limited capacity, places allocated on a first come first serve basis).

Geoffrey Smith will be the invited speaker.


Goodenough College has good visitor rooms; rates and availability on this link .
Additional hotels in the area around the venue (Central London) can be found on tripadvisor here. Tripadvisor, thanks to the revues, provides a pretty faithful description of the accommodation.

Theme of the workshop

Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. Doing these things requires theories, models and semantics for interference and dependence, as well as algorithms and tools for analysis and reasoning about interference and dependence. The aim of this workshop is to gather together the community of people that study dependence and interference from the different points of view in order to generate new possible research directions. PLID is devoted to bridging all these communities and assisting work towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence.