Teaching

Courses

NumberTypeTitleHoursCreditsSemester
184.695PRBachelorarbeit für Informatik und Wirtschaftsinformatik5.010.02017S
181.145VUComputer Aided Verification2.03.02017S
181.144UEComputer-Aided Verification2.03.02017S
181.224SEDissertantenseminar2.02.02017S
184.775VUEinführung in die Computer Algebra2.03.02017S
185.291VUFormale Methoden der Informatik4.06.02017S
184.728PRFrom Design to Software 14.06.02017S
184.743PRFrom Design to Software 24.06.02017S
184.680VUInformation Design3.04.52017S
184.766VOIntroduction to Logical Methods in Computer Science2.03.02017S
184.741VUProgramm- und Systemverifikation4.56.02017S
181.222PRProject in Computational Logic8.016.02017S
184.692PRProject in Computer Science 14.06.02017S
184.693PRProject in Computer Science 24.06.02017S
184.697PRProjekt aus Software Engineering & Internet Computing6.012.02017S
184.767SEResearch Seminar LogiCS2.03.02017S
181.220VURigorous Systems Engineering2.03.02017S
184.749VUSemantik von Programmiersprachen3.04.52017S
181.221SESeminar Formale Methoden2.03.02017S

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

Helmut Veith Stipend

The first recipient of the Helmut Veith Stipend for excellent female master’s students in computer science will be presented on March 14 at the following event: "More female students in computer science. Who cares?" Panel discussion with renowned scientists about diversity in STEM Studies March 14, 5:30pm, TU Wien The Helmut Veith Stipend is dedicated […]

Continue reading

WAIT 2016 in Vienna

The third WAIT workshop on induction is held between 17-18 November at the TU Wien. Details are available on the workshop page.

Continue reading

Two papers at POPL’17

Two papers co-authored by researchers from our group have been accepted for POPL’17: “Coming to Terms with Quantified Reasoning” by Simon Robillard, Andrei Voronkov, and Laura Kovacs; and “A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms” by Igor Konnov, Marijana Lazic, Helmut Veith, and Josef Widder

Continue reading

Helmut Veith Stipend

Outstanding female students in the field of computer science who pursue (or plan to pursue) one of the master‘s programs in Computer Science at TU Wien taught in English are invited to apply for the Helmut Veith Stipend

Continue reading

LogicLounge in memoriam Helmut Veith

Will robots take away your job? In memory of Helmut Veith, this year’s Conference on Computer Aided Verification (CAV), which takes place in Toronto, will feature a LogicLounge on the effect of automation and artificial intelligence on our jobs.

Continue reading

Full news archive