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 term rewriting and Haskell.
For this project, we are looking for an enthusiastic young 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. The PhD-student candidate must have a Masters or equivalent degree. Knowledge of German is not essential.
The salary is determined by the FWF-funding scheme. (3.546,00 EUR monthly gross salary for postdocs, and 2.024,90 EUR for PhD-students)
Applications (including a CV, a publication list (only for postdocs), and a letter of recommendation) may be emailed to the project leader Rene Thiemann (rene.thiemann at uibk.ac.at) no later than July 6, 2015.
We plan to make decisions on these position until July 10. The preferred starting date is summer or autumn 2015.
Informal inquiries are also welcome via email.
The city of Innsbruck is superbly located in the beautiful surroundings of the Tyrolean Alps. The combination of the Alpine environment and urban life in this historic town provides a high quality of living.
Apply Now
Scholarships are not only for the smart students. Anyone can get scholarships
Have a Question about this Scholarship?