[isabelle] Job offer on formalizing complexity and termination techniques
[Apologies for cross-posting]
2-year postdoc or 3-year PhD-student position at the University of Innsbruck
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, in combination with executable functions which check for the
correct application of these techniques.
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 Master's or equivalent degree. Knowledge
of German is an advantage but not essential.
The preferred starting date is within the first quarter of 2015.
The salary is determined by the FWF-funding scheme (3.483,40 EUR monthly
gross salary for postdocs, and 1.996,90 EUR for PhD-students, cf.
Applications (including a CV, a publication list (only for postdocs), and a
letter of recommendation) may be emailed to the project leader René Thiemann
(rene.thiemann at uibk.ac.at) no later than December 14, 2014.
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.
Further information is available from the following links:
Institute of Computer Science:
University of Innsbruck:
City of Innsbruck:
This archive was generated by a fusion of
Pipermail (Mailman edition) and