Teaching

Courses

NumberTypeTitleHoursCreditsSemester
184.695 PR Bachelorarbeit für Informatik und Wirtschaftsinformatik 5.0 7.5 2017S
181.145 VU Computer Aided Verification 2.0 3.0 2017S
181.144 UE Computer-Aided Verification 2.0 3.0 2017S
181.224 SE Dissertantenseminar 2.0 3.0 2017S
184.775 VU Einführung in die Computer Algebra 2.0 3.0 2017S
185.291 VU Formale Methoden der Informatik 4.0 6.0 2017S
184.728 PR From Design to Software 1 4.0 6.0 2017S
184.743 PR From Design to Software 2 4.0 6.0 2017S
184.680 VU Information Design 3.0 4.5 2017S
184.766 VO Introduction to Logical Methods in Computer Science 2.0 3.0 2017S
184.741 VU Programm- und Systemverifikation 4.0 6.0 2017S
181.222 PR Project in Computational Logic 8.0 12.0 2017S
184.692 PR Project in Computer Science 1 4.0 6.0 2017S
184.693 PR Project in Computer Science 2 4.0 6.0 2017S
184.697 PR Projekt aus Software Engineering & Internet Computing 6.0 9.0 2017S
184.767 SE Research Seminar LogiCS 2.0 3.0 2017S
181.220 VU Rigorous Systems Engineering 2.0 3.0 2017S
184.749 VU Semantik von Programmiersprachen 3.0 4.5 2017S
181.221 SE Seminar Formale Methoden 2.0 3.0 2017S

Thesis Topics

Bachelor’s Thesis Topics

  • Automatic Bound Computation
    The undecidability of the Halting problem is a famous result that goes back to the beginnings of computer science. The result says that there is no general method for automatically proving the termination of programs. Note, that this statement does not contradict the fact that in practice it is very well possible to prove termination for important program classes automatically. For example, it was a huge success when the first automatic tool chain was able to automatically prove the termination of Windows Device Drivers. Because drivers run in kernel mode, non-terminating drivers could cause the whole system to hang. Despite this success, termination is not a satisfying answer to most programmers who not only want to know that their programs terminate but also when! In ongoing research we are developing tools and algorithms for automatically deriving complexity bounds. See the topics…

Master’s Thesis Topics

  • Model Checking Distributed Algorithms
    Distributed algorithms are designed to be run on several computing nodes, be it on a multiprocessor machine, in a local network, or in a cluster distributed over the globe. Though these algorithms usually have a considerably small description of the code run on an individual node, given the huge number of nodes they can solve complex problems. On the other hand, the distributed nature of the computation poses problems such as different relative processing speeds, delays in message deliveries, faults of nodes and links, etc. To deal with these problems, many sophisticated algorithms have been developed for decades. Each distributed algorithm comes with a mathematical proof of its properties, although the proofs tend to capture the most important behavior, they still could contain non-trivial errors. The formal methods, e.g. theorem proving, model checking, static analysis, are targeted to either find errors or to provide one with a mathematically sound justification that a system under verification behaves with respect to a desired specification. We are developing techniques and tools for checking distributed algorithms in a semi-automatic way, guided by a researcher in that field. See the topics…
  • Automatic Bound Computation
    The undecidability of the Halting problem is a famous result that goes back to the beginnings of computer science. The result says that there is no general method for automatically proving the termination of programs. Note, that this statement does not contradict the fact that in practice it is very well possible to prove termination for important program classes automatically. For example, it was a huge success when the first automatic tool chain was able to automatically prove the termination of Windows Device Drivers. Because drivers run in kernel mode, non-terminating drivers could cause the whole system to hang. Despite this success, termination is not a satisfying answer to most programmers who not only want to know that their programs terminate but also when! In ongoing research we are developing tools and algorithms for automatically deriving complexity bounds. See the topics…

Graduate Studies

FORSYTE is involved in lectures and organization of the following programs:

Master Programs

PhD Programs

LogiCS

Latest News

Winter School on Verification

The Austrian Society for Rigorous Systems Engineering (ARiSE) and the Vienna Center for Logic and Algorithms (VCLA) are organizing a joint winter school on verification at Vienna University of Technology from 6-10 February 2012. Apart from ARiSE/VCLA students, the school will be open to outside students. Details are available from the VCLA website.

Continue reading

CfP: Workshop on Exploiting Concurrency Efficiently and Correctly (EC^2 2010)

The annual Workshop on Exploiting Concurrency Efficiently and Correctly (EC2) is a forum that brings together researchers working on formal methods for concurrency, and those working on advanced parallel applications. Its goal is to stimulate incubation of ideas leading to future concurrent system design an verification tools that are essential in the multi-core era.

Continue reading

Full news archive