Schedule – Logical Foundations Of Computer Science

8:00 – 8:30: Registration
8:30 – 8:35: Opening of LFCS 2013
8:35 – 9:00: Alejandro Díaz-Caro, Giulio Manzonetto and Michele Pagani.
Call-by-Value Non-determinism in a Linear Logic Type Discipline
9:00 – 9:25: Marc Bender and Jeff Zucker.
Assignment Calculus: A Case Study in Imperative Reasoning
9:25 – 9:50: Jean-Pierre Talpin, Jens Brandt, Mike Gemuende, Klaus Schneider and Sandeep Shukla.
Constructive Polychronous Systems
9:50 – 10:15: Alexey Sorokin.
Normal forms for Multiple Context-Free Languages and Displacement Lambek Grammars
10:15 – 10:40: Coffee break
10:40 – 11:40: Invited Talk: Melvin Fitting (City University of New York)
11:40 – 12:05: Junhua Yu.
Self-referentiality in the Brouwer-Heyting-Kolmogorov Semantics
12:05 – 12:30: Igor Sedlar.
Justifications, Awareness and Epistemic Dynamics

2:00 – 2:25: Robert Milnikel.
The Logic of Uncertain Justifications
2:25 – 2:50: Ren-June Wang.
Temporalizing Modal Epistemic Logic
2:50 – 3:15: Evangelia Antonakos.
Explicit Generic Common Knowledge
3:15 – 3:40: Roman Kuznets and Thomas Studer.
Update As Evidence: Belief Expansion
3:40 – 4:10: Coffee Break
4:10 – 4:35: Thomas Brihaye, Julie De Pril and Sven Schewe.
Multiplayer Cost Games with Simple Nash Equilibria
4:35 – 5:00: Çağil Taşdemir.
On tolerance analysis of games with belief revision
5:00 – 5:25: Luca Aceto, Anna Ingolfsdottir, Cristian Prisacariu and Joshua Sack.
Compositional Reasoning for Epistemic Logics
5:25 – 5:50: Konstantinos Georgatos.
Iterated Contraction Based on Indistinguishability
5:50 – 6:15: Marc Bender and Jeff Zucker.
Assignment Calculus: A Case Study in Imperative Reasoning

8:30 – 8:55: Agata Ciabattoni, Ori Lahav, Lara Spendier and Anna Zamansky.
Automated Support for the Investigation of Paraconsistent and Other Logics
8:55 – 9:20: Jean-René Courtault and Didier Galmiche.
A Modal BI Logic for Dynamic Resources Properties
9:20 – 9:45: Jeroen Goudsmit.
A Note on Extensions: Admissible Rules via Semantics
9:45 – 10:10: Rutger Kuyper.
Computational Hardness of Validity in Probability Logic
10:15 – 10:40: Coffee break
10:40 – 11:40: Invited Talk: Russell Impagliazzo (University of California San Diego)
11:40 – 12:05: Bernhard Heinemann.
Subset Space vs Relational Semantics of Bimodal Logic: Bringing Out the Difference
12:05 – 12:30: Robert Lubarsky and Hannes Diener.
Separating the Fan Theorem and Its Weakenings

2:00 – 2:25: Gilles Barthe, Juan Manuel Crespo and César Kunz.
Beyond 2-safety: asymmetric product programs for relational program verification
2:25 – 2:50: Alex Brik and Jeffrey Remmel.
Forward Chaining for Hybrid ASP
2:50 – 3:15: John Case, Sanjay Jain and Frank Stephan.
Effectivity Questions for Kleene’s Recursion Theorem
3:15 – 3:40: Douglas Cenzer and Jeffrey Remmel.
Sub-computable bounded pseudorandomness
3:40 – 4:10: Coffee Break
4:10 – 4:35: Benoit Delahaye, Axel Legay and Kim Guldstrand Larsen.
Stuttering for Abstract Probabilistic Automata
4:35 – 5:00: Jacques Duparc, Olivier Finkel and Jean-Pierre Ressayre.
The Wadge Hierarchy of Petri Nets omega-Language
5:00 – 5:25: Ping Hou.
Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems
5:25 – 5:50: Sebastian Wyman.
Conservatively Approximable Functions