CSL'02 Preliminary Programme

Note: The talks by Max Kanovich and M. Andrew Moshier have been swapped from the order in the Proceedings, owing to travel difficulties experienced by Max Kanovich.

Saturday 21 September

10:00 - 12:30

14:00 - 16:30

19:00 - 21:00

Sunday 22 September

08:30 - 09:20

09:20 - 09:30

09:30 - 10:30 (Chair: Alex Simpson)

10:30 - 11:00 (Chair: Alex Simpson)

• A Logic for Probabilities in Semantics
   M. Andrew Moshier, Achim Jung
  

11:00 - 11:30

11:30 - 13:00 (Chair: Thorsten Altenkirch)

• On Continuous Normalization
   Klaus Aehlig, Felix Joachimski
  
• Variants of realizability for propositional formulas and logic of the weak law of excluded middle
   Alexey Chernov, Dmitriy Skvortsov, Elena Skvortsova, Nikolai Vereshchagin
  
• Compactness and Continuity, Constructively Revisited
   Douglas Bridges, Hajime Ishihara, Peter Schuster
  

13:00 - 14:30

14:30 - 16:00 (Chair: Susumu Hayashi)

• Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
   Tobias Nipkow
  
• A Fixpoint Theory for Non-monotonic Parallelism
   Yifeng Chen
  
• Greibach Normal Form in Algebraically Complete Semirings
   Zoltan Esik, Hans Leiss
  

16:00 - 16:30

16:30 - 18:00 (Chair: Simone Martini)

• Proofnets and context semantics for the additives
   Harry Mairson, Xavier Rival
  
• A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming
   Joshua Hodas, Pablo Lopez, Jeffrey Polakow, Lubomira Stoilova, Ernesto Pimentel
  
• Resource Tableaux (Extended Abstract)
   Didier Galmiche, Daniel Mery, David Pym
  

Monday 23 September

09:00 - 10:00 (Chair: Peter Buneman)

10:00 - 10:30 (Chair: Peter Buneman)

• Configuration Theories
   Pietro Cenciarelli
  

10:30 - 11:00

11:00 - 12:30 (Chair: Javier Esparza)

• Bijections Between Partitions by Two-Directional Rewriting Techniques
   Max Kanovich
  
• Possible World Semantics for General Storage in Call-By-Value
   Paul Levy
  
• A fully abstract relational model of Syntactic Control of Interference
   Guy McCusker
  

12:30 - 14:30

14:30 - 16:00 (Chair: Clemens Lautemann)

• Optimal Complexity Bounds for Positive LTL Games
   Jerzy Marcinkowski, Tomasz Truderung
  
• The Stuttering Principle Revisited
   Antonín Kucera, Jan Strejcek
  
• Trading Probability for Fairness
   Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger
  

16:00 - 16:30

16:30 - 18:00 (Chair: Frank Neven)

• A logic of probability with decidable model-checking
   Daničle Beauquier, Alexander Rabinovich, Anatol Slissenko
  
• Solving Pushdown Games with a Sigma_3 Winning Condition
   Thierry Cachat, Jacques Duparc, Wolfgang Thomas
  
• Partial Fixed-Point Logic and Infinite Structures
   Stephan Kreutzer
  

18:00 - 19:30 (Chair: Marc Bezem)

Tuesday 24 September

09:00 - 10:00 (Chair: Julian Bradfield)

10:00 - 10:30 (Chair: Julian Bradfield)

• On the variable hierarchy of the modal mu-calculus
   Dietmar Berwanger, Erich Graedel, Giacomo Lenzi
  

10:30 - 11:00

11:00 - 13:00 (Chair: Anuj Dawar)

• Implicit computational complexity for higher type functionals
   Daniel Leivant
  
• On generalizations of semi-terms of particularly simple form
   Matthias Baaz, Georg Moser
  
• Local problems, planar local problems and linear time
   Regis Barbanchon, Etienne Grandjean
  
• Equivalence and Isomorphism for Boolean Constraint Satisfaction
   Elmar Boehler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
  

Free afternoon. (Lunch not provided)

Evening

Wednesday 25 September

09:30 - 11:00 (Chair: Josh Hodas)

• Travelling on designs
   Claudia Faggian
  
• Designs, disputes and strategies
   Claudia Faggian, Martin Hyland
  
• Classical Linear Logic of Implications
   Masahito Hasegawa
  

11:00 - 11:30

11:30 - 13:00 (Chair: Albert Atserias)

• Higher-Order Positive Set Constraints
   Jean Goubault-Larrecq
  
• Proof Theoretical Account of Continuation Passing Style
   Ichiro Ogata
  
• Duality between Call-by-name Recursion and Call-by-value Iteration
   Yoshihiko Kakutani
  

13:00 - 14:30

14:30 - 16:00 (Chair: Roy Dyckhoff)

• Decidability of Bounded Higher-Order Unification
   Manfred Schmidt-Schauss, Klaus U. Schulz
  
• Open Proofs and Open Terms: a Basis for Interactive Logic
   Herman Geuvers, Georgi Jojgov
  
• Logical Relations for Monadic Types
   Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
  

16:30 - 18:00 (Chair: Janos Makowsky)

• On the Automatizability of Resolution and Related Propositional Proof Systems
   Albert Atserias, Maria Luisa Bonet
  
• Extraction of Proofs from the Clausal Normal Form Transformation.
   Hans De Nivelle
  
• Resolution refutations and propositional proofs with height-restrictions
   Arnold Beckmann
  

Approx 19:00 - 23:00

Change history

19/09/02 identified speaker.

18/09/02 Session chair; identified speakers where known.

17/09/02 Session chairs.

17/09/02 Swapped talks by Kanovich (now Monday 11:00) and Moshier (now Sunday 10:30).

17/09/02 Added tutorial, reception, dinner timings.

29/08/02 Changed Sunday/Wednesday timings, added lunches, added Wednesday event.

15/07/02 Swapped the 15:30 and 17:00 talks on Wednesday: now Nowak at 15:30 and de Nivelle at 17:00.