Full Programme

	Tuesday Sept. 6	Wednesday Sept. 7		Thursday Sept. 8		Friday Sept. 9
09.00-10.00
10.00-10.30	Coffee
10.30-12.30
12.30-14.00	Lunch
14.00-15.30
15.30-16.00	Coffee					Coffee
16.00-17.00
19.00-21.00				Dinner

There will be no talks on Thursday afternoon, September 8. Participants will have a free afternoon to take part of the excursion (London Eye) and the Conference Dinner (evening).

SAS Programme

	Wednesday, September 7
09.00-10.00	Invited Speaker: Francois Fages, INRIA. Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM
10.00-10.30	Coffee
10.30-12.30	Session 1. Chair: Harald Sondergaard Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra. Roberto Bagnara, Enric Rodríguez-Carbonell, Enea Zaffanella. Exploiting Sparsity in Polyhedral Analysis . Axel Simon, Andy King. A Relational Abstraction for Functions . Bertrand Jeannet, Denis Gopan, Thomas Reps. Locality-based Abstractions. Javier Esparza, Pierre Ganty, Stefan Schwoon.
12.30-14.00	Lunch
14.00-15.30	Session 2. Chair: Alan Mycroft Interprocedural Shape Analysis for Cutpoint-Free Programs. Noam Rinetzky, Mooly Sagiv, Eran Yahav. Boolean Heaps . Andreas Podelski, Thomas Wies. Finding Basic Block and Variable Correspondence . Iman Narasamdya, Andrei Voronkov.
15.30-16.00	Coffee
16.00-17.00	Session 3. Chair: Chris Hankin Pair-Sharing Analysis of Object-Oriented Programs . Stefano Secci, Fausto Spoto Memory Usage Verification for OO Programs . Wei-Ngan Chin, Huu Hai Nguyen, Shengchao Qin, Martin Rinard.

	Thursday, September 8
09.00-10.00	Invited Speaker: Samson Abramsky. Oxford University Computing Laboratory. Algorithmic Game Semantics and Static Analysis .
10.00-10.30	Coffee
10.30-12.30	Session 4. Chair: Pasquale Malacaria Data-Abstraction Refinement: A Game Semantic Approach. Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic. Abstraction Refinement for Termination. Byron Cook, Andreas Podelski, Andrey Rybalchenko. A Generic Framework for Interprocedural Analysis of Numerical Properties . Helmut Seidl, Markus Mueller-Olm. Widening Operators for Weakly-Relational Numeric Abstractions. Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella.
12.30-14.00	Lunch
Afternoon	Excursion
Evening	Dinner

	Friday, September 9
09.00-10.00	Invited Speaker: Andrew Gordon. Microsoft Research. From Typed Process Calculi to Source-based Security.
10.00-10.30	Coffee
10.30-12.30	Session 5. Chair: Roberto Giacobazzi Secure Information Flow as a Safety Problem . Tachio Terauchi, Alex Aiken. Using Dependent Types to Certify the Safety of Assembly Code. Matthew Harren, George C. Necula. The PER Model of Abstract Non-Interference. Sebastian Hunt, Isabella Mastroeni. Memory Space Conscious Loop Iteration Duplication for Reliable Execution . G. Chen, M. Kandemir, M. Karakoy.
12.30-14.00	Lunch
14.00-15.30	Session 6. Chair: German Puebla Banshee: A Scalable Constraint-Based Analysis Toolkit . John Kodumal, Alex Aiken. Understanding the Origin of Alarms in Astree. Xavier Rival. Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis . Yungbum Jung, Jaehwang Kim, Jaeho Shin, Kwangkeun Yi.
15.30-16.00	Coffee
16.00-17.00	Session 7. Chair: Andy King Type-Safe Optimisation of Plugin Architectures. Neal Glew, Jens Palsberg, Christian Grothoff. Inference of Well-typings for Logic Programs with Application to Termination Analysis . Maurice Bruynooghe, John Gallagher, Wouter Van Humbeeck.

LOPSTR Programme

	Wednesday, September 7
