Contact information
Mgr. Jan Obdržálek, PhD.
Fakulta informatiky MU
Botanická 68a
602 00 Brno
Czech Republic
Fakulta informatiky MU
Botanická 68a
602 00 Brno
Czech Republic
Office: C505
Phone: +420-549 494 225
Fax: +420-549 491 820
E-mail: obdrzalek (at) fi (dot) muni (dot) cz
public GPG/PGP key
Phone: +420-549 494 225
Fax: +420-549 491 820
E-mail: obdrzalek (at) fi (dot) muni (dot) cz
public GPG/PGP key
Academic profile
Research interests
Structural graph theory, infinite games on graphs (esp. parity games), mu-calculus, verification of infinite state systems, software model checking, OpenMP for Java.
Selected Publications
-
On Digraph Width Measures in Parameterized Algorithmics
with R. Ganian, P. Hliněný, J. Kneis, A. Langer and P. Rossmanith
Accepted to IWPEC 2009 -
Qualitative Reachability in Stochastic BPA Games
with T. Brázdil, V. Brožek and A. Kučera
[PDF] [BibTeX] [Slides]
In proceedings of STACS 2009.
Full version with proofs: Technical report FIMU-RS-2009-01 -
Clique-Width and Parity Games
[PDF] [BibTeX] [Slides]
In proceedings of CSL 2007, volume 4646 of LNCS series. © Springer-Verlag. - The DAG-Width of Directed Graphs
with Dietmar Berwanger, Anuj Dawar, Paul Hunter and Stephan Kreutzer
Submitted to the Journal of Combinatorial Theory, Series B. -
DAG-width - Connectivity Measure for Directed Graphs
[PDF] [BibTeX] [Slides]
In Proceedings of SODA 2006. © SIAM -
Fast mu-calculus Model Checking when Tree-width is Bounded
(Corrected version, including detailed algorithms)
[PDF] [BibTeX] [Slides]
In Proceedings of CAV 2003, volume 2725 of LNCS series. © Springer-Verlag
Theses
- Algorithmic Analysis of Parity Games
[PDF] [BibTeX]
PhD thesis, University of Edinburgh. Submitted: January 31, 2006. Examined: May 29, 2006. -
Formal verification of sequential systems with infinitely many states
[PS]
Master thesis, Masaryk University, Brno, 2001.
Projects
-
STANSE
Bug-finding tool for C based on static analysis -
Institute for Theoretical Computer Science
Formal verification, analysis, and testing of software systems [Project Supervisor]
... in the past
CV
Academic CV:[PDF]PhD students
Course information
- Static Analysis and Verification (PhD course)
Courses in the past
- Graph Theory [2006]
- Induction and Recursion [2006]
- Computability & Intractability [2005]
- CS3 Computability & Intractability [2002, 2003]
- CS3 Language Semantics and Implementation [2002, 2003]
- Formal Languages and Automata [1999,2000,2001]
Various resources
Jan Obdržálek
Last modified: Thursday, 02-Jul-2009 14:54:30 CEST
