Friday, November 14, 2008
9:00-10:45Registration
Green LoungeAttic Classroom
10:45-11:00Opening Ceremony
11:00-12:00Mogens Nielsen (Invited Talk)
Computational Trust
12:00-13:30Lunch
13:30-14:30Jiří Matoušek (Invited Talk)
Metric Embeddings and Algorithms
14:40-15:05Javier Esparza,Thomas Gawlitza, Stefan Kiefer and Helmut Seidl
Approximative Methods for Monotone Systems of min-max-Polynomial Equations
Zbyšek Gajda
Polymorphic Circuit Design
15:05-15:30Robert Ganian, Petr Hliněný
Automata Approach to Graphs of Bounded Rank-width
Jaroslav Škarvada, Zdeněk Kotásek, Tomáš Herrman
Power Conscious RTL Test Scheduling
15:30-16:00Coffee Break
16:00-16:25Ivan Szabolcs
Characterizations of Branching-time Future Temporal Logics on Finite Trees
Petr Mikušek, Václav Dvořák
On Lookup Table Cascade-Based Realizations of Arbiters
16:25-16:50Joachim Kneis, Alexander Langer
A Practical Approach to Courcelle's Theorem
Václav Šimek, Karel Slaný, Zdeněk Vašíček
Can the Performance of GPGPU Really Beat CPU in Evolutionary Design Task?
16:50-17:10Hermann Gruber
Digraph Complexity Measures and Applications in Formal Language Theory
Martin Straka
Design of FPGA-Based Dependable Systems
17:10-17:30Ales Kozumplik, Martin Krivanek, and Antoine Madet
TRIPS To the Semantic EDGE
Jakub Jaroš, Petr Procházka, Jan Holub
On Implementation of Word-Based Compression Methods
17:40-18:05Parosh A. Abdulla, Lukáš Holík, Lisa Kaati, Tomáš Vojnar
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
Kathrin Peter
Data Distribution Algorithms for Reliable Parallel Storage on Flash Memories
18:05-18:30Florian Lonsing and Armin Biere
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
Jiří Kvasnička, Hana Kubátová
Emulation of SEU Effect In Bitstream of FPGA
18:35-19:00Marián Novotný
A tool for an Automatic Analysis of Security Protocols by Logics of Belief
Peter Pecho, František Zbořil
Wireless Sensor Network Agent Platform with Support for Cryptographic Protocols
19:30Dinner, Wine Bar