Verification and Testing
Table of Content
In this course, we teach various advanced methods to test and verify software and hardware. Instead of classical unit tests, we present techniques for automatic detection of bugs with little user-effort and methods to prove the correctness of a program independent of concrete input values.
The lecture starts with dynamic methods to detect and locate potential bugs related to concurrency or invalid memory accesses. Those bugs are hard to find with unit tests because they seem to show up randomly and are hard to reproduce. In the following lectures, we move on to static methods. Within these chapters, we show you how to prove the correctness of a program formally. Finally, the lecture ends with a session where we present current research topics to you. If you are interested in a master project, thesis, or internship on one of these projects, don’t hesitate to contact us!
The content of this lecture includes:
- Eraser algorithm to detect race conditions
- Locktree algorithms to identify potential deadlocks
- How Valgrind finds invalid memory accesses
- Static Analysis
- Symbolic Encoding, Bounded Model Checking, and Concolic Execution
- Hoare Logic
- Deductive Software Verification with Dafny
- Boolean Model Checking with the SLAM algorithm
|08.10.2020||Eraser & Locktree||link|| ||vt02-concurrency, vt02-concurrency_notes||vt-concurrency|
|15.10.2020||Memory Debuggers||link|| ||vt03-valgrind|
|22.10.2020||Symbolic Methods||link||vt04-SymbolicVerification, vt04-SymbolicVerification_notes|
|29.10.2020||Hoare Logic||link|| |
|05.11.2020||Hoare Logic||link|| |
|19.11.2020||Deductive Program Verification||link|
|26.11.2020||Java Path Finder|||
|14.01.2021||Current Research Topics|
 Eraser: S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, T. Anderson,
Eraser:A Dynamic Race Detector for Multithreaded Programs, ACM Transactions on Computer Systems Volume 15 Issue 4, November 1997.
 Lock Tree & Java Path Finder: W. Visser, K. Havelund, G. Brat, S. Park and F. Lerda, Model Checking Programs, International Journal on Automated Software Engineering 10(2), April 2003. Extended journal version of paper presented at the ASE’00 conference.
 Memory Debuggers: Valgrind memcheck-manual (sec4.5).
 Memory Debuggers: Valgrind memcheck2005.pdf.
 Memory Debuggers: Valgrind shadow-memory2007.pdf.
 Hoare Logic: Hoare-Logic course .
 Hoare Logic: Hoare-Logic Uni Trier (German) .
 Hoare Logic: F. Wotawa,Einführung in die InformatikSkriptum,pp. 157-171,(German), Oktober 2002.
 SLAM: T. Ball, S. K. Rajamani, Bebop:A Symbolic Model Checker for Boolean Programs, SPIN 2000 Workshop on Model Checking of Software, LNCS 1885, pp. 113-130, August/September 2000.
 SLAM: T. Ball, S. K. Rajamani, Automatically Validating Temporal Safety Properties of Interfaces, SPIN 2001, Workshop on Model Checking of Software, LNCS 2057, pp. 103-122, May 2001.
 SLAM: T. Thomas Ball, Rupak Majumdar, Todd Millstein, and Sriram K. Rajamani. Automatic Predicate Abstraction of C Programs, In Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation (PLDI ’01). ACM, New York, NY, USA, 203-213, 2001.
The exercise descriptions will be handed out via git and submitting your work is also done there.
You should receive your repository soon.
If you have problems with adding the git remote, try to use https instead of ssh.
Use the following code to do so:
git remote add -f upstream https://extgit.iaik.tugraz.at/scos/scos.teaching/scos.teaching.vt/vt2020/vt-sources.git
The lectures will be held via Microsoft Teams.
You can join using the Chrome web browser to join anonymous, or register an account and use the desktop client.
Exercise Question Hours: Friday at 11am on Discord. You can join the server using https://discord.gg/aeMjStg.