Prof. Ing. Tomáš Vojnar, Ph.D.

Lecture courses:

• FAV-2012/W, Formal Analysis and Verification, IT-MSC-2, IT-MSC-2E
• FAD-2012/W, Formal Program Analysis, CSE-PHD-4
• IOS-2012/S, Operating Systems, IT-BC-3
• STI-2012/W, Theoretical Computer Science Seminar, IT-MSC-2

Consulting hours:

To be fixed individually via email.

Graduated Ph.D. Students:

• Erlebach Pavel, Ing., dissertation in 2009:
  
  Automatic Verification of Programs Working with Dynamic Data Structures
• Holík Lukáš, Mgr., dissertation in 2011:
  
  Simulace a protiřetězce pro efektivní práci s konečnými automaty
• Konečný Filip, Ing., dissertation in 2012:
  
  Relational Verification of Programs with Integer Data
• Letko Zdeněk, Ing., dissertation in 2012:
  
  Analysis and Testing of Concurrent Programs
• Rogalewicz Adam, Mgr., dissertation in 2007:
  
  Verification of programs with complex data structures
• Smrčka Aleš, Ing., dissertation in 2010:
  
  Verification of Asynchronous and Parametrized Hardware Designs
• Šimáček Jiří, Ing., dissertation in 2012:
  
  Harnessing Forest Automata for Verification of Heap Manipulating Programs

Current Ph.D. Students:

• Dudka Kamil, Ing., research theme:
  
  Automated Formal Verification in the Area of Operating Systems
• Fiedor Jan, Ing., research theme:
  
  Practical Methods of Automated Verification of Concurrent Programs
• Hrubá Vendula, Ing., research theme:
  
  Self-healing of Programs and Problems of Software Model Checking Associated with It -- co-supervised by dr. B. Krena
• Charvát Lukáš, Ing., research theme:
  
  Automated Verification in Hardware Design and Hardware/Software Codesign
• Lengál Ondřej, Ing., research theme:
  
  Efficient Algorithms for Using Automata in Infinite-State Verification -- co-supervised by dr. L. Holik
• Müller Petr, Ing., research theme:
  
  Practical Algorithms Using Suitable Logics in Program Verification