Young Researchers Forum

YRF@MFCSL 2010
poster: [pdf]

Aim

The aim of the forum is to provide a platform for young researchers (excellent master students, PhD students, PostDocs, etc.) to present and discuss their recently published/submitted results or ongoing work in the field of theoretical computer science in a broad sense. Senior researchers are warmly welcome to auditorium and discussions.

Submissions

The selection of presentations will be based on one-page abstracts submitted via our submission page at EasyChair. There will be no formal reviews. Please note that we impose no restrictions on previous or future publication of the presented results. Authors submitting previously published results are kindly asked to include a full reference to the corresponding publications in their submission.

Proceedings

The abstracts of accepted presentations will be included in informal proceedings available on site.

Important Dates

• Submission deadline: May 17, 2010 May 23, 2010 (extended)
• Notification: June 7, 2010
• Workshop: August 21-22, 2010

Program Committee

• Anuj Dawar, University of Cambridge
• Petr Hliněný, Masaryk University
• Antonín Kučera, Masaryk University
• Johann Makowsky, Technion
• Damian Niwinski, University of Warsaw
• Jan Strejček, Masaryk University (chair)
• Helmut Veith, TU Wien and Carnegie Mellon University

Programme

• Saturday, August 21

09:00 – 09:05	Opening
09:05 – 09:25	Stanislav Böhm: Equivalence checking on counter machines
09:25 – 09:45	Martin Kot: Bisimilarity of BPA and BPP and some related problems
09:45 – 10:05	Clemens Dubslaff: Fault-tolerant Message Sequence Graphs
10:05 – 10:25	Nikola Beneš and Jan Křetínský: On Verification of Disjunctive Modal Transition Systems
10:25 – 10:50	Coffee Break
10:50 – 11:10	Marek Trtík: Counter-based Abstraction for Symbolic Execution
11:10 – 11:30	Javier Esparza and Andreas Gaiser: Frequency Analysis Using Abstract Interpretation
11:30 – 11:50	Petr Krajča: Schemik: Implicitly Parallel Programming Language for Multi-core Computers
11:50 – 12:10	Jan Fousek, Jiří Filipovič and Matúš Madzin: Automated optimization and assembly of medium-grained mapped functions on GPUs
12:10 – 12:30	Thi Mai Thuong Tran: Safe Commits for Transactional Featherweight Java
12:30 – 14:00	Lunch
14:00 – 14:20	Jan Konečný: Fuzzy attribute implications in a generalized framework
14:20 – 14:40	Petr Osička: Triadic concept analysis in fuzzy setting
14:40 – 15:00	Felix Reidl: Parameterized Reoptimization
15:00 – 15:20	Stefan Kugele: From Model-based Design to Model-based Optimization of Embedded Systems
15:20 – 15:40	Tomáš Bílý and Vojtěch Bednář: Digital Biological Cell Approach – A Unified Modeling Platform for Biological Processes
15:40 – 16:10	Coffee Break
16:10 – 16:30	Xiaoxiao Yang: Formal Semantics of Framed Temporal Logic Programming Language MSVL
16:30 – 16:50	Libor Nentvich: Infinitary Lambda-Calculus as a Metric Completion of the Finitary One
16:50 – 17:10	Agnieszka Kozubek: Less Naive Type Theory
17:10 – 17:30	Martin Tancer: Non-representability of finite projective planes by convex sets
17:30 – 17:50	Niko Haubold: Compressed word problems in finitely generated groups

• Sunday, August 22

09:00 – 09:20	Tomáš Dzetkulič: Improvements in Safety Verification of Hybrid Systems
09:20 – 09:40	Jan Krčál and Jan Křetínský: Game extension of Continuous-Time Markov Chains with Time-Bounded Reachability
09:40 – 10:00	Jan Krčál and Jan Křetínský: Timed Automata Objectives in Stochastic Real-Time Games
10:00 – 10:20	Tomáš Babiak: LTL to Büchi Automata: Improved Once Again
10:20 – 10:50	Coffee Break
10:50 – 11:10	Fahad Khan: The Decidability of RPTL
11:10 – 11:30	Cristian Prisacariu: Modal Logic over Higher Dimensional Automata (extended abstract)
11:30 – 11:50	Toby Wilkinson: A Dual Adjunction Approach to Completeness of Coalgebraic Modal Logics
11:50 – 12:10	Marek Czarnecki: Constructive fragment of the modal mu-calculus
12:10 – 12:30	Karel Chvalovský: Provability in Hilbert-style calculi for non-classical logics and ATP
12:30 – 14:00	Lunch
14:00 – 14:20	Jan Hubička: Some examples of universal and generic partial orders
14:20 – 14:40	Jan Bulánek: Prefix vs. unordered bucketing
14:40 – 15:00	Bartłomiej Bosek and Tomasz Krawczyk: Some recent progress in on-line chain partitioning
15:00 – 15:20	Michael D. Coury, Pavol Hell, Jan Kratochvíl and Tomáš Vyskočil: Faithful Representations of Graphs by Islands in the Extended Grid
15:20 – 15:40	Josef Cibulka, Jan Kynčl, Viola Mészáros, Rudolf Stolař and Pavel Valtr: Graph sharing games: complexity and connectivity
15:40 – 16:10	Coffee Break
16:10 – 16:30	Wiktor Żelazny: Additive colourings of graphs
16:30 – 16:50	Robert Ganian: Algorithmic applications of linear rank-width
16:50 – 17:10	Eva Jelínková and Jan Kratochvíl: Switching to H-Free Graphs
17:10 – 17:30	Radek Slíva: Antimagic labelling of graphs with special dominating subgraphs
17:30 – 17:50	Bernard Lidický and Marek Tesař: Complexity of locally injective homomorphism to the Theta graphs