Program of RTA

Sunday, July 11th

Sunday's program is also available with abstracts and side by side with other events.

09:00‑10:00 Session 1
Chair: Georg Moser
Location: AT LT3
09:00 Patrick Bahr
Partial Order Infinitary Term Rewriting and Böhm Trees
09:30 Hans Zantema and Matthias Raffelsieper
Proving Productivity in Infinite Data Structures
10:30‑12:30 Session 2
Chair: Johannes Waldmann
Location: AT LT3
10:30 Marc Sylvestre, Irène Durand and Géraud Sénizergues
Termination of linear bounded term rewriting systems
11:00 Christian Sternagel and René Thiemann
Certified Subterm Criterion and Certified Usable Rules
11:30 Friedrich Neurauter and Aart Middeldorp
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
12:00 Carsten Otto, Marc Brockschmidt, Christian von Essen and Jürgen Giesl
Automated Termination Analysis of Java Bytecode by Term Rewriting
14:00‑15:00 FLoC Plenary Talks: tribute to Amir and Robin
Chair: Moshe Vardi
Location: George Square Lecture Theatre
14:00 David Harel (Weizmann Institute of Science)
Amir Pnueli: A Gentle Giant, Lord of the Phi's and the Psi's.
14:30 Gordon Plotkin (University of Edinburgh)
Robin Milner, a Craftsman of Tools for the Mind.
15:30‑17:20 Session 3
Chair: Dan Dougherty
Location: AT LT3
15:30 Alexander Koller and Stefan Thater
Underspecified computation of normal forms
16:00 Karl Gmeiner, Bernhard Gramlich and Felix Schernhammer
On (Un)Soundness of Unravelings
16:30 Adrian Riesco, Alberto Verdejo and Narciso Marti-Oliet
Declarative Debugging of Missing Answers for Maude Specifications
17:00 Mark Hills and Grigore Rosu
A Rewriting Logic Semantics Approach to Modular Program Analysis
Monday, July 12th

Monday's program is also available with abstracts and side by side with other events.

09:00‑10:00 Session 4
Chair: Sophie Tison
Location: AT LT3
09:00 Mikolaj Bojanczyk (Warsaw University)
Invited Talk: Automata for Data Words and Data Trees
10:30‑12:30 Session 5
Chair: Delia Kesner
Location: AT LT3
10:30 Alessio Guglielmi, Tom Gundersen and Michel Parigot
A proof calculus which reduces syntactic bureaucracy
11:00 Claus Appel, Vincent van Oostrom and Jakob Grue Simonsen
Higher-Order (Non-)Modularity
11:30 Ken-etsu Fujita and Aleksy Schubert
The undecidability of type related problems in type-free style System F
12:00 Manfred Schmidt-Schauss, David Sabel and Elena Machkasova
Simulation in the Call-by-Need Lambda-Calculus with letrec
14:00‑15:00 Session 6
Chair: Fairouz Kamareddine
Location: AT LT3
14:00 Vincent van Oostrom (Utrecht University)
Invited Talk: Realising Optimal Sharing
16:00‑17:00 Session 7
Chair: Bernhard Gramlich
Location: AT LT3
16:00 Samuel Mimram
Computing Critical Pairs in 2-Dimensional Rewriting Systems
16:30 Jordi Levy and Mateu Villaret
An Efficient Nominal Unification Algorithm
17:15‑18:15 Session 8
Location: AT LT3
17:15 RTA Business Meeting
Tuesday, July 13th

Tuesday's program is also available with abstracts and side by side with other events.

09:00‑10:00 FLoC Plenary Talk: Georg Gottlob
Chair: Martin Grohe
Location: George Square Lecture Theatre
09:00 Georg Gottlob (University of Oxford)
Datalog+-: A Family of Logical Query Languages for New Applications.
10:30‑12:30 Session 9
Chair: Rachid Echahed
Location: AT LT3
10:30 Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop and Vincent van Oostrom
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
11:00 Patrick Bahr
Abstract Models of Transfinite Reductions
11:30 Stefan Kahrs
Infinitary Rewriting: Foundations Revisited
12:00 Jakob Grue Simonsen
Weak Convergence and Uniform Normalization in Infinitary Rewriting
14:00‑15:00 FLoC Keynote Talk: J Strother Moore
Chair: Jean-Pierre Jouannaud
Location: George Square Lecture Theatre
14:00 J Strother Moore (University of Texas)
Theorem Proving for Verification: The Early Days.
15:30‑17:20 Session 10
Chair: Femke van Raamsdonk
Location: AT LT3
15:30 Harald Zankl and Martin Korp
Modular Complexity Analysis via Relative Complexity
16:00 Martin Avanzini and Georg Moser
Closing the Gap Between Runtime Complexity and Polytime Computability
16:30 Johannes Waldmann
Polynomially Bounded Matrix Interpretations
17:00 Sarah Winkler, Haruhiko Sato, Aart Middeldorp and Masahito Kurihara
Optimizing mkbTT (System Description)