09.00-10.00	Invited Speaker: Francois Fages, INRIA. Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM
10.00-10.30	Coffee
10.30-12.30	Session 1: Program Development Declarative Programming with Function Patterns . Sergio Antoy and Michael Hanus. Functional Programming and Program Transformation with Interaction Nets. Ian Mackie, Jorge Sousa Pinto and Miguel Vilaça. Transformational Verification of Parameterized Protocols Using Array Formulas. Alberto Pettorossi, Maurizio Proietti and Valerio Senni. Design and Implementation of A_T: A Real-Time Action Description Language. Ajay Mallya, Luke Simon and Gopal Gupta.
12.30-14.00	Lunch
14.00-15.30	Session 2: Program Transformations I Factoring Out Logic Programs . Francisco Bueno. An Algorithm for Local Variable Elimination in Normal Logic Programs . Javier Álvez and Paqui Lucio. Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs. Claudio Ochoa, German Puebla and Manuel Hermenegildo.
15.30-16.00	Coffee
16.00-17.00	Session 3: Program Transformations II Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives. Kohei Suenaga, Naoki Kobayashi and Akinori Yonezawa. Non-Leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates. Elvira Albert, German Puebla and John Gallagher.

	Thursday, September 8
09.00-10.00	Invited Speaker: Samson Abramsky. Oxford University Computing Laboratory. Algorithmic Game Semantics and Static Analysis .
10.00-10.30	Coffee
10.30-12.30	Session 4: Component-Based Software Development A Transformational Semantics of Static Embedded Implications. Edelmira Pasarella, Fernando Orejas, Elvira Pino and Marisa Navarro. Refining Behaviors of Inter-component Requirements . Sun Meng and Abhik Roychoudhury. Autoepistemic Logic Programming for Reasoning with Inconsistency. Zoran Majkic. Reconstruction of the Lloyd-Topor Transformation using Partial Evaluation. Stephen-John Craig and Michael Leuschel.
12.30-14.00	Lunch
Afternoon	Excursion
Evening	Dinner

	Friday, September 9
09.00-10.00	Invited Speaker: Andrew Gordon. Microsoft Research. From Typed Process Calculi to Source-based Security.
10.00-10.30	Coffee
10.30-12.30	Session 5: Program Analysis Converting one Type-Based Domain to Another. John P. Gallagher, German Puebla and Elvira Albert. Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. Manh Thang Nguyen and Danny De Schreye. A Logico-Algebraic Approach to Probabilistic Program Analysis. Alessandra Di Pierro and Herbert Wiklicky. Experiments in Context-Sensitive Analysis of Modular Programs. Jesús Correas, German Puebla, Manuel V. Hermenegildo and Francisco Bueno.
12.30-14.00	Lunch

PLID Programme

	Tuesday, September 6
09.00-10.00	Session 1: Chair Dave Sands Invited Speaker: Nobuko Yoshida, Imperial College London Mobile Computing, Types and Security.
10.00-10.30	Coffee
10.30-12.30	Session 2. Chair: Sebastian Hunt Flow Sensitive Types. Sebastian Hunt and David Sands. Active Attacks in Abstract Non-Interference. Isabella Mastroeni. Analysing Program Branching Using Information Theory. David Clark, Sebastian Hunt and Pasquale Malacaria. Time-based Interference and Probabilistic Padding. Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky.
12.30-14.00	Lunch
14.00-15.30	Session 3. Chair: Alessandra Di Pierro Practical, Dynamic Information-flow for Virtual Machines. Vivek Haldar, Deepak Chandra and Michael Franz. Non-Interference and Simple Erasure Policies for Java Card Bytecode. René Rydhof Hansen. Short Talks: . - Specifying and Refining Confidentiality using the B-method. Temitope Onunkun. - Flow Locks for Dynamic Policies. David Sands. - Correctness for a Non-standard Slicing Semantics. Sebastian Danicic. - Interference Analysis in Systems Biology. Roberto Giacobazzi.
15.30-16.00	Coffee
16.00-17.00	Session 4. Chair: Sebastian Danicic Correctness for Slicing EFSMs. Kelly Androutsopoulos, David Clark, Mark Harman and Laurie Tratt. Deciding equivalence of liberal, free, function-linear schemas to their slices. Mike Laurence.