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

WWTF ICT project awarded to Igor Konnov

Igor Konnov (PI), together with Josef Widder (co-PI) and Helmut Veith (core team), are awarded an ICT research project APALACHE “Abstraction-based Parameterized TLA Checker” by the Vienna Science and Technology Fund WWTF.

Continue reading

Austrian Computer Science Day 2015

The Austrian Computer Science Day 2015, which takes place on October 15, features a range of talks by leading Austrian computer scientists, including topics such as computer games, augmented reality, aware systems, semantic web, business processes, and reliable systems. Register for free by October 7, 2015! This year’s speakers are: Alois Ferscha (JKU Linz) Tom […]

Continue reading

Helmut Veith receives CAV Award

The 2015 CAV Award is given to Edmund Clarke, Orna Grumberg, Ron Hardin, Zvi Harel, Somesh Jha, Robert Kurshan, Yuan Lu, and Helmut Veith for the development and implementation of the localization-reduction technique and the formulation of counterexample-guided abstraction refinement (CEGAR).

Continue reading

FRIDA’15

We had great talks at FRIDA’15 workshop in Grenoble. The slides of some of the talks are available online.

Continue reading

FRIDA’15 Program

Check the program of the 2nd workshop on Formal Reasoning in Distributed Algorithms at FORTE. We have a nice program this year.

Continue reading

Full news archive