TTATT 2012
1st International Workshop
on Trends in Tree Automata and Tree Transducers

June 2, 2012
Nagoya, Japan

Invited Speaker

• C.-H. Luke Ong (University of Oxford)

Program

• 8:30 - 9:00 Registration
  
  
• 9: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, Aurelien 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

Topics and Goals

Tree automata and tree transducers have a history of more than forty years. Recently, these theories have been combined and applied to various areas including rewrite systems, static analysis of software, program transformation, XML document processing and computational linguistics. This workshop aims to provide an opportunity for researchers from different areas to exchange information and ideas on the theory and practice of tree automata and tree transducers. The topics within the scope of the workshop include, but are not limited to:

• advanced theory of tree automata and tree transducers
• extensions of tree automata and tree transducers (higher-order/weighted/infinite models)
• relations to TRS: regularity preservation
• application to static analysis and model checking
• application to program transformation
• application to XML document processing

Important Dates

Submission

Extended abstracts of at most 5 pages are solicited. We welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks for relevance and may provide additional feedback. Accepted papers will be made available electronically before the workshop. In addition, we plan to distribute a printed version of the proceedings at the workshop. Papers should be formatted according to EasyChair style and submitted electronically via the submission page.

Program Committee

• Kazuhiro Inaba (Google)
• Florent Jacquemard (INRIA Paris)
• Andreas Maletti (Universitat Stuttgart)
• Sebastian Maneth (NICTA and University of New South Wales)
• Keisuke Nakano (The University of Electro-Communications)
• Joachim Niehren (INRIA Lille)
• Helmut Seidl (Technische Uniersitat Munchen)
• Hiroyuki Seki (NAIST)
• Sophie Tison (University of Lille)
• Akihiko Tozawa (IBM)

Organizing Co-Chairs

• Keisuke Nakano
• Hiroyuki Seki

Related Events

• RTA 2012
• FLOPS 2012

Sponsor

• Foundation for Nara Institute of Science and Technology