3-year postdoc position

The Computational Logic research group at the University of Innsbruck has one open position funded by the FWF (Austrian science fund) via the START project Certifying Termination and Complexity Proofs of Programs.

The project aims at increasing the reliability in current complexity and termination provers by independently checking the generated proofs. To this end, several analysis techniques will be formalized in the theorem prover Isabelle/HOL, with a focus on LLVM and integer transition systems.

For this project, we are looking for one enthusiastic researcher with a background in computational logic. Knowledge of automated termination analysis, complexity analysis, or theorem proving would be an asset. Candidates with a strong theoretical background in related areas are also encouraged to apply. Knowledge of German is not essential.

The salary is determined by the FWF-funding scheme (3,627 EUR monthly gross salary)

Applications (including a CV, a publication list, and a letter of recommendation) may be emailed to the project leader René Thiemann (rene.thiemann at no later than December 18, 2017.

We plan to make decisions on these position in December.

The preferred starting date is within the first three months of 2018.

Informal inquiries are also welcome via email.

Application deadline: 18 December 2017