Research Group Computer Science 2 | Dept. of Computer Science |
Seminar: Verification Techniques(S2, WS 2019) |
Prof. Dr. Jürgen Giesl, Stefan Dollase, Marcel Hark, Jera Hensel, David Korzeniewski
Several techniques and methods for program verification will be presented in this seminar.
Participants should have knowledge in program verification or related areas (for example "functional programming", "logic programming", "term rewriting", "satisfiability checking", "model checking", "static program analysis", "semantics and verification of software", etc.).
Title | Literature | Supervisor | Student | Time |
---|---|---|---|---|
Polynomial Orderings for Rewriting Systems | Link | Marcel Hark | Nils Freyer | 08:30-09:15 |
Proving Termination of Term Rewriting Using Dependency Pairs | Link | Prof. Dr. Jürgen Giesl | Olav Lamberts | 09:15-10:00 |
Termination of Integer Loops | Link | Marcel Hark | Paul Sonnenschein | 10:00-10:45 |
Better Termination Proving Through Cooperation | Link | Stefan Dollase | Hossameldin Khalifa | 10:45-11:30 |
Proving Termination Through Conditional Termination | Link | Marcel Hark | Yuyuan Liu | 11:30-12:15 |
Break | 12:15-13:45 | |||
Inferring Upper Runtime Bounds for Integer Programs | Link | Prof. Dr. Jürgen Giesl | Joel Beckmann | 13:45-14:30 |
Inferring Lower Runtime Bounds for Integer Programs | Link | Prof. Dr. Jürgen Giesl | Linus Mainka | 14:30-15:15 |
Proving Positive Almost-Sure Termination | Link | Jera Hensel | Johannes Engelhardt | 15:15-16:00 |
AProVE Demo | Link | Prof. Dr. Jürgen Giesl | 16:00-16:15 | |
The Symbolic Execution Debugger KeY | Link | David Korzeniewski | Thanh Nguyen | 16:15-17:00 |
Theoretical Computer Science
For further details please contact Stefan Dollase.
Disclaimer | Research Group Computer Science 2 | Dept. of Computer Science |