The Conference Programme

Monday, June 27

10:00–13:00 TUTORIAL (Chair Mikhail Bulyonkov)

10:00 Andreas Zeller (Saarland University, Germany)
Mining Programs

11:30–12:00 Refreshments

12:00 Andreas Zeller (Saarland University, Germany)
Mining Programs

13:00–14:00 Lunch

19:00–23:00 Welcome Party

Tuesday, June 28

9:30–10:45 Opening PSI’11 (Chair Alexander Marchuk)

9:45 Andreas Zeller (Saarland University, Germany)
Invited Talk: Mining Precise Specifications

10:45–11:15 Refreshments

11:15–12:45 Session 1 (Chair Andrei Voronkov)

11:15 Robert Glück (DIKU, U Copenhagen, Demnark)
Bootstrapping Compiler Generators from Partial Evaluators

11:45 Geoff Hamilton (Dublin City U, Ireland), Neil Jones (DIKU, U Copenhagen, Demnark)
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation

12:15 Torben Mogensen (DIKU, U Copenhagen, Denmark)
Partial Evaluation of Janus part 2: Assertions and Procedures

13:00–14:00 Lunch

14:00–15:30 Session 2 (Chair Val Tannen)

14:00 Peter Buneman (The University of Edinburgh, UK)
Invited Talk: Models of Provenance

15:00 Michael Fried, Anna Fensel (STI Innsbruck, Austria), Federico Michele Facca (CREATE-NET, Trento, Italy), Dieter Fensel (STI Innsbruck, Austria)
An Extensible System for Enhancing Social Conference Experience

15:30–16:00 Refreshments

16:15–22:00 Visiting Opera & Ballet Theatre

Wednesday, June 29

9:30–10:30 Session 3 (Chair Eike Best)

9:30 Ugo Montanari (Pisa University, Italy)
FME Invited Talk: A Connector Algebra for Place-Transition Petri Nets

10:30–11:00 Refreshments & Group Photo

11:00–12:00 Session 4 (Chair Torben Mogensen)

11:00 Andrei V. Klimov (Keldysh Inst. Applied Mathematics, Moscow, Russia)
Solving Coverability Problem for Monotonic Counter Systems by Supercompilation

11:30 Ilya Klyuchnikov, Sergei A. Romanenko (Keldysh Inst. Applied Mathematics, Moscow, Russia)
Multi-Result Supercompilation as Branching Growth of the Penultimate Level in Metasystem Transitions

12:00–13:00 Poster Session

13:00–14:00 Lunch

15:00–21:00 Barbecue

Thursday, June 30

9:30–11:00 Session 5 (Chair Ugo Montanari)

9:30 Eike Best (Oldenburg University, Germany)
Invited Talk: Petri Net Distributability

10:30 Arpit Sharma, Joost-Pieter Katoen (RWTH Aachen U, Germany)
Weighted Lumpability on Markov Chains

11:00–11:30 Refreshments

11:30–13:15 Session 6 (Chair Konstantin Korovin)

11:30 Thomas Studer (U Bern, Switzerland)
Justified Terminological Reasoning

12:00 Radu Mardare (Aalborg University, Denmark)
Decidability of Modular Logics for Concurrency

12:30 Alexander Letichevsky, Olexander Letichevskyi (Glushkov Inst Cybernetics, Kiev, Ukraine), Vladimir Peschanenko (Kherson State U, Ukraine)
Insertion Modeling System

12:45 Natalia Garanina (Inst. Inform. Syst., Novosibirsk, Russia)
Exponential Acceleration of Model Checking for Perfect Recall Systems

13:15–14:00 Lunch

14:00–15:45 Session 7 (Chair Rupak Majumdar)

14:00 Nestan Tsiskaridze, Andrei Voronkov, Konstantin Korovin (Manchester U, UK)
Implementing Conflict Resolution

14:30 Margus Veanes, Nikolaj Bjorner (Microsoft Research, Redmond, USA)
Symbolic Tree Transducers

15:00 Jens Knoop, Laura Kovacs, Jakob Zwirchmayr (TU Vienna, Austria)
Symbolic Loop Bound Computation for WCET Analysis

15:30 Konstantin Korovin, Andrei Voronkov (Manchester U, UK)
GoRRiLA and Hard Reality

15:45–16:15 Refreshments

16:15–17:30 Session 8 (Chair Frédéric Benhamou)

16:15 Evgeny Vityaev (Inst. Mathematics, Novosibirsk, Russia), Alexander Demin (Inst. Inform. Syst., Novosibirsk, Russia), Denis Ponomaryov (Inst. Inform. Syst., Novosibirsk, Russia)
Probabilistic Concepts in Formal Contexts

16:45 Rafael Caballero, Yolanda García-Ruiz, Fernando Saenz-Perez (U Complutense Madrid, Spain)
Algorithmic Debugging of SQL Views

17:00 Nikolay Shilov (Inst. Inform. Syst., Novosibirsk, Russia), Renat Idrisov, Alexander Akinin, Alexey Zubkov (Novosibirsk State U, Russia)
Development of the Computer Language Classification Knowledge Portal

17:15 Evgueni Petrov (Intel, Novosibirsk, Russia)
Scalable Parallel Interval Propagation for Sparse Constraint Satisfaction Problems

Friday, July 1

9:30–11:00 Session 9 (Chair Robert Glück)

9:30 Rupak Majumdar (MPI-SWS, Germany)
Invited Talk: End-to-end Guarantees in Embedded Control Systems

10:30 Thomas Baar, Philipp Kumar (akquinet tech@spree GmbH, Berlin, Germany)
Detecting Entry Points in Java Libraries

11:00–11:30 Refreshments

11:30–13:00 Session 10 (Chair Thomas Baar)

11:30 Alexey Khoroshilov, Vadim Mutilin, Eugene Novikov, Pavel Shved and Alexander Strakh (Inst. System Programming, Moscow, Russia)
Towards an Open Framework for C Verification Tools Benchmarking

12:00 Michael Beyer, Sabine Glesner (TU-Berlin, Germany)
Static Analysis of Run-time Modes in Synchronous Process Networks

12:30 Mauro Jaskelioff (CIFASIS-CONICET/Universidad Nacional de Rosario, Argentina), Alejandro Russo (Chalmers U Techn., Gothenburg, Sweden)
A Library for Secure Multi-Execution in Haskell

12:45 Andrey Ponomarenko, Vladimir Rubanov (Inst. System Programming, Moscow, Russia)
Backward Compatibility of Software Interfaces: Steps towards Automatic Verification

13:00–14:00 Lunch

14:00–15:15 Session 11 (Chair Irina Virbitskaite)

14:00 Margarita Korovina (Manchester U, UK), Nicolai Vorobjov (U Bath, UK)
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems

14:30 Roman Dubtsov (Inst. Inform. Syst., Novosibirsk, Russia)
Timed Transition Systems with Independence and Marked Scott Domains: an Adjunction

14:45 Nataliya Gribovskaya (Inst. Inform. Syst., Novosibirsk, Russia)
A Logic Characteristic For Timed Extensions of Partial Order Based Equivalences

15:00 Elena Bozhenkova (Inst. Inform. Syst., Novosibirsk, Russia)
Compositional Methods in Characterization of Timed Event Structures

19:00–23:00 Concluding Session — Conference Dinner