Postes Ouverts
Internship Offers
Generating a User-Manual with and for Isabelle/DOF
Level: L3, M1
Contact: Burkhart Wolff<burkhart.wolff [at] universite-paris-saclay [dot] fr>, Idir Ait-Sadoune<idir.aitsadoune@centralesupelec.fr>
Location: Laboratoire Méthodes Formelles, Université Paris-Saclay
Keywords: Isabelle/HOL, Isabelle/DOF, Formal Document Generation
More Details: here
Semantics of Boolean Networks
Level: M2
Contact: Philippe Dague <philippe.dague [at] universite-paris-saclay [dot] fr>, Thomas Chatain <thomas.chatain [at] ens-paris-saclay [dot] fr>
Location: Laboratoire Méthodes Formelles, Université Paris-Saclay
Keywords: Boolean Networks, update modes
Graphical Language for Clifford Hermiticians in Quantum Computing
Level: M1 - M2
Contact: Renaud Vilmart email: vilmart [at] lsv [dot] fr
Location: Laboratoire Méthodes Formelles, Université Paris-Saclay
Keywords: Quantum Computing, Graphical Language, Completeness, Hermitian Operators
Connecting Isabelle/C with Isabelle/AutoCorres
Level: M1, M2
Contact: Burkhart Wolff
Summary. Isabelle/C is a framework for C code in C11 syntax deeply integrated into the Isabelle/PIDE development environment. Our framework provides an abstract interface for verification back-ends to be plugged-in independently. The purpose of this stage is to develop a translation from C11-AST's generated in Isabelle/C to a semantic backend called AutoCorres, a complex execution model of the C ;language executed on ARM processors.
This ambitious project is actually a re-implementation and integration of existing prototypes: there is actually a Isabelle/C/AutoCorres version based on Isabelle2021 which is functional enough to serve as reference. However, AutoCorres exists meanwhile as a much more recent and self-contained AFP submission (see here), and the technologies inside Isabelle/C to compile the C11-AST's to a semantic backend have also dramatically improved. Since the long-term goal is a submission of Isabelle/C together with the AutoCorres backend, a re-implementation is necessary.
Read the detailed internship proposal.
Connecting Isabelle/C with Isabelle/Clean
Level: L3, M1, M2
Contact: Burkhart Wolff
Summary. Isabelle/C is a framework for C code in C11 syntax deeply integrated into the Isabelle/PIDE development environment. Our framework provides an abstract interface for verification back-ends to be plugged-in independently. The purpose of this stage is to develop a translation from C11-AST's generated in Isabelle/C to a semantic backend called Clean, a simple execution model for an imperative target language.
Read the detailed internship proposal.
Connecting Isabelle/C with Isabelle/Clean
Level: L3, M1, M2
Contact: Burkhart Wolff
Summary. Isabelle/C is a framework for C code in C11 syntax deeply integrated into the Isabelle/PIDE development environment. Our framework provides an abstract interface for verification back-ends to be plugged-in independently. The purpose of this stage is to develop a translation from C11-AST's generated in Isabelle/C to a semantic backend called Clean, a simple execution model for an imperative target language.
Read the detailed internship proposal.
Extending Isabelle/HOLBee with Support for Refinements
Level: L3 Info-Math, M1
Contact: Burkhart Wolff
Summary.HOL-Bee is a semantic Frontend for Abrial's Event-B Method in Isabelle/HOL. It permits to edit specifications in the Event-B language inside the eco-sytem of Isabelle (IDE, kernel, code-generator, proof-system, libraries) and to generate its semantic representation in form of state-relations.
In this internship, the objective is to extend this functionality by generating the proof-obligations
and elementary proof-support. (Read the detailed internship proposal.).
Extending Isabelle/HOLBee with Support for Refinements
Level: L3 Info-Math, M1
Contact: Burkhart Wolff
Summary.HOL-Bee is a semantic Frontend for Abrial's Event-B Method in Isabelle/HOL. It permits to edit specifications in the Event-B language inside the eco-sytem of Isabelle (IDE, kernel, code-generator, proof-system, libraries) and to generate its semantic representation in form of state-relations.
In this internship, the objective is to extend this functionality by generating the proof-obligations
and elementary proof-support. (Read the detailed internship proposal.).
Faithful Nash equilibria in games over graphs
Level: M1 - M2
Contact: Dietmar Berwanger (dwb@lsv.fr) and Patricia Bouyer (bouyer@lsv.fr)
Location: Laboratoire Méthodes Formelles, ENS Paris-Saclay
Keywords: Games of perfect information, Nash equilibria
Introduction of Timing Aspects into Event-B
Level: M2
Contact: Idir Ait Sadoune <idir.aitsadoune [at] centralesupelec [dot] fr>,
Location: Laboratoire Méthodes Formelles, Université Paris-Saclay
Keywords: Event B, Timed systems
::