PhD Research Fellowship in Informatics (ref 217339)

Updated: over 2 years ago
Job Type: FullTime
Deadline: 06 Jan 2022

The complexity of Computing systems is getting increasingly more complex. Both simple machine systems, but especially distributed and decentral systems. A significant consequence of this a significant decrease in reliability, which can result in problems relating to everything from runtime errors (e.g., erroneous execution and race conditions) to security guarantees (e.g., side-channel attacks, loss of information).An alternative approach to mitigate these problems is to look at the models that we use to build  programming languages. Often, we do not need the full power of Turing completeness but can do with a more restricted model. This, of course, poses the questions of how these models look and to what degree these restrictions can be made without removing the central properties that we want.

This fellowship will investigate this problem. To get a feel for the possibilities will start by designing and investing a simple toy programming language for a reversible distributes model. This model restricts information flow and gives the possibility for reverse execution, while not overly restricting Turing completeness. The understanding of what guarantees are achieve and which problems are mitigated, will then be used to approach existing models and programming languages.

For more information and how to apply: https://www.jobbnorge.no/en/available-jobs/job/217339/phd-research-fellowship-in-informatics



Similar Positions