PhD Research in Trustworthy Systems
Trustworthy Systems is always looking for new PhD students. We do not provide a topic list, as PhD topics require more planning and discussion, in order to match the student's interest and background to the supervisor's interests and our strategic directions. However, the Trustworthy Systems Research Pages hould give you a good idea where our interests lie.
In contrast to many other contries, PhD students in Australia are generally not funded by their supervisors (local term for what the US calls advisors) but by government or university scholarships. Data61 provides top-ups on such scholarships, living stipends to complement university fee-waiver scholarships, and a (occasional) full scholarships. Application is through the relevant partner universities (for the base scholarships) and Data61 (for Data61 scholarships).
If you are interested in a research thesis with us, and think you have the right prerequisites, you should contact the TS group leader and other TS academics by sending your undergraduate details and CV.
Operating Systems and/or Formal Methods
We expect you to come with a very strong OS or formal methods background, depending on the area in which you wish to work. For UNSW graduates this means do not bother asking if you haven't impressed us already. Non-UNSW applicants are expected to otherwise demonstrate strong insights into operating systems or formal methods issues. Having done well in an operating systems or formal methods course is not sufficient. PhD students need to enrol at the University of New South Wales, see there for the admission requirements. The list of current activities under the Trustworthy Systems heading should give you a good idea where our OS and FM interests lie.
Verification Tools and Automation
At the Canberra Research Lab we are developing and applying inference methods for automated and interactive reasoning for verifying software systems. See here for a general overview.
Topics will have a strong focus around formal methods, such as mathematical logic, model checking, automated theorem proving, SMT-solving, modelling languages, automata theory, runtime verification, etc. We solicit enquiries from students with a background in one or more of these areas.