News and Events: Open Positions
These pages provide information about recent developments at or relevant to the ILLC. Please let us know if you have material that you would like to be added to the news pages, by using the online submission form. For minor updates to existing entries you can also email the news administrators directly. English submissions strongly preferred.
Headlines Open positions at ILLC
Headlines Open positions, general
Open positions at ILLC
PhD Position in Computational Social ChoiceDeadline: Friday 15 February 2019
This position is part of the Collective Information Project, which will eventually employ a total of five junior researchers. It is funded by the Netherlands Organisation for Scientific Research (NWO) under the VICI scheme.
The aim of the Collective Information Project is to improve our understanding of how best to aggregate information supplied by several independent agents and how the structural properties of the kind of information we wish to aggregate influences the performance of different aggregation mechanisms. Potential applications range from political elections and recommender systems (aggregation of preferences), to crowdsourcing campaigns (aggregation of expert judgments), to knowledge engineering (aggregation of ontologies).For more information, see here or at http://www.uva.nl/shared-content/uva/en/vacancies/2018/12/18-755-phd-position-in-computational-social-choice.html or contact Ulle Endriss at u.endriss at uva.nl.
Open positions, general
(New) Postdoctoral position on a coalgebraic framework for reductive logic, London (UK)Deadline: Thursday 7 February 2019
We currently have a vacancy for a 1 year (with the possibility of extension to 3 years) postdoctoral position in UCL's Programming Principles, Logic and Verification research group. It is attached to the EPSRC-funded project ReLiC: A Coalgebraic Framework for Reductive Logic and Proof Search.
The successful candidate will be working with PI Prof. David Pym and co-investigators Prof. Alexandra Silva and Dr. Simon Docherty on coalgebraic and category theoretic approaches to the theory of proof search, focusing on the representation of both search spaces and the algorithmic control processes used to navigate them. The ideal candidate will additionally have automated reasoning and implementation expertise, with a view to implement prototype theorem provers based on the generic theory of reductive logic.For more information, see https://gow.epsrc.ukri.org/NGBOViewGrant.aspx?GrantRef=EP/S013008/1.
(New) Postdoctoral position in Language in Interaction, Nijmegen (The Netherlands)Deadline: Sunday 17 February 2019
The Language in Interaction research consortium invites applications for a postdoctoral position in Linguistics. We are looking for a candidate with a background in theoretical and/or computational linguistics.
We are looking for highly motivated candidates to enrich a unique consortium of researchers that aims to unravel the neurocognitive mechanisms of language at multiple levels. The goal is to understand both the universality and the variability of the human language faculty from genes to behaviour. The succesful candidate will be appointed at the Max Planck Institute for Psycholinguistics, Nijmegen, The Netherlands, and will be supervised by Peter Hagoort, programme director of the Language in Interaction consortium. The research is conducted in an international setting at all participating institutions. English is the lingua franca.
(New) Lectureship / Associate Professorship in programming principles, logic, & verification, London (UK)Deadline: Thursday 28 February 2019
The Department of Computer Science at University College London (UCL) invites applications for a faculty position (Lecturer or Associate Professor) in the area of Programming Principles, Logic, and Verification (PPLV). Our interests span theory and practice, including logic, semantics, language design, program analysis, program verification, systems verification, systems modelling, compilation, and theorem proving.
We seek world-class talent; candidates must have an outstanding research track record.
UCL faculty are expected to carry world-class research, publish in top-tier venues, obtain research funding, deliver high-quality undergraduate and post-graduate teaching, supervise doctoral students, engage with the community, and contribute to the management of their department and the College.For more information, see https://atsv7.wcn.co.uk/search_engine/jobs.cgi?amNvZGU9MTc4NDY1MCZ2dF90ZW1wbGF0ZT05NjYmb3duZXI9NTA0MTE3OCZvd25lcnR5cGU9ZmFpciZicmFuZF9pZD0wJnZhY3R5cGU9MTI3MSZwb3N0aW5nX2NvZGU9MjI0&jcode=1784650&vt_template=966&owner=5041178&ownertype=fair&brand_id=0&vactype=1271&posting_code=224 or contact Prof. David Pym at d.pym at ucl.ac.uk, or Prof. John Shawe-Taylor at shawe-taylor at ucl.ac.uk.
(New) PhD student or postdoc position in formal methods, Konstanz (Germany)Deadline: Friday 22 February 2019
The Chair for Software and Systems Engineering of the University of Konstanz has the opening of a full-time Research Assistant / PhD Student (Post-Doc) position available for three years, starting July 1, 2018. We are primarily looking for a PhD Student interested in working on formal methods for the design and analysis of complex systems. In exceptional circumstances applications from post-doctoral candidates with fitting interests will also be considered.
We like to use logic-based methods in modeling, specification and analysis of these systems. The position may therefore be interesting of a logician with strong interests in logic-based methods in computer science. Affinity towards software and some programming experience, however, is a prerequisite.For more information, see https://www.uni-konstanz.de/stellenangebote/stellenauswahl.php/stellenauswahl.php?seite=2019/008&id=1 or contact Prof. Dr. Stefan Leue at Stefan.Leue at uni-konstanz.de.
(New) W3 Professorship in Theoretical Computer Science, Munich (Germany)Deadline: Friday 1 February 2019
This professorship is dedicated, in research and teaching, towards Theoretical Computer Science, in particular applications of logic and/or type theory to programming and programming languages.
Relevant areas of research are e.g.:
- Type Theory and Functional Programming
- Logic and Computer-Aided Reasoning
- Automatic Theorem Proving, esp. SAT- and related Solvers
- Foundations and Semantics of Programming Languages, esp. declarative languages
- Logical and Programming Language Aspects of resources, security, privacy, side effects and concurrencyFor more information, see https://www.tcs.ifi.lmu.de/news/professorship.
Lecturer/Senior Lecturer/Associate Professor in Computer Science, Canberra (Australia)Deadline: Sunday 10 February 2019
We seek applicants who have the potential and deep commitment to help define the future of their discipline. You will have the opportunity to present a vision for your research and education, and their importance to the future of computer science. Applications are particularly invited from researchers in computer science whose interests align with or complement existing strengths of the School, whose breadth of vision reaches across traditional discipline silos, and whose record includes strong links with external organisations and industry (where appropriate).For more information, see http://jobs.anu.edu.au/cw/en/job/527916/lecturersenior-lecturerassociate-professor or contact Bob Williamson at bob.williamson at anu.edu.au.
PhD student position in formal verification of ethical principles of AI, Umea (Sweden)Deadline: Thursday 31 January 2019
Umeå University, the Department of Computing Science, is seeking outstanding candidates for a Wallenberg Autonomous Systems Program (WASP) PhD student position in Computer Science with focus on formal verification of ethical principles of AI systems.
An important research area in AI is the development of theories and methods for control and verification of AI systems that adapt to their environment without direct intervention of the users. Trust in the system requires that we are able to ensure that the system complies with societal values and ethical principles, such as fairness, non-discrimination, safety or privacy. This requires going beyond traditional verification and monitoring methods. Theories and tools are needed to specify computational representations of these concepts, and to verify that a given system complies with these. In this project, you will develop methods to verify and monitor the ethical behavior of AI systems based on the observation of input and output behavior according to a continuously evolving societal optimum.
Reference number: AN 2.2.1-2063-18.For more information, see https://umu.mynetworkglobal.com/en/what:job/jobID:241808/ or contact Prof. Virginia Dignum at virginia at cs.umu.se.
(Updated) PhD student position in cyber security, Guildford (UK)Deadline: Monday 1 April 2019
An exciting PhD position is now open. It will be jointly hosted at the Surrey Centre for Cyber Security (SCCS), a GCHQ-recognised 'Academic Centre of Excellence in Cyber Security Research', and Surrey's 5G Innovation Center (5GIC). @topic: This PhD is called "5GTech-Sec: Security analysis of systems using emerging 5G Technologies".
5GTech-Sec will undertake the formal security & privacy analysis of 5G-systems against 5G-specific security and privacy risks: e.g., threats stemming from reconfigurable networks, arbitrary number of connections to a small cell, etc. In other words, this a project to develop formal models, verification mechanisms and tools that are particularly suited for the verification of 5G systems. These will be primarily based on developing new techniques based on model checking of non-classical logics, such as temporal-epistemic logics, as well as theorem proving suited to security-driven theories. To this end, 5GTech-Sec will focus on: (1) capturing the arbitrary-size of the 5G systems; (2) encoding new threats stemming specifically from the novelty of 5G designs (e.g., reconfigurable networks and topologies); (3) analysing privacy properties.For more information, see https://www.jobs.ac.uk/job/BOZ441/phd-studentship-opportunity-security-analysis-of-systems-using-emerging-5g-technologies-5gtech-sec or contact Dr Ioana Boureanu at i.boureanu at surrey.ac.uk.
Postdoctoral position (1y) on the Goedel hierarchy, Warsaw (Poland)Deadline: Thursday 28 February 2019
A 12-month postdoc position at the University of Warsaw is available within the research project "Provability, computation and combinatorics at the lower and intermediate levels of the Gödel hierarchy". The project concerns axiomatic theories of first- and second-order arithmetic.
The position comes with no teaching duties. The starting date of the position should be between October 2019 and February 2020.For more information, see https://www.mimuw.edu.pl/~lak/gr5811-postdoc-Oct2019-EN.pdf or contact Leszek Kołodziejczyk at lak at mimuw.edu.pl.
(Updated) Funded PhD position "The Social Dimension of Mathematics", Loughborough (UK)Deadline: Friday 15 February 2019
A funded PhD studentship on offer for a full-time student to start in September 2019 at the Maths Education Centre, Loughborough University, UK, so be supervised by Dr Fenner Stanley Tanswell
The area is the Philosophy of Mathematical Practices, for a project on "The Social Dimension of Mathematics". The application is relatively straightforward, and has a deadline on the 15th of February 2019.For more information, see https://www.jobs.ac.uk/job/BPA175/the-social-dimensions-of-mathematics or contact Fenner Tanswell at F.Tanswell at lboro.ac.uk.
Postdoc positions in SAT solving at KTH Royal Institute of Technology, Stockholm (Sweden)Deadline: Monday 4 February 2019
The TCS Group at KTH Royal Institute of Technology invites applications for postdoc positions in computer science focused on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms.
The postdoctoral researchers will be working in the research group of Jakob Nordstrom. Much of the activities of this research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers based on conflict-driven clause learning (CDCL). We are even more interested in exploring new algebraic or geometric techniques (such as Groebner bases or pseudo-Boolean solving) that could potentially yield exponential improvements over CDCL. We also believe that there should be ample room for technology transfer with related areas such as SMT solving, constraint programming, and/or mixed integer linear programming, and so excellent researchers in these areas are also warmly welcome to apply.
These postdoc positions are full-time employed positions for one year with a possible (and expected) one-year extension. The expected starting date is in August-September 2019, although this is to some extent negotiable.For more information, see http://www.csc.kth.se/~jakobn/openings/J-2018-3178-Eng.php or contact Jakob Nordstrom at jakobn at kth.se.
Postdoc positions in Theoretical Computer Science at KTH Royal Institute of Technology, Stockholm (Sweden)Deadline: Monday 4 February 2019
The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in theoretical computer science.
The postdoc positions are in the area of computational complexity theory. Current research in the group focuses mostly on approximation algorithms/hardness of approximation, subexponential algorithms, and proof complexity, but excellent researchers in neighbouring areas such as, e.g., communication complexity, circuit complexity, algebraic complexity, and harmonic analysis are also warmly welcome to apply.
This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation and the Swedish Research Council. In addition to the PIs, the research project is planned to involve a total of 3-4 postdocs and 3-4 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.
These postdoc positions are full-time employed positions for one year with a possible(and expected) one-year extension. The expected starting date is in August-September 2019, although this is to some extent negotiable.
Two PhD student positions in reliability and trust, Luxembourg (Luxembourg)Deadline: Thursday 21 March 2019
The Interdisciplinary Centre for Security, Reliability and Trust of the University of Luxembourg has obtained a large grant from the European Union devoted to funding two PhD positions:
1) Security and privacy of resource constrained devices
2) Risk analysis and regulatory compliance of distributed ledger technologies for transaction and management of securitiesFor more information, see http://www.luxli.lu/2018/11/02/two-phd-positions-at-the-university-of-luxembourg/ or contact Réka Markovich at reka.markovich at uni.lu, or Livio Robaldo at livio.robaldo at uni.lu.
Several tenure-track assistant professorships in mathematics (including Westerdijk Fellowships), Utrecht (The Netherlands)Deadline: Friday 1 February 2019
The Mathematical Institute of Utrecht University invites applications for several positions of Tenure Track Assistant Professors in Mathematics, including Westerdijk Fellowships.
In the Division of Fundamental Mathematics, we are searching for candidates whose expertise is in algebraic, arithmetic or differential geometry, including number theory, automorphic forms, algebraic topology, geometric analysis, Lie theory, and mathematical logic.
In the Division of Mathematical Modelling, we are searching for candidates whose expertise is in applied analysis or scientific computing, including data science, machine learning, networks, complex systems, imaging, high performance computing, and mathematical biology.For more information, see https://www.uu.nl/en/organisation/working-at-utrecht-university/jobs.
PhD student position on coalgebra and logic, London (England)Deadline: Monday 11 March 2019
We are seeking to appoint a PhD student in UCL's Programming Principles, Logic, and Verification (PPLV) group, to work alongside the EPSRC-funded project 'A coalgebraic framework for reductive logic and proof-search (ReLiC), led by David Pym (PI), Alexandra Silva, and Simon Docherty.
In the reductive approach to logic, one starts from a putative conclusion, and finds sufficient axioms from which it may be concluded by the systematic reduction of the space of possible (deductive) proofs. The ReLiC project aims to produce a uniform mathematical foundation for reductive logic via the framework of coalgebra and coinduction. Coalgebra can fruitfully be seen as a unifying formalism for stateful systems, while coinduction is a closely connected proof principle based on the reduction of goals into subgoals.
We are looking for a student with an excellent first degree in mathematics, computer science, philosophy, or another mathematical discipline, who has a strong background and interest in logic. Ideally, candidates will also have an excellent, relevant Master?s degree and strong programming skills.For more information, see http://www.cs.ucl.ac.uk/prospective_students/phd_programme/funded_scholarships/#c33500 or contact David Pym at d.pym at ucl.ac.uk, Alexandra Silva at alexandra.silva at ucl.ac.uk, or Simon Docherty. at simon.docherty.14 at ucl.ac.uk.
(Updated) PhD student positions on interface reasoning, London (UK)
We are seeking to appoint 4 talented and highly motivaterd PhD students in UCL's Programming Principles, Logic, and Verification group (PPLV) associated with the EPSRC-funded project 'Interface Reasoning for Interacting Systems' (IRIS), led by Prof. David Pym.
The IRIS project aims to deliver formal reasoning about the behaviour of complex systems at all levels - from computer code and security protocols to distributed systems and business organisations - by reasoning about the interactions between their components.
We are looking for students with an excellent first degree in mathematics, computer science, information systems, philosophy, or another mathematical discipline, have a strong background and interest in logic, verification, security, or organizational architecture and management. Ideally, candidates will also have an excellent, relevant Master's degree and strong programming skills.For more information, see http://www.cs.ucl.ac.uk/prospective_students/phd_programme/funded_scholarships/#c33501 or contact David Pym at d.pym at ucl.ac.uk, James Brotherston at j.brotherston at ucl.ac.uk, or Will Venters at w.venters at lse.ac.uk.