CSL 09
18th EACSL Annual Conference on Computer Science Logic

7-11 September 2009

Coimbra, Portugal

Timetable

Download: You may download the timetable as pdf file.

Download: Informal Presentations as pdf file.

Monday, Sept 7

8:30 Registration
8:50-9:00 Opening
9:00-10:00 Invited talk: Martin Grohe. Fixed-Point Definability and Polynomial Time.
10:00-10:30
Martin Hofmann and Dulma Rodriguez. Efficient Type-Checking for Amortised Heap-Space Analysis
10:30-11:00 Break
11:00-12:30
Rajeev Alur, Pavol Cerny and Scott Weinstein. Algorithmic Analysis of Array-Accessing Programs
Romain Péchoux and Marco Gaboardi. Upper Bounds on Streams I/O using Semantics Interpretations
Jan Schwinghammer, Lars Birkedal, Bernhard Reus and Hongseok Yang. Nested Hoare Triples and Frame Rules for Higher-order Store
12:30-14:00 Break
14:00-15:30
Heng Guo, Hanpin Wang and Zhongyuan Xu. On Model Checking Boolean BI
Stephan Kreutzer. On the parameterized intractability of monadic second-order logic
Anthony Widjaja To. Model checking FO(R) over one-counter processes and beyond
15:30-16:00 Break
16:00-17:30
Frederic Blanqui and Cody Roux. On the relation between size-based termination and semantic labelling
Joerg Endrullis, Herman Geuvers and Hans Zantema. Degrees of Undecidability in Term Rewriting
Glynn Winskel and David Turner. Nominal Domain Theory for Concurrency
17:30-19:00 Visit of the Old University
19:00 Porto de Honra

Tuesday, Sept 8

9:00-10:00 Invited talk: Thierry Coquand. Forcing and Type Theory.
10:00-10:30
Ulrich Berger. From coinductive proofs to exact real arithmetic
10:30-11:00 Break
11:00-12:30
Mariangiola Dezani, Paola Giannini and Simona Ronchi. Intersection, Universally Quantified and Reference Types
Andreas Abel. Type Structures and Normalization by Evaluation for System F-omega
Eijiro Sumii. A Complete Characterization of Observational Equivalence in Polymorphic lambda-Calculus with General References
12:30-14:00 Break
14:00-15:30
Alexander Rabinovich. Decidable Extensions of Church's Problem
James Laird. Nondeterminism and Observable Sequentiality
Vince Barany, Lukasz Kaiser and Alexander Rabinovich. Cardinality quantifiers in MLO over trees
15:30-16:00 Visit of the Science Museum
16:00-16:30 Break
16:30-18:00 Ackermann Award

Wednesday, Sept 9

9:00-10:00 Invited talk: Mikołaj Bojańczyk. Algebra for Tree Languages.
10:00-10:30
Isolde Adler and Mark Weyer. Tree-width for first order formulae
10:30-11:00 Break
11:00-13:00
Albert Atserias and Mark Weyer. Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Michael Ummels and Dominik Wojtczak. Decision Problems for Nash Equilibria in Stochastic Games
Amelie Gheerbrant and Balder ten Cate. Craig Interpolation on linear orders
Angelo Montanari, Gabriele Puppis and Pietro Sala. A Decidable Spatial Logic with Cone-shaped Cardinal Directions
14:30-18:00 Excursion
Conference Dinner

Thursday, Sept 10

9:00-10:00 Invited talk: Paulo Oliva. Functional Interpretations of Intuitionistic Linear Logic.
10:00-10:30
Guillaume Munch Maccagnoni. Focalization and Classical Realizability
10:30-11:00 Break
11:00-12:30
Beniamino Accattoli and Stefano Guerrini. Jumping Boxes. Representing lambda-calculus boxes by jumps
Jeff Egger, Rasmus Mogelberg and Alex Simpson. Enriching an Effect Calculus with Linear Types
Paolo Tranquilli. Confluence of Differential Nets with Promotion
12:30-14:00 Break
14:00-16:00 Informal presentations: --- Jesse Alama --- Gilda Ferreira --- Jaime Gaspar --- David Pereira, Nelma Moreira and Simão Melo de Sousa --- Anthony Widjaja To and Leonid Libkin
16:00-16:30 Break
16:30-18:00
Luigi Santocanale and Robin Cockett. On the word problem for SP-categories, and the properties of two-way communication
Corina Cirstea, Clemens Kupke and Dirk Pattinson. EXPTIME Tableaux for Coalgebraic mu-calculi
Volker Weber. On the Complexity of Branching-Time Logics
18:00-19:00 Meeting of the EACSL

Friday, Sept 11

9:00-10:30
Dietrich Kuske and Markus Lohrey. Automatic structures of bounded degree revisited
Jacques Duparc, Filip Murlak and Alessandro Facchini. Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Matthias Horbach and Christoph Weidenbach. Deciding the Inductive Validity of ∀∃* Queries
10:30-11:00 Break
11:00-12:00
Agata Ciabattoni, Lutz Strassburger and Kazushige Terui. Expanding the realm of systematic proof theory
Makoto Tatsuta. Non-Commutative First-Order Sequent Calculus
12:00-13:00 Invited talk: Yiannis Moschovakis. Kleene's Amazing Second Recursion Theorem.