LANGUAGE THEORY with APPLICATIONS 2012 (LTA 2012)

LTA 2012 is a student conference at the Faculty of Information Technology, Brno University of Technology.

• Subject: Formal language theory and its applications in computer science
• Place: FIT BUT, Brno, Czech Republic
• Date: December 10 - 13, 2012

• Organizers:
  1. the TID, VYPe, and GAL teaching teams;
  2. Formal Model Research Group, FIT BUT;
  3. Department of Information Systems, FIT BUT.

• Committee:
  • Alexander Meduna (chair)
  • Zbyněk Křivka
  • Petr Zemek
  • Lukáš Vrábel
  • Petr Horáček

• Conference language: English

• Coverage:
  • LTA 2012 offers a variety of scientific talks on formal language theory and its computer-related applications at MSc and PhD levels. A special attention is paid to modern applications related to the language translation. Most of the talks results from the students' work in the TID, VYPe and GAL classes taught at FIT BUT.

• Style:
  • Talks are presented so they clearly and quickly explain their significance to today's computer science. As a result, in some instances, results and their proofs may be merely outlined in an informal way. LTA 2012 does not tolerate presentations that hide their shallow contents behind exotic pictures.

• Purpose: The purpose of this event is three-fold:
  1. demonstrating the TID, VYPe, and GAL student work in public;
  2. giving students the opportunity of giving scientific talks in English;
  3. improving a communication between students and teachers interested in the subject of the conference.

• Audience: Everybody is welcome to attend this event without any prior notice. There is no payment.

• Questions: Contact Zbyněk Křivka

• Audio-video recordings of sessions
  • Big thanks to Jana Skokanová, Miroslav Paulík, and Marek Surovič with postprocessing of video recordings.

• PDF Program Summarization (print version)

• Classroom: G202
• Chair: Alexander Meduna
• Opening Talk:
  • Meduna Alexander, Zemek Petr: Jumping Finite Automata
    • Abstract
    • Talk duration: 60 minutes (including discussion)

• Classroom: G202
• Chair: Petr Zemek
• Talk duration: 40 minutes (including discussion)
• Level: PhD

• Talks:
  • 09:00-09:40 Klubal Ondřej: Smart cards protocols (Abstract, Slides)
  • 09:40-10:20 Dvořák Milan: Suitable abstract model for representing the market data feed format of different exchanges (Abstract, Slides)
  • 10:20-11:00 Maliulin Valerii: Lexicalized Tree Adjoining Grammar (Abstract, Slides)
  • 11:00-11:40 Ondel Lucas: Indexing WFST for Spoken Term Detection (Abstract, Slides)

• Classroom: E104
• Chair: Lukáš Vrábel
• Talk duration: 40 minutes (including discussion)
• Level: PhD, Bc

• Talks:
  • 10:20-11:00 Kollár Matej: Firewall Rules Discovery and Generation (Abstract, Slides)
  • 11:00-11:15 Surovič Marek (BP): Non-returning Turing machines (Abstract, Slides)

• Classroom: A112
• Chair: Zbyněk Křivka
• Talk duration: 15 minutes (including discussion)
• Level: Masters

• Talks:
  • 11:20-11:35 Toth Róbert: Dantzig's Shortest Path Algorithm (Abstract, Slides)
  • 11:35-11:50 Sák Vladimír: Goldberg-Radzik Algorithm (Abstract)
  • 11:50-12:05 Horníček Ondřej: Max-Flow Min-Cut theorem (Use in multicast networks) (Abstract)
  • 12:05-12:20 Chaloupka Jan: Ramsey theory - Ramsey theorem (Abstract, Slides)
  • 12:20-12:35 Kuklínek Lukáš: Register Allocation via Graph Colouring (Abstract, Slides)

• Classroom: E104
• Chair: Zbyněk Křivka
• Talk duration: 10 minutes (including discussion)
• Level: MSc

• Talks:
  • 10:00-10:10 Fibich Ondřej, Olejník Marek: Lexical/syntactical structures in Fortran and its history (Abstract, Slides)
  • 10:10-10:20 Navrátil Ondřej, Novotný Pavel: Parsing Techniques (Abstract, Slides)
  • 10:20-10:30 Moreno Serrano María José: Symbol Tables and Run-Time Storage Organization (Abstract)
  • 10:30-10:40 Pála Milan, Sochor Jakub: Code Generation: Intermediate Languages (Abstract, Slides)
  • 10:40-10:50 Kotásek Marek, Kozák Filip: Code Generation: Symbol Table (Abstract, Slides)
  • 10:50-11:00 Novosád Adrián, Rohovský Tomáš: Declarations (Abstract, Slides)
  • 11:00-11:10 Hudec Lukáš, Korgo Tomáš: Expressions (Abstract, Slides)
  • 11:10-11:20 Mrázek Petr, Šálek Jiří: Statements and Control Flow (Abstract, Slides)
  • 11:20-11:30 Odaloš Matej, Polesný Ondřej: Optimization Strategies (Abstract, Slides)
• • 11:40-11:50 Klapuchová Mirka, Woś Radek: lex & yacc: Advanced Features (Abstract)
  • 11:50-12:00 Dvořák Petr, Pačes Jan: Yacc Ambiguities and Conflicts (Abstract, Slides)
  • 12:00-12:10 Janečka Pavel, Kuklínek Lukáš: Xtext of Eclipse Text Modeling Framework (Abstract)
  • 12:10-12:20 Kopecký Jiří, Kučera Martin: Introduction to Small Device C Compiler (Abstract)
  • 12:20-12:30 Baručák Robert, Šulek Jakub: Introduction to LLVM Compiler Infrastructure (Abstract, Slides)
  • 12:30-12:40 Matula Peter: Reconstruction of Data Types for Decompilation (Abstract, Slides)

• Classroom: A112
• Chair: Petr Horáček
• Talk duration: 10 minutes (including discussion)
• Level: MSc

• Talks:
  • 13:00-13:10 Chaloupka David, Chaloupka Jan: Foundations of Data-Flow Analysis & Constant Propagation (Abstract, Slides)
  • 13:10-13:20 Barteček Jakub, Kanich Ondřej: Loops in Flow Graphs (Abstract, Slides)
  • 13:20-13:30 Fešar Marek, Fiedor Tomáš: Interprocedural Analysis: Basic Concepts & Why? (Abstract, Slides)
  • 13:30-13:40 Horníček Ondřej: Context-Insensitive Interprocedural Analysis & Context-Sensitive Pointer Analysis (Abstract, Slides)

• LTA 2011