RTA 2012 - 23rd International Conference on Rewriting Techniques and Applications

Program: TTATT 2012

Saturday June 2, Room on the 1st floor

09:00-10:00 Session 1 (Invited Talk)

C.-H. Luke Ong. Recursion Schemes, Tree Automata and Higher-Order Model Checking.
10:00-10:30 Coffee break

10:30-12:00 Session 2

Alexei Lisitsa. First-Order Logic for Tree Transducers Verification.
Chittaphone Phonharath, Kenji Hashimoto, and Hiroyuki Seki. Verification of the Security against Inference Attacks on XML Databases.
Naoki Kobayashi, Kazutaka Matsuda, and Ayumi Shinohara. Functional Programs as Compressed Data.
12:00-13:30 Lunch

13:30-15:00 Session 3

Naoki Nishida, Futoshi Nomura, Katsuhisa Kurahashi, and Masahiko Sakai. Constrained Tree Automata and their Closure Properties.
Akio Fujiyoshi. Tree Automata Moving Freely on Undirected Graphs.
Adrien Boiret, Aurélien Lemay, and Joachim Niehren. Learning Rational Functions.
15:00-15:30 Coffee break

15:30-17:00 Session 4

Akimasa Morihata. Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism (Extended Abstract).
Kazutaka Matsuda, Kazuhiro Inaba, and Keisuke Nakano. Polynomial-Time Inverse Computation for Accumulative Functions with Multiple Data Traversals.
Shin-ya Katsumata. A Categorical Approach to Attribute Grammars.