Lab Course “Modeling and Automated Verification” (SS2025): Unterschied zwischen den Versionen
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Lab Course “Modeling and Automated Verification” |Research group=Verifikation und formale quantitative Analyse |Lecturers=Christel Baier |Term=SS |Year=2025 |Lecture series=Lab Course “Modeling and Automated Verification” |Module=CMS-LM-ADV, CMS-LM-MOC, MCL-PS |SWSLecture=0 |SWSExercise=2 |SWSPractical=0 |Exam type=Hausarbeit, Referat |Description=This lab course is intended for students in the Master's programs “Computational…“) |
Johannes Lehmann (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 34: | Zeile 34: | ||
=== Registration === | === Registration === | ||
Registration via Opal is required until 14 April. | Registration [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48422027273/ via Opal] is required until 14 April. | ||
=== Prerequisites === | === Prerequisites === | ||
Version vom 28. Februar 2025, 16:01 Uhr
„Verifikation und formale quantitative Analyse“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.
Lab Course “Modeling and Automated Verification”
Lehrveranstaltung mit SWS 0/2/0 (Vorlesung/Übung/Praktikum) in SS 2025
Dozent
Umfang (SWS)
- 0/2/0
Module
Leistungskontrolle
- Hausarbeit
- Referat
Vorlesungsreihe
This lab course is intended for students in the Master's programs “Computational Logic” and “Computational Modeling and Simulation”. It offers the opportunity to participate in theoretical as well as applied state-of-the-art research projects. Most problems addressed in this course are closely related to or are part of current research projects of our workgroup. See for example:
Potential topics include:
- Symbolic methods in model checking
- Explicit model checking
- Reduction techniques
- Automata over finite and infinite words
- Numerical methods for quantitative analysis
- Logics
- Specification formalisms
- Abstraction techniques
- Case studies
This course is held in English.
Registration
Registration via Opal is required until 14 April.
Prerequisites
- Solid foundations in algorithms and data structures, complexity theory, automata theory and formal languages
- Solid programming skills
- Basic mathematical foundations
Exam and Creditability
For all modules (see sidebar), the exam consists of a research project with 10 pages of documentation including a 30 minute presentation.
Contact
Please contact Sascha Klüppelholz for organisational questions.
