Schedule

Opening 

2 talks à 40 min    

Nachum Dershowitz, Tel Aviv University, Israel 

[ONLINE]                       

Graphical Operational Semantics 

Wolfgang Reisig, Humboldt-Universität Berlin, Germany

[ONLINE]      

 Reflections about Yuri's Abstract State Machines 

2 talks à 40 min    

Philip Hieronymi, Bonn University, Germany 

A strong version of Cobham's theorem

Vladimir Lifschitz, University of Texas, Austin, USA                           

Verifying equivalence of declarative programs

2 talks à 40 min  

Andrei A. Bulatov, Simon Fraser University, Canada  

Commutative vs non-commutative CSP  

Janos Makowsky, Technion, Israel 

Supercongruences for Integer Sequences 

2 talks à 40 min

Arnon Avron, Tel Aviv University, Israel                                          

Predicative Set Theory and Predicative Analysis 

Valentin Goranko, Stockholm University, Sweden                             

 Almost sure theories of fragments of monadic second-order logic 

3 talks à 40 min    

Andreas Blass, University of Michigan, USA 

Infinite games, realistic games, and game semantics

Manfred Droste, Universität Leipzig, Germany 

Random constructions imply symmetry

Ronald de Wolf, CWI, Amsterdam, The Netherlands                              

Quantum Proofs for Classical Theorems 

2 talks à 40 min

Bertrand Meyer, Constructor Institute of Technology, Switzerland     

A new PRISM Programming Really Is Simple Mathematics 

Stefan Schmid, Technical University, Berlin, Germany                

Self-adjusting Topologies 

Concluding talk 

Yuri Gurevich, University of Michigan, USA    

The nature of nondeterministic (probabilistic, quantum, etc.) algorithms