Two Postdoctoral Researchers
The Systems Verification Group is offering a post for a Grade 8 Research Assistant to work on the automated verification of programs with the goal of supporting incremental development under the direction of Daniel Kroening in the Oxford University Computer Science Department. Applicants should have (or shortly expect to receive) a PhD in Computer Science or a closely related field. The primary selection criteria are strong programming and systems skills, some experience of tool construction, and basic knowledge of program analysis. A background in theoretical computer science or mathematics is desirable. Candidates with prior experience with multi-version program analysis are especially encouraged to contact us, although this is by no means a necessary requirement.
The work will take place within the Verification group in the Computer Science Department a the University of Oxford, which comprises, in addition to the investigator, world-leading experts in software verification and model checking such as Marta Kwiatkowska, Tom Melham, Luke Ong, and Bill Roscoe. The post has a salary on the University grade 8 scale (currently £36,715 to £43,840 pa). The ad for the post and instructions for applying can be found here.
We are also looking to hire two Grade 7 Research Assistants. These posts have similar selection criteria in terms of subject area, but are suitable for a junior Postdoc immediately after graduation. The official ad for the post and instructions for applying can be found here (grade 7).
We welcome any inquiries via e-mail to Daniel Kroening.
The Systems Verification Group is furthermore offering three fully funded DPhil (Oxford's "PhD") positions at Oxford University's Computer Science Department:
- Studentship on Verification – this studentship includes full funding, even in the case of overseas students, and is thus suitable for students of any nationality.
- Studentship on Autonomous Intelligent Machines and Systems (AIMS) – this studentship is suitable for EU residents only.