<!DOCTYPE html><html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
  </head>
  <body>
    <p>Dear All</p>
    <p>The Computing science division at the department of Computer
      science and engineering, Chalmers, has two open PhD positions.<br>
      I would appreciate if you can distribute the information to those
      you might think can be interested/are good candidates.</p>
    <p><b>* Formal Verification of Autonomous Systems</b><br>
      <span style="caret-color: rgb(26, 26, 26); color: rgb(26, 26, 26); background-color: rgb(255, 255, 255);">The
        goal of the PhD project is to develop techniques for the design
        and verification of assured ACPS with a focus on runtime
        assurance. You will develop theory and tools for the
        construction of runtime monitors that capture under what
        conditions an ACPS is guaranteed to maintain safety. A key
        challenge in developing such monitors is to handle noisy,
        missing, or delayed data. Of particular interest is the
        investigation of compositional methods for constructing runtime
        monitors.<br>
        <u>Deadline for application: April 30th<br>
        </u></span><span style="caret-color: rgba(0, 0, 0, 0.9); color: rgba(0, 0, 0, 0.9); background-color: rgb(255, 255, 255);">More
        information: </span><span style="caret-color: rgb(26, 26, 26); color: rgb(26, 26, 26); background-color: rgb(255, 255, 255);"><a href="https://urldefense.com/v3/__https://www.chalmers.se/en/about-chalmers/work-with-us/vacancies/?rmpage=job&rmjob=12785&rmlang=UK__;!!IBzWLUs!T4cTHrCyRiagt1iMJnBw-723XM7bjauK5mbWeKkhX-WmUVkbr2nqrRJ8F_4TQqTj9psK-i26lebz2--r4d7oib5XKsGAJE3-mg$">https://www.chalmers.se/en/about-chalmers/work-with-us/vacancies/?rmpage=job&rmjob=12785&rmlang=UK</a></span></p>
    <p><b>* Graph modification</b><br>
      The goal is to investigate the tractability of these problems from
      both the classical and parameterized complexity perspectives. This
      work lies at the intersection of structural graph theory,
      computational complexity and algorithm design.<br>
      <u>Deadline for application: May 21st</u><br>
      More information:
<a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__https://www.chalmers.se/om-chalmers/arbeta-hos-oss/lediga-tjanster/?rmpage=job&rmjob=12806&rmlang=SE__;!!IBzWLUs!RtKC2TXFQllca48S5mJdB4cslVyVJs4gQyd8mfuzfxti_LKqpbuWjC3c4gnvcBy4KdksWbE74ak4INaOEpM1S9oHemIgxg$">https://www.chalmers.se/om-chalmers/arbeta-hos-oss/lediga-tjanster/?rmpage=job&rmjob=12806&rmlang=SE</a><br>
      <br>
    </p>
    <pre class="moz-signature" cols="72">-- 
-- Ana Bove, Docent
Phone: (46)(31) 772 1020
<a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__http://www.cse.chalmers.se/*bove__;fg!!IBzWLUs!RtKC2TXFQllca48S5mJdB4cslVyVJs4gQyd8mfuzfxti_LKqpbuWjC3c4gnvcBy4KdksWbE74ak4INaOEpM1S9qY8dqZZg$">http://www.cse.chalmers.se/~bove</a>
Department of Computer Science and Engineering
Chalmers Univ. of Technology and Univ. of Gothenburg</pre>
  </body>
</html>