Email Gateway (Aug 18 2022 at 20:23): Email Gateway (Aug 18 2022 at 20:23):From: Paolo Tranquilli <tranquil@cs.unibo.it>
=== Two New Post-Doc positions in the CerCo FET-Open EU Project ===
** Job duration: 01/07/2012-30/06/2013 (one year)
** Deadline for reception of candidatures: 29/06/2011
We are currently looking for two Post-Doc positions at the Department of
Computer Science, University of Bologna, to work on the CerCo FET-Open
EU Project (see description below). The gross salary is 26174 euros per
year. Only a minimal amount of taxes is due.
The University of Bologna is the oldest running western university and the
Department of Computer Science (http://www.cs.unibo.it/en/), located in
the historic city center, has strong expertise in theoretical computer
science and logic and it participates to several national and
international projects. The Post-Doc will join the HELM team, leaded by
Prof. Asperti, whose members work in the domains of Type Theory and
Mathematical Knowledge Management. The CerCo project is headed by
Dr. Sacerdoti Coen. The candidates will benefit from exchange opportunity
with the other project participants (University Paris-Diderot, Paris,
and University of Edinburgh, Edinburgh). The candidates will not have any
teaching duties.
Requirements:
We are looking for candidates with a Ph.D. in Computer Science and
previous experience in Type Theory (in particular Interactive
Theorem Proving), and being proficient in functional programming languages.
We also accept candidates that will defend their Ph.D. thesis in the near
future, if they can provide a formal proof that they will.
Starting date:
The proposed starting date is the 01/07/2012. The contract is for one
year. The candidate should contact sacerdot at cs.unibo.it for further
information.
Project description:
The CerCo FET-Open EU Project is aimed at producing the first _formally_
_verified_ _complexity_preserving_ compiler for a subset of C to the
object code for a microprocessor used in embedded systems. The output of
the compilation process will be the object code and a copy of the source
code annotated with _exact_ computational complexities for each program
slice in O(1). The exact computational complexities (expressed in clock
cycles and parametric in the program input) can then be used to formally
reason on the overall code complexity. The source code of the compiler
will be formally verified using the Matita Interactive Theorem Prover
(http://matita.cs.unibo.it), based on a variant of the Calculus of
(Co)Inductive Constructions. The candidate will contribute to the formal
proof of correctness of the compiler.
How to submit candidatures:
All candidates are invited to get in touch in advance with Dr. Claudio
Sacerdoti Coen <sacerdot at cs.unibo.it>, submitting a curriculum vitae.
The official candidature must be received by standard mail (no
electronic submission) before the 29/06/2011. Candidates must fill in the
forms (in Italian only) that can be found at the following address:
https://www.aric.unibo.it/AssegniRicerca/BandiPubblicati/zz_Bandi_din.aspx
(look for the word "Matita" in the second column)
Candidates must also attach two recommendation letters.
Foreign candidates will be helped in compiling the forms.
Kind regards,
Paolo Tranquilli
Last updated: Nov 21 2024 at 12:39 UTC