This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
lectures:lta:lta13 [2013/12/05 13:45] – [SESSION 2 - FORMAL LANGUAGES: THEORY AND APPLICATIONS: Thursday, December 12, 2013, 09:00 - 13:00] krivka | lectures:lta:lta13 [2013/12/16 17:16] (current) – [SESSION 3 - ADVANCED COMPILER WRITING: Wednesday, December 18, 2013, 10:00 - 13:00] krivka | ||
---|---|---|---|
Line 61: | Line 61: | ||
* [[xkrcma04@stud.fit.vutbr.cz|Krčmář Radim]]: Lexical/ | * [[xkrcma04@stud.fit.vutbr.cz|Krčmář Radim]]: Lexical/ | ||
* [[xbamba01@stud.fit.vutbr.cz|Bambas Tomáš]], [[xmasek11@stud.fit.vutbr.cz|Mašek Jiří]]: Vala programming language and its compiler ({{: | * [[xbamba01@stud.fit.vutbr.cz|Bambas Tomáš]], [[xmasek11@stud.fit.vutbr.cz|Mašek Jiří]]: Vala programming language and its compiler ({{: | ||
- | * 11:55 - 12:35 | + | * 11:55 - 12:25 |
* [[xkopec36@stud.fit.vutbr.cz|Kopecký Marek]], [[xkubik22@stud.fit.vutbr.cz|Kubík Lukáš]]: Region-Based Analysis ({{: | * [[xkopec36@stud.fit.vutbr.cz|Kopecký Marek]], [[xkubik22@stud.fit.vutbr.cz|Kubík Lukáš]]: Region-Based Analysis ({{: | ||
* [[xplach02@stud.fit.vutbr.cz|Plachý Tomáš]], [[xpramu00@stud.fit.vutbr.cz|Pramuka Tomáš]]: Logical Representation of Data Flow & Simple Pointer-Analysis Algorithm ({{: | * [[xplach02@stud.fit.vutbr.cz|Plachý Tomáš]], [[xpramu00@stud.fit.vutbr.cz|Pramuka Tomáš]]: Logical Representation of Data Flow & Simple Pointer-Analysis Algorithm ({{: | ||
- | * [[xkaspa34@stud.fit.vutbr.cz|Kašpar David]]: Predator - A Formal Verification Tool ({{: | + | |
- | | + | |
* [[xskvar06@stud.fit.vutbr.cz|Škvařilová Radka]]: Modified Deep Pushdown Automata ({{: | * [[xskvar06@stud.fit.vutbr.cz|Škvařilová Radka]]: Modified Deep Pushdown Automata ({{: | ||
* [[xkajan05@stud.fit.vutbr.cz|Kajan Dušan]]: Scattered Context Grammars and Their Applications in Natural Language Analysis ({{: | * [[xkajan05@stud.fit.vutbr.cz|Kajan Dušan]]: Scattered Context Grammars and Their Applications in Natural Language Analysis ({{: | ||
Line 76: | Line 75: | ||
* Talks: | * Talks: | ||
- | * 09:00 - 10:20 Opening Talk | + | * 09:00 - 10:20 Main talk |
* **Meduna Alexander, Zemek Petr: Regulated Grammars and Automata** ({{: | * **Meduna Alexander, Zemek Petr: Regulated Grammars and Automata** ({{: | ||
* Talks (// | * Talks (// | ||
Line 102: | Line 101: | ||
* [[xniklv00@stud.fit.vutbr.cz|Nikl Vojtěch]]: Optimizing Compilers - Enhancing Fine-Grained Parallelism | * [[xniklv00@stud.fit.vutbr.cz|Nikl Vojtěch]]: Optimizing Compilers - Enhancing Fine-Grained Parallelism | ||
* [[xrysav17@stud.fit.vutbr.cz|Ryšavý Michal]], [[xsenko01@stud.fit.vutbr.cz|Senko Jozef]]: Optimiziing Compiler - Creating Coarse-Grained Parallelism ({{: | * [[xrysav17@stud.fit.vutbr.cz|Ryšavý Michal]], [[xsenko01@stud.fit.vutbr.cz|Senko Jozef]]: Optimiziing Compiler - Creating Coarse-Grained Parallelism ({{: | ||
- | * [[xfouka00@stud.fit.vutbr.cz|Foukal Martin]], [[xsamek01@stud.fit.vutbr.cz|Samek Michal]]: Optimizing Compilers | + | * [[xkaspa34@stud.fit.vutbr.cz|Kašpar David]]: Predator |
* 11:30 - 11:40 | * 11:30 - 11:40 | ||
* Coffee break | * Coffee break |