|
|
Research Group Computer Science 2 | Dept. of Computer Science |
|
Seminar: Verification Techniques(S2, WS 2016/17) |
|
Prof. Dr. Jürgen Giesl, Florian Frohn, Jera Hensel, David Korzeniewski
Several techniques and methods for program verification will be presented in this seminar.
The seminar takes place on the 14th (E2, room 4201b) of February 2017, starting at 9:00. See below for the schedule. We have a series of strict deadlines before that.
Your seminar paper should have 10 pages and be written in either English or German. Do not provide an index or table of contents, but attach a list of references. More than 5 spelling or grammar mistakes on a single page will lead to an immediate rejection of your paper, so please use an automated spell checker!
The seminar talks should not take more than 25 minutes and can be held in English or German.
Participants should have knowledge in program verification or related areas (for example "functional programming", "logic programming", "term rewriting", etc.).
| Topic | Literature | Supervisor | Student | Time |
|---|---|---|---|---|
| Geometric Nontermination Arguments | Link | Jera Hensel | Lars Scheel | 9:00 |
| Lower Runtime Bounds for Integer Programs | Link | Florian Frohn | Qingyi Liu | 9:45 |
| Monotonic Abstraction for Programs with Multiply-Linked Structures | Link | David Korzeniewski | Timotheus Jochum | 10:30 |
You can find templates for your seminar paper here. Using them is optional.
Theoretical Computer Science
For further details please contact David Korzeniewski.
| Disclaimer | Research Group Computer Science 2 | Dept. of Computer Science |
 |