http://stator.imag.fr/w/api.php?action=feedcontributions&feedformat=atom&user=David+MonniauxSTATOR - User contributions [en-gb]2026-04-30T19:27:43ZUser contributionsMediaWiki 1.34.1http://stator.imag.fr/w/index.php?title=Main_Page&diff=251Main Page2016-06-24T09:24:32Z<p>David Monniaux: BDD Polyhedra</p>
<hr />
<div>==The STATOR project==<br />
[[Image:ERC acronym.pdf|150px|right]]<br />
'''STATOR''' is a 5-year research project funded by the [[wikipedia:European Research Council|European Research Council]], an organisation established by the [[wikipedia:European Union|European Union]]. [[Image:Flag of Europe.svg||40px]]<br />
'<br />
<br />
It focuses on developing new methods for [[static analysis]] of software — that is, mathematically and automatically proving that software behaves in the desired way.<br />
<br />
The project is led by [[User:David Monniaux|Dr David Monniaux]], senior researcher at [[wikipedia:CNRS|CNRS]]. See other [[members]].<br />
<br />
For more detail, see [[:File:STATOR PE6 306595 description of work shortened.pdf|description of work]].<br />
<br />
==Work openings==<br />
* [[Hiring/BDDPolyhedra|PhD on BDD+polyhedra]]<br />
<br />
==Laboratory==<br />
[[Image:Logo VERIMAG vectorise.svg|100px]]<br />
[[Image:UJFquadriBaseGauche.png|180px]]<br />
[[Image:WEB CNRS-filaire-Quadri.jpg|80px]]<br />
<br />
'''STATOR''' is hosted at [[VERIMAG]], a joint research laboratory of CNRS and [[wikipedia:Université Joseph Fourier|Université Joseph Fourier]] in [[wikipedia:Grenoble|Grenoble]], France.<br />
<br />
[[File:Grenoble from Moucherotte IMG 0861 tuned.jpg|800px]]</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Hiring/BDDPolyhedra&diff=250Hiring/BDDPolyhedra2016-06-13T15:22:48Z<p>David Monniaux: /* Required Skills */</p>
<hr />
<div>The STATOR project is hiring a PhD student.<br />
<br />
==Keywords==<br />
convex polyhedra; parametric linear programming; binary decision diagrams; satisfiability testing; computer proofs.<br />
<br />
==Context==<br />
Convex polyhedra are powerful approach to representing sets of states of software or of a control system from which that system cannot escape. Such sets of states are used to automatically show that some error conditions are unreachable.<br />
<br />
General convex polyhedra were commonly considered too costly to be applied to many variables at once, because of the "curse of dimensionality". The traditional approach to algorithms on convex polyhedra is the double representation (as vertices and faces), which has well-known exponential cases that occur in common cases (e.g. hypercubes). Because of this, they were commonly restricted to low dimensions, or to special subclasses (e.g. products of intervals, "octagons").<br />
<br />
At VERIMAG, we have developed an approach for representing polyhedra as constraints only. Our recent progress on efficient approaches to parametric linear programming have shown that it can be used as a very efficient basic block for the algorithms operating over such a representation.<br />
<br />
In parallel, sets of vectors of Booleans are commonly represented using binary decision diagrams (BDDs) or similar structures. These are used in model-checking, again for showing that some error conditions are unreachable.<br />
<br />
It is very tempting to combine convex polyhedra and Boolean reasoning. Attempts so far (e.g. the BDDApron library) have however had somewhat disappointing performance.<br />
<br />
==Goals==<br />
We are interested in the design of algorithms operating over maps from {0,1}^n to the set of convex polyhedra, where commonality between several polyhedra in the same map will be exploited so as to avoid useless duplication of computations.<br />
<br />
==Working Context==<br />
The thesis will be co-advised by Michaël Périn and David Monniaux. The PhD student will be hosted by the Verimag laboratory, near Grenoble in the French Alps. The Grenoble area, in addition to the surrounding mountains known for winter sports, features one of Europe's largest concentrations of academic/industrial research and development with a lot of students and a relatively-cosmopolite atmosphere. You can easily reach Lyon (1 hour), Geneva (1.5 hours), Torino (2 hours), Paris (3 hours by train) and Barcelona (6 hours).<br />
<br />
==Required Skills==<br />
Motivated candidates should hold a Master's degree and have a solid background in '''either''' computer science or operation research (linear programming etc.). Good programming skills are also required, in OCaml and/or C++.<br />
<br />
==Procedure==<br />
The candidates are kindly asked to send an e-mail with "PhD candidate" in the title, a CV and motivation letter to [http://www-verimag.imag.fr/~perin/ Michaël Périn] and [http://www-verimag.imag.fr/~monniaux David Monniaux].<br />
<br />
Knowledge of French is ''not'' a prerequisite (courses of French language will be covered by the lab).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Hiring/BDDPolyhedra&diff=249Hiring/BDDPolyhedra2016-06-13T15:22:14Z<p>David Monniaux: </p>
<hr />
<div>The STATOR project is hiring a PhD student.<br />
<br />
==Keywords==<br />
convex polyhedra; parametric linear programming; binary decision diagrams; satisfiability testing; computer proofs.<br />
<br />
==Context==<br />
Convex polyhedra are powerful approach to representing sets of states of software or of a control system from which that system cannot escape. Such sets of states are used to automatically show that some error conditions are unreachable.<br />
<br />
General convex polyhedra were commonly considered too costly to be applied to many variables at once, because of the "curse of dimensionality". The traditional approach to algorithms on convex polyhedra is the double representation (as vertices and faces), which has well-known exponential cases that occur in common cases (e.g. hypercubes). Because of this, they were commonly restricted to low dimensions, or to special subclasses (e.g. products of intervals, "octagons").<br />
<br />
At VERIMAG, we have developed an approach for representing polyhedra as constraints only. Our recent progress on efficient approaches to parametric linear programming have shown that it can be used as a very efficient basic block for the algorithms operating over such a representation.<br />
<br />
In parallel, sets of vectors of Booleans are commonly represented using binary decision diagrams (BDDs) or similar structures. These are used in model-checking, again for showing that some error conditions are unreachable.<br />
<br />
It is very tempting to combine convex polyhedra and Boolean reasoning. Attempts so far (e.g. the BDDApron library) have however had somewhat disappointing performance.<br />
<br />
==Goals==<br />
We are interested in the design of algorithms operating over maps from {0,1}^n to the set of convex polyhedra, where commonality between several polyhedra in the same map will be exploited so as to avoid useless duplication of computations.<br />
<br />
==Working Context==<br />
The thesis will be co-advised by Michaël Périn and David Monniaux. The PhD student will be hosted by the Verimag laboratory, near Grenoble in the French Alps. The Grenoble area, in addition to the surrounding mountains known for winter sports, features one of Europe's largest concentrations of academic/industrial research and development with a lot of students and a relatively-cosmopolite atmosphere. You can easily reach Lyon (1 hour), Geneva (1.5 hours), Torino (2 hours), Paris (3 hours by train) and Barcelona (6 hours).<br />
<br />
==Required Skills==<br />
Motivated candidates should hold a Master's degree and have a solid background in \textbf{either} computer science or operation research (linear programming etc.). Good programming skills are also required, in OCaml and/or C++.<br />
<br />
==Procedure==<br />
The candidates are kindly asked to send an e-mail with "PhD candidate" in the title, a CV and motivation letter to [http://www-verimag.imag.fr/~perin/ Michaël Périn] and [http://www-verimag.imag.fr/~monniaux David Monniaux].<br />
<br />
Knowledge of French is ''not'' a prerequisite (courses of French language will be covered by the lab).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Hiring/BDDPolyhedra&diff=248Hiring/BDDPolyhedra2016-06-13T15:20:13Z<p>David Monniaux: Created page with "The STATOR project is hiring a PhD student. ==Keywords== convex polyhedra; parametric linear programming; binary decision diagrams; satisfiability testing; computer proofs...."</p>
<hr />
<div>The STATOR project is hiring a PhD student.<br />
<br />
==Keywords==<br />
convex polyhedra; parametric linear programming; binary decision diagrams; satisfiability testing; computer proofs.<br />
<br />
==Context==<br />
Convex polyhedra are powerful approach to representing sets of states of software or of a control system from which that system cannot escape. Such sets of states are used to automatically show that some error conditions are unreachable.<br />
<br />
General convex polyhedra were commonly considered too costly to be applied to many variables at once, because of the "curse of dimensionality". The traditional approach to algorithms on convex polyhedra is the double representation (as vertices and faces), which has well-known exponential cases that occur in common cases (e.g. hypercubes). Because of this, they were commonly restricted to low dimensions, or to special subclasses (e.g. products of intervals, "octagons").<br />
<br />
At VERIMAG, we have developed an approach for representing polyhedra as constraints only. Our recent progress on efficient approaches to parametric linear programming have shown that it can be used as a very efficient basic block for the algorithms operating over such a representation.<br />
<br />
In parallel, sets of vectors of Booleans are commonly represented using binary decision diagrams (BDDs) or similar structures. These are used in model-checking, again for showing that some error conditions are unreachable.<br />
<br />
It is very tempting to combine convex polyhedra and Boolean reasoning. Attempts so far (e.g. the BDDApron library) have however had somewhat disappointing performance.<br />
<br />
==Goals==<br />
We are interested in the design of algorithms operating over maps from $\{0,1\}^n$ to the set of convex polyhedra, where commonality between several polyhedra in the same map will be exploited so as to avoid useless duplication of computations.<br />
<br />
==Working Context==<br />
The thesis will be co-advised by Michaël Périn and David Monniaux. The PhD student will be hosted by the Verimag laboratory, near Grenoble in the French Alps. The Grenoble area, in addition to the surrounding mountains known for winter sports, features one of Europe's largest concentrations of academic/industrial research and development with a lot of students and a relatively-cosmopolite atmosphere. You can easily reach Lyon (1 hour), Geneva (1.5 hours), Torino (2 hours), Paris (3 hours by train) and Barcelona (6 hours).<br />
<br />
==Required Skills==<br />
Motivated candidates should hold a Master's degree and have a solid background in \textbf{either} computer science or operation research (linear programming etc.). Good programming skills are also required, in OCaml and/or C++.<br />
<br />
==Procedure==<br />
The candidates are kindly asked to send an e-mail with "PhD candidate" in the title, a CV and motivation letter to [http://www-verimag.imag.fr/~perin/ Michaël Périn] and [http://www-verimag.imag.fr/~monniaux David Monniaux].<br />
<br />
Knowledge of French is ''not'' a prerequisite (courses of French language will be covered by the lab).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=166ICMS 2014 session on automated proofs by induction2014-02-25T09:05:33Z<p>David Monniaux: /* Publications */</p>
<hr />
<div>A session on software for automated proofs by induction will be held at the [http://voronoi.hanyang.ac.kr/icms2014/ 4th International Congress on Mathematical Software] (ICMS), August 5(Tue)-9(Sat) 2014, Seoul, Korea, a satellite conference of the [http://www.icm2014.org/ International congress of mathematicians].<br />
<br />
==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves ''safety properties'' of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”, and the construction of such proofs is often called “invariant inference”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
More detailed information on the submission process is featured on [http://voronoi.hanyang.ac.kr/icms2014/Submission.html this page].<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details.<br />
<br />
Please note the deadlines :<br />
* March 31 for a short abstract (200 words)<br />
* April 30 for an extended abstract (2-3 pages)<br />
<br />
Submissions should be sent to induction2014 AT imag DOT fr, with ICMS in the email title.<br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=165ICMS 2014 session on automated proofs by induction2014-02-24T13:36:14Z<p>David Monniaux: /* Aims and scope */</p>
<hr />
<div>A session on software for automated proofs by induction will be held at the [http://voronoi.hanyang.ac.kr/icms2014/ 4th International Congress on Mathematical Software] (ICMS), August 5(Tue)-9(Sat) 2014, Seoul, Korea, a satellite conference of the [http://www.icm2014.org/ International congress of mathematicians].<br />
<br />
==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves ''safety properties'' of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”, and the construction of such proofs is often called “invariant inference”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details.<br />
<br />
Please note the deadlines :<br />
* March 31 for a short abstract (200 words)<br />
* April 30 for an extended abstract (2-3 pages)<br />
<br />
Submissions should be sent to induction2014 AT imag DOT fr, with ICMS in the email title.<br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=164ICMS 2014 session on automated proofs by induction2014-02-24T13:35:28Z<p>David Monniaux: </p>
<hr />
<div>A session on software for automated proofs by induction will be held at the [http://voronoi.hanyang.ac.kr/icms2014/ 4th International Congress on Mathematical Software] (ICMS), August 5(Tue)-9(Sat) 2014, Seoul, Korea, a satellite conference of the [http://www.icm2014.org/ International congress of mathematicians].<br />
<br />
==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves ''safety properties'' of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details.<br />
<br />
Please note the deadlines :<br />
* March 31 for a short abstract (200 words)<br />
* April 30 for an extended abstract (2-3 pages)<br />
<br />
Submissions should be sent to induction2014 AT imag DOT fr, with ICMS in the email title.<br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=163ICMS 2014 session on automated proofs by induction2014-02-24T12:58:11Z<p>David Monniaux: </p>
<hr />
<div>A session on software for automated proofs by induction will be held at the [http://voronoi.hanyang.ac.kr/icms2014/ 4th International Congress on Mathematical Software] (ICMS), August 5(Tue)-9(Sat) 2014, Seoul, Korea, a satellite conference of the [http://www.icm2014.org/ International congress of mathematicians].<br />
<br />
==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details.<br />
<br />
Please note the deadlines :<br />
* March 31 for a short abstract (200 words)<br />
* April 30 for an extended abstract (2-3 pages)<br />
<br />
Submissions should be sent to induction2014 AT imag DOT fr, with ICMS in the email title.<br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Seminar&diff=162Seminar2014-02-17T09:43:02Z<p>David Monniaux: </p>
<hr />
<div>==Schedule==<br />
* Monday, December 2, 2013: Thibault Gauthier, A higher order to first order translation<br />
* Tuesday, February 18, 2014: Radu Iosif, Safety Problems are NP-complete for Flat Integer Programs with Octagonal Loops (a tutorial on rigorous acceleration techniques)<br />
==Pool of available subjects==<br />
===David Monniaux===<br />
# (or Julien Henry) Worst-case execution time analysis of programs using SMT and a clever encoding<br />
# Single-cell abstraction of arrays<br />
<br />
===Radu Iosif===<br />
# Underapproximation of Procedure Summaries for Integer Programs + Polynomially Bounded Control Sets (higher-order acceleration or acceleration for recursive programs)<br />
# The Tree Width of Separation Logic with Recursive Definitions + Deciding Entailments in Inductive Separation Logic with Tree Automata (a tutorial on Separation Logic for compositional program analysis with emphasis on decidability issues)</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Members&diff=161Members2014-02-17T09:05:29Z<p>David Monniaux: </p>
<hr />
<div>==Principal investigator==<br />
* [[User:David Monniaux|Dr David Monniaux]]<br />
<br />
==Other members==<br />
* [http://www-verimag.imag.fr/~jhenry Julien Henry], doctoral student<br />
* Egor Karpenkov, doctoral student<br />
* [http://www.inf.usi.ch/phd/alberti/ Francesco Alberti], doctoral student (on leave from University of Lugano)<br />
* Dr Irina Asavoae, postdoctoral researcher<br />
<br />
==Associates==<br />
* [http://laure.gonnord.org/pro/ Dr Laure Gonnord], assistant professor at Université Lyon-1</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Members&diff=160Members2014-02-17T09:04:50Z<p>David Monniaux: </p>
<hr />
<div>==Principal investigator==<br />
* [[User:David Monniaux|Dr David Monniaux]]<br />
<br />
==Other members==<br />
* [http://www-verimag.imag.fr/~jhenry Julien Henry], doctoral student<br />
* Egor Karpenkov, doctoral student<br />
* Dr Irina Asavoae, postdoctoral researcher<br />
<br />
==Associates==<br />
* [http://laure.gonnord.org/pro/ Dr Laure Gonnord], assistant professor at Université Lyon-1</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Seminar&diff=159Seminar2014-02-17T09:03:56Z<p>David Monniaux: </p>
<hr />
<div>==Schedule==<br />
* Tuesday, February 18, 2014: Radu Iosif, Safety Problems are NP-complete for Flat Integer Programs with Octagonal Loops (a tutorial on rigorous acceleration techniques)<br />
==Pool of available subjects==<br />
===David Monniaux===<br />
# (or Julien Henry) Worst-case execution time analysis of programs using SMT and a clever encoding<br />
# Single-cell abstraction of arrays<br />
<br />
===Radu Iosif===<br />
# Underapproximation of Procedure Summaries for Integer Programs + Polynomially Bounded Control Sets (higher-order acceleration or acceleration for recursive programs)<br />
# The Tree Width of Separation Logic with Recursive Definitions + Deciding Entailments in Inductive Separation Logic with Tree Automata (a tutorial on Separation Logic for compositional program analysis with emphasis on decidability issues)</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=158ICMS 2014 session on automated proofs by induction2014-02-14T07:30:24Z<p>David Monniaux: </p>
<hr />
<div>A session on software for automated proofs by induction will be held at the [http://voronoi.hanyang.ac.kr/icms2014/ 4th International Congress on Mathematical Software] (ICMS), August 5(Tue)-9(Sat) 2014, Seoul, Korea, a satellite conference of the [http://www.icm2014.org/ International congress of mathematicians].<br />
<br />
==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details.<br />
<br />
Please note the deadlines :<br />
* March 31 for a short abstract (200 words)<br />
* April 30 for an extended abstract (2-3 pages)<br />
<br />
Submissions should be sent to David DOT Monniaux AT imag DOT fr, with ICMS in the email title.<br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=157ICMS 2014 session on automated proofs by induction2014-02-14T07:24:49Z<p>David Monniaux: /* Submission guidelines */</p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details.<br />
<br />
Please note the deadlines :<br />
* March 31 for a short abstract (200 words)<br />
* April 30 for an extended abstract (2-3 pages)<br />
<br />
Submissions should be sent to David DOT Monniaux AT imag DOT fr, with ICMS in the email title.<br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=156ICMS 2014 session on automated proofs by induction2014-02-14T07:22:08Z<p>David Monniaux: /* Submission guidelines */</p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details.<br />
<br />
Submissions should be sent to David DOT Monniaux AT imag DOT fr, with ICMS in the email title.<br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=155ICMS 2014 session on automated proofs by induction2014-02-14T07:19:44Z<p>David Monniaux: /* Submission guidelines */</p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==<br />
If you would like to give a talk at ICMS, you need to submit first a short abstract and then later an extended abstract. See the [http://voronoi.hanyang.ac.kr/icms2014/Submission.html guidelines] for the details. <br />
<br />
After the meeting, the submission guideline for a journal special issue will be communicated to you by the session organizers.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=154ICMS 2014 session on automated proofs by induction2014-02-14T07:18:50Z<p>David Monniaux: </p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties, in areas such as computer algebra, automated program analysis and automated theorem proving.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Topics==<br />
Topics include, non-exhaustively:<br />
* abstract interpretation<br />
* predicate abstraction<br />
* policy iteration<br />
* approaches based Craig interpolation<br />
* ''k''-induction<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=153ICMS 2014 session on automated proofs by induction2014-02-14T07:16:27Z<p>David Monniaux: </p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties (model-checking, abstract interpretation, predicate abstraction), with building blocks such as Craig interpolation, Kleene and policy iterations, quantifier elimination etc.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* An extended abstract will appear on the permanent conference web page (see below) as soon as accepted. It will also appear on the proceedings that will be distributed during the meeting. <br />
* We plan to invite speakers of the session to a special journal issue after the conference (more information about this later).<br />
<br />
==Submission guidelines==</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=152ICMS 2014 session on automated proofs by induction2014-02-13T18:23:03Z<p>David Monniaux: publications</p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties (model-checking, abstract interpretation, predicate abstraction), with building blocks such as Craig interpolation, Kleene and policy iterations, quantifier elimination etc.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.<br />
<br />
==Publications==<br />
* A ''short abstract'' will appear on the permanent conference web page (see below) as soon as accepted. <br />
* We plan to invite speakers of the session to a special journal issue after the conference.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=151ICMS 2014 session on automated proofs by induction2014-02-13T18:20:53Z<p>David Monniaux: aims and scope</p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]<br />
<br />
==Aims and scope==<br />
In many contexts one proves properties of the form <math>\forall n \in \mathbb{N}~ P(n)</math>. For instance, formal verification of software proves safety'' properties of the form “for any number of program steps, the output satisfies the specification”.<br />
<br />
In easy cases, <math>P(n)</math> can be proved by induction: <math>P(0)</math> holds and <math>P(n) \Rightarrow P(n+1)</math> holds for all <math>n</math>. In most cases, however, one must invent some property <math>Q</math> that is “inductive” (<math>Q(0)</math> holds and <math>Q(n) \Rightarrow Q(n+1)</math> holds for all <math>n</math>) and such that <math>Q(n) \Rightarrow P(n)</math> holds.<br />
In software verification, such a property is called an “inductive invariant”.<br />
<br />
Over the years, a variety of approaches have been proposed to automatically or semi-automatically obtain inductive properties (model-checking, abstract interpretation, predicate abstraction), with building blocks such as Craig interpolation, Kleene and policy iterations, quantifier elimination etc.<br />
<br />
The session aims at bringing together designers of software verification tools and automated theorem provers, and users of these tools.</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=ICMS_2014_session_on_automated_proofs_by_induction&diff=150ICMS 2014 session on automated proofs by induction2014-02-13T17:49:37Z<p>David Monniaux: organizer</p>
<hr />
<div>==Organizer==<br />
[[User:David Monniaux|David Monniaux]], [http://www.cnrs.fr/ CNRS] / [http://www-verimag.imag.fr/~monniaux VERIMAG]</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Seminar&diff=149Seminar2014-02-11T13:57:18Z<p>David Monniaux: Radu, David</p>
<hr />
<div>==Pool of available subjects==<br />
===David Monniaux===<br />
# (or Julien Henry) Worst-case execution time analysis of programs using SMT and a clever encoding<br />
# Single-cell abstraction of arrays<br />
<br />
===Radu Iosif===<br />
# Safety Problems are NP-complete for Flat Integer Programs with Octagonal Loops (a tutorial on rigorous acceleration techniques)<br />
# Underapproximation of Procedure Summaries for Integer Programs + Polynomially Bounded Control Sets (higher-order acceleration or acceleration for recursive programs)<br />
# The Tree Width of Separation Logic with Recursive Definitions + Deciding Entailments in Inductive Separation Logic with Tree Automata (a tutorial on Separation Logic for compositional program analysis with emphasis on decidability issues)</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Members&diff=148Members2013-05-03T08:15:15Z<p>David Monniaux: </p>
<hr />
<div>==Principal investigator==<br />
* [[User:David Monniaux|Dr David Monniaux]]<br />
<br />
==Other members==<br />
* [http://www-verimag.imag.fr/~jhenry Julien Henry], doctoral student<br />
* Dr Irina Asavoae, postdoctoral researcher<br />
<br />
==Associates==<br />
* [http://laure.gonnord.org/pro/ Dr Laure Gonnord], assistant professor at the University of Lille</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Members&diff=147Members2013-05-03T08:14:40Z<p>David Monniaux: </p>
<hr />
<div>==Principal investigator==<br />
* [[User:David Monniaux|Dr David Monniaux]]<br />
<br />
==Other members==<br />
* Dr Irina Asavoae, postdoctoral researcher<br />
<br />
==Associates==<br />
* [http://laure.gonnord.org/pro/ Dr Laure Gonnord], assistant professor at the University of Lille</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Members&diff=146Members2013-05-03T08:14:34Z<p>David Monniaux: </p>
<hr />
<div>==Principal investigator==<br />
* [[User:David Monniaux|Dr David Monniaux]<br />
<br />
==Other members==<br />
* Dr Irina Asavoae, postdoctoral researcher<br />
<br />
==Associates==<br />
* [http://laure.gonnord.org/pro/ Dr Laure Gonnord], assistant professor at the University of Lille</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Members&diff=145Members2013-05-03T08:14:21Z<p>David Monniaux: Created page with "==Principal investigator== * User:David Monniaux ==Other members== * Dr Irina Asavoae, postdoctoral researcher ==Associates== * [http://laure.gonnord.o..."</p>
<hr />
<div>==Principal investigator==<br />
* [[Dr David Monniaux|User:David Monniaux]]<br />
<br />
==Other members==<br />
* Dr Irina Asavoae, postdoctoral researcher<br />
<br />
==Associates==<br />
* [http://laure.gonnord.org/pro/ Dr Laure Gonnord], assistant professor at the University of Lille</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Main_Page&diff=144Main Page2013-05-03T08:12:51Z<p>David Monniaux: </p>
<hr />
<div>==The STATOR project==<br />
[[Image:ERC acronym.pdf|150px|right]]<br />
'''STATOR''' is a 5-year research project funded by the [[wikipedia:European Research Council|European Research Council]], an organisation established by the [[wikipedia:European Union|European Union]]. [[Image:Flag of Europe.svg||40px]]<br />
'<br />
<br />
It focuses on developing new methods for [[static analysis]] of software — that is, mathematically and automatically proving that software behaves in the desired way.<br />
<br />
The project is led by [[User:David Monniaux|Dr David Monniaux]], senior researcher at [[wikipedia:CNRS|CNRS]]. See other [[members]].<br />
<br />
For more detail, see [[:File:STATOR PE6 306595 description of work shortened.pdf|description of work]].<br />
<br />
==Laboratory==<br />
[[Image:Logo VERIMAG vectorise.svg|100px]]<br />
[[Image:UJFquadriBaseGauche.png|180px]]<br />
[[Image:WEB CNRS-filaire-Quadri.jpg|80px]]<br />
<br />
'''STATOR''' is hosted at [[VERIMAG]], a joint research laboratory of CNRS and [[wikipedia:Université Joseph Fourier|Université Joseph Fourier]] in [[wikipedia:Grenoble|Grenoble]], France.<br />
<br />
[[File:Grenoble from Moucherotte IMG 0861 tuned.jpg|800px]]</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=143Internships2013-01-30T10:20:50Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years) and some transcript/grading information (e.g. if you took a national competitive exam, please list the exam and your ranking).<br />
* Programming languages mastered (please only include those in which you can program with some proficiency; vague remembrances of an introductory course do not qualify).<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* A list of internships etc. including names and email addresses of supervisors.<br />
* Scientific articles and research reports written, if any (please attach them or, better, give a link to a page from which we can download them).<br />
* Prizes, awards, grants etc. for academic studies and programming (e.g. results in [[wikipedia:ACM_International_Collegiate_Programming_Contest|ACM International Collegiate Programming Contest]]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=142Internships2013-01-30T10:19:37Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years) and some transcript/grading information (e.g. if you took a national competitive exam, please list the exam and your ranking).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* A list of internships etc. including names and email addresses of supervisors.<br />
* Scientific articles and research reports written, if any (please attach them or, better, give a link to a page from which we can download them).<br />
* Prizes, awards, grants etc. for academic studies and programming (e.g. results in [[wikipedia:ACM_International_Collegiate_Programming_Contest|ACM International Collegiate Programming Contest]]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=141Internships2013-01-30T10:18:36Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years) and some transcript/grading information (e.g. if you took a national competitive exam, please list the exam and your ranking).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Scientific articles and research reports written, if any (please attach them or, better, give a link to a page from which we can download them).<br />
* Prizes, awards, grants etc. for academic studies and programming (e.g. results in [[wikipedia:ACM_International_Collegiate_Programming_Contest|ACM International Collegiate Programming Contest]]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=140Internships2013-01-30T10:18:03Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years) and some transcript/grading information.<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Scientific articles and research reports written, if any (please attach them or, better, give a link to a page from which we can download them).<br />
* Prizes, awards, grants etc. for academic studies and programming (e.g. results in [[wikipedia:ACM_International_Collegiate_Programming_Contest|ACM International Collegiate Programming Contest]]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=139Internships2013-01-30T10:17:21Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Scientific articles and research reports written, if any (please attach them or, better, give a link to a page from which we can download them).<br />
* Prizes, awards, grants etc. for academic studies and programming (e.g. results in [[wikipedia:ACM_International_Collegiate_Programming_Contest|ACM International Collegiate Programming Contest]]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=138Internships2013-01-30T10:16:23Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Prizes, awards, grants etc. for academic and programming (e.g. results in [[wikipedia:ACM_International_Collegiate_Programming_Contest|ACM International Collegiate Programming Contest]]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=137Internships2013-01-30T10:15:57Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Prizes, awards, grants etc. for academic and programming (e.g. results in [[wikipedia:ACM_International_Collegiate_Programming_Contest ACM International Collegiate Programming Contest]]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=136Internships2013-01-30T10:14:43Z<p>David Monniaux: /* For non-European students */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Prizes, awards, grants etc. for academic and programming (e.g. results in [http://en.wikipedia.org/wiki/ACM_International_Collegiate_Programming_Contest ACM International Collegiate Programming Contest]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
==For non-European students==<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites. You'll need at least a valid passport; please apply for one from your government in advance.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=135Internships2013-01-30T10:13:35Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport).<br />
* Date of birth (at least the year).<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Prizes, awards, grants etc. for academic and programming (e.g. results in [http://en.wikipedia.org/wiki/ACM_International_Collegiate_Programming_Contest ACM International Collegiate Programming Contest]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=134Internships2013-01-30T10:12:07Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain:<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport)<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Prizes, awards, grants etc. for academic and programming (e.g. results in [http://en.wikipedia.org/wiki/ACM_International_Collegiate_Programming_Contest ACM International Collegiate Programming Contest]).<br />
<br />
You may leave out the following items:<br />
* Minor prizes and awards (e.g. half the students at your university obtain them).<br />
* Sports and hobbies (e.g. it's nice to know you play the harmonica, but we're running a research lab, as opposed to a blues/rock band).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=133Internships2013-01-30T10:10:24Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
To summarize: an application should contain<br />
* Name and surname (if you are from a country where name/surnames do not work as in France, e.g. you only have a first name, please explain the situation; in case of names in non-Latin scripts please include both the spelling in your own language and the spelling in Latin letters as written on your passport)<br />
* Exact description of degree sought and degree-granting institution, including any details we might not be familiar with.<br />
* Higher education studies, including list of courses (at least in the last 2 years).<br />
* Programming languages mastered.<br />
* Natural languages practiced, with degree of proficiency (only French and English are important for our purposes).<br />
* Prizes, awards, grants etc. for academic and programming (e.g. results in [http://en.wikipedia.org/wiki/ACM_International_Collegiate_Programming_Contest ACM International Collegiate Programming Contest]).<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=132Internships2013-01-30T10:06:04Z<p>David Monniaux: /* Application */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===Caveats===<br />
We receive many applications from potential interns and thus cannot afford to spend too much time investigating each one; please have all information clearly written as described in this page.<br />
<br />
Most applications we receive are obviously mass-mailed to many research groups, regardless of appropriateness. We tend to immediately send such applications to the email trashcan.<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=131Internships2013-01-30T10:01:39Z<p>David Monniaux: /* For non-European students */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, not to mention various costs, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=130Internships2013-01-30T09:59:21Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative. Links to course pages are even better.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=VERIMAG&diff=129VERIMAG2013-01-30T09:46:27Z<p>David Monniaux: </p>
<hr />
<div>'''VERIMAG''' is a joint research laboratory of [[wikipedia:CNRS|CNRS]], [[wikipedia:Joseph Fourier University|Joseph Fourier University]] (UJF) and [[wikipedia:Grenoble Institute of Technology|Grenoble Institute of Technology]] (Grenoble-INP).<br />
<br />
==Location==<br />
It is located in Gières, a suburb of Grenoble, 150m off the main UJF/INP campus, and is connected by public transportation to campus sites and the Grenoble city center.<br />
<br />
<slippymap lat="45.1892" lon="5.77728" z="17" w="600" h="400" format="jpeg" layer="mapnik"/><br />
<br />
==Staff==<br />
The academic staff of the laboratory is composed of:<br />
* Full-time permanent researchers (junior, ''chargé de recherche'', or senior, ''directeur de recherche'') from CNRS.<br />
* Professors (junior, ''maître de conférence'', or senior, ''professeur des universités'') from the UJF and INP.<br />
<br />
In addition, the laboratory comprises:<br />
* Other teaching staff<br />
* Research engineers<br />
* Technical staff<br />
* Clerical staff<br />
* PhD and masters students<br />
* Interns<br />
<br />
==Links==<br />
* [http://www-verimag.imag.fr/ Official site]</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=VERIMAG&diff=128VERIMAG2013-01-30T09:45:50Z<p>David Monniaux: </p>
<hr />
<div>'''VERIMAG''' is a joint research laboratory of [[wikipedia:CNRS|CNRS]], [[wikipedia:Joseph Fourier University|Joseph Fourier University]] (UJF) and [[wikipedia:Grenoble Institute of Technology|Grenoble Institute of Technology]] (Grenoble-INP).<br />
<br />
It is located in Gières, a suburb of Grenoble, 150m off the main UJF/INP campus, and is connected by public transportation to campus sites and the Grenoble city center.<br />
<br />
The academic staff of the laboratory is composed of:<br />
* Full-time permanent researchers (junior, ''chargé de recherche'', or senior, ''directeur de recherche'') from CNRS.<br />
* Professors (junior, ''maître de conférence'', or senior, ''professeur des universités'') from the UJF and INP.<br />
<br />
In addition, the laboratory comprises:<br />
* Other teaching staff<br />
* Research engineers<br />
* Technical staff<br />
* Clerical staff<br />
* PhD and masters students<br />
* Interns<br />
<br />
<slippymap lat="45.1892" lon="5.77728" z="17" w="600" h="400" format="jpeg" layer="mapnik"/></div>David Monniauxhttp://stator.imag.fr/w/index.php?title=VERIMAG&diff=127VERIMAG2013-01-30T09:45:29Z<p>David Monniaux: </p>
<hr />
<div>'''VERIMAG''' is a joint research laboratory of [[wikipedia:CNRS|CNRS]], [[wikipedia:Joseph Fourier University|Joseph Fourier University]] (UJF) and [[wikipedia:Grenoble Institute of Technology|Grenoble Institute of Technology]] (Grenoble-INP).<br />
<br />
It is located in Gières, a suburb of Grenoble, 150m off the main UJF/INP campus, and is connected by public transportation to campus sites and the Grenoble city center.<br />
<br />
The academic staff of the laboratory is composed of:<br />
* Full-time permanent researchers (junior, ''chargé de recherche'', or senior, ''directeur de recherche'') from CNRS.<br />
* Professors (junior, ''maître de conférence'', or senior, ''professeur des universités'') from the UJF and INP.<br />
<br />
In addition, the laboratory comprises:<br />
* Other teaching staff<br />
* Research engineers<br />
* Technical staff<br />
* Clerical staff<br />
* PhD and masters students<br />
* Interns<br />
<br />
<slippymap lat="45.1892" lon="5.77728" z="17" w="450" h="300" format="jpeg" layer="mapnik"/></div>David Monniauxhttp://stator.imag.fr/w/index.php?title=VERIMAG&diff=126VERIMAG2013-01-30T09:44:54Z<p>David Monniaux: +slippymap</p>
<hr />
<div>'''VERIMAG''' is a joint research laboratory of [[wikipedia:CNRS|CNRS]], [[wikipedia:Joseph Fourier University|Joseph Fourier University]] (UJF) and [[wikipedia:Grenoble Institute of Technology|Grenoble Institute of Technology]] (Grenoble-INP).<br />
<br />
It is located in Gières, a suburb of Grenoble, 150m off the main UJF/INP campus, and is connected by public transportation to campus sites and the Grenoble city center.<br />
<br />
The academic staff of the laboratory is composed of:<br />
* Full-time permanent researchers (junior, ''chargé de recherche'', or senior, ''directeur de recherche'') from CNRS.<br />
* Professors (junior, ''maître de conférence'', or senior, ''professeur des universités'') from the UJF and INP.<br />
<br />
In addition, the laboratory comprises:<br />
* Other teaching staff<br />
* Research engineers<br />
* Technical staff<br />
* Clerical staff<br />
* PhD and masters students<br />
* Interns<br />
<br />
<slippymap lat="45.188597" lon="5.779509" w="450" h="300" format="jpeg" layer="mapnik"/></div>David Monniauxhttp://stator.imag.fr/w/index.php?title=VERIMAG&diff=125VERIMAG2013-01-30T09:35:23Z<p>David Monniaux: </p>
<hr />
<div>'''VERIMAG''' is a joint research laboratory of [[wikipedia:CNRS|CNRS]], [[wikipedia:Joseph Fourier University|Joseph Fourier University]] (UJF) and [[wikipedia:Grenoble Institute of Technology|Grenoble Institute of Technology]] (Grenoble-INP).<br />
<br />
It is located in Gières, a suburb of Grenoble, 150m off the main UJF/INP campus, and is connected by public transportation to campus sites and the Grenoble city center.<br />
<br />
The academic staff of the laboratory is composed of:<br />
* Full-time permanent researchers (junior, ''chargé de recherche'', or senior, ''directeur de recherche'') from CNRS.<br />
* Professors (junior, ''maître de conférence'', or senior, ''professeur des universités'') from the UJF and INP.<br />
<br />
In addition, the laboratory comprises:<br />
* Other teaching staff<br />
* Research engineers<br />
* Technical staff<br />
* Clerical staff<br />
* PhD and masters students<br />
* Interns</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=VERIMAG&diff=124VERIMAG2013-01-30T09:33:11Z<p>David Monniaux: Created page with "'''VERIMAG''' is a joint research laboratory of CNRS, Joseph Fourier University (UJF) and [[wikipedia:Grenoble Insti..."</p>
<hr />
<div>'''VERIMAG''' is a joint research laboratory of [[wikipedia:CNRS|CNRS]], [[wikipedia:Joseph Fourier University|Joseph Fourier University]] (UJF) and [[wikipedia:Grenoble Institute of Technology|Grenoble Institute of Technology]] (Grenoble-INP).<br />
<br />
The academic staff of the laboratory is composed of:<br />
* Full-time permanent researchers (junior, ''chargé de recherche'', or senior, ''directeur de recherche'') from CNRS.<br />
* Professors (junior, ''maître de conférence'', or senior, ''professeur des universités'') from the UJF and INP.<br />
<br />
In addition, the laboratory comprises:<br />
* Other teaching staff<br />
* Research engineers<br />
* Technical staff<br />
* Clerical staff<br />
* PhD and masters students<br />
* Interns</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Main_Page&diff=123Main Page2013-01-30T09:28:30Z<p>David Monniaux: </p>
<hr />
<div>==The STATOR project==<br />
[[Image:ERC acronym.pdf|150px|right]]<br />
'''STATOR''' is a 5-year research project funded by the [[wikipedia:European Research Council|European Research Council]], an organisation established by the [[wikipedia:European Union|European Union]]. [[Image:Flag of Europe.svg||40px]]<br />
'<br />
<br />
It focuses on developing new methods for [[static analysis]] of software — that is, mathematically and automatically proving that software behaves in the desired way.<br />
<br />
The project is led by [[User:David Monniaux|Dr David Monniaux]], senior researcher at [[wikipedia:CNRS|CNRS]].<br />
<br />
For more detail, see [[:File:STATOR PE6 306595 description of work shortened.pdf|description of work]].<br />
<br />
==Laboratory==<br />
[[Image:Logo VERIMAG vectorise.svg|100px]]<br />
[[Image:UJFquadriBaseGauche.png|180px]]<br />
[[Image:WEB CNRS-filaire-Quadri.jpg|80px]]<br />
<br />
'''STATOR''' is hosted at [[VERIMAG]], a joint research laboratory of CNRS and [[wikipedia:Université Joseph Fourier|Université Joseph Fourier]] in [[wikipedia:Grenoble|Grenoble]], France.<br />
<br />
[[File:Grenoble from Moucherotte IMG 0861 tuned.jpg|800px]]</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=122Internships2013-01-30T09:27:29Z<p>David Monniaux: /* CV */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country (a bachelor degree may take from 3 to 5 years depending on the country, the particular kind of degree, etc.). Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniauxhttp://stator.imag.fr/w/index.php?title=Internships&diff=121Internships2013-01-30T09:25:56Z<p>David Monniaux: /* General conditions */</p>
<hr />
<div>==General conditions==<br />
The STATOR project may accept as interns :<br />
* Masters students, e.g. "Research masters" (French M2R).<br />
* Graduate students pursuing PhDs in other groups.<br />
* Highly performing undergraduate students (no need to apply if you're average, sorry).<br />
<br />
Internships may range from engineering (e.g. implementing new front-ends or GUIs) to research.<br />
<br />
==Application==<br />
Applications should be directed to [[User:David Monniaux|Dr David Monniaux]], principal investigator of the project.<br />
<br />
The application should include:<br />
* A clear explanation of the context of the internship (for which diploma pursued at which university; possibly, the name of the academic who suggested the STATOR project).<br />
* A CV. Please note that the usual CVs meant for corporate hiring processes may be insufficient; see [[#CV|below]].<br />
* Motivations articulated according to the goals of the STATOR project (generic motivations, which could apply to any research or engineering area, are insufficient).<br />
<br />
===Basic prerequisites===<br />
It is expected that interns pursue a degree in computer science (or perhaps mathematics), speak English or French, and demonstrate proficiency in the domains needed for the particular internship topic. These are required, not sufficient conditions.<br />
<br />
Please check that your profile fits the topics of the STATOR project. We receive many applications from students who focus on networks, VLSI design, artificial intelligence — topics that we do not study inside this project; off-topic applications are rejected.<br />
<br />
Our academic staff speaks French or English and possibly other languages. Speaking French is not necessary for scientific purposes, though it may help in daily life (we have staff who do speak French, indicating that this is not much of a problem).<br />
<br />
===CV===<br />
Most students applying for internships send CV or résumés meant for corporate recruiters. Typically, they are short (2 pages), include very little details as to the topics that have been studied, and instead list the hobbies or extracurricular activities of the applicant. Such CVs are inadequate for academic pursuits.<br />
<br />
Scientific research has prerequisites; for instance, research on [[wikipedia:Satisfiability Modulo Theories|satisfiability modulo theory]] presupposes knowledge on mathematical logic, linear programming (including convex duality properties), and efficient implementation techniques. Some of such knowledge may be acquired during the internship, but, given the short duration of typical internships, it is desirable that as much as possible has already been learned through preceding classes.<br />
<br />
Thus, we expect that '''the CV contain a list of subjects studied in the university'''. Please be specific as to the content of classes: an identification number such as INF423 tells us nothing, "algorithmics" is a very broad term; "algorithmics (sorting, dynamic programming, graph traversals)" is much more specific and informative.<br />
<br />
If you have done other internships, please list them, including the name of the company or research group, the name of the supervisor and the topic. If you have written a report (or, perhaps, a scientific article), please attach it.<br />
<br />
Please keep in mind that we do not necessarily know your university, or even the way the university system works in your country. Please be specific and explain all grading issues (e.g. some countries grade from 0 to 20 upwards, others from A to E downwards, etc.), all terms that could be unfamiliar to us, including acronyms, etc. Please mind that we may contact academics knowledgeable about your country (or even originating from it) and that lies or exaggerations are likely to be detected.<br />
<br />
===Dates and duration===<br />
Please give us an interval for starting and ending dates.<br />
<br />
Please keep in mind that academic staff in our group will typically be on vacation between Christmas and New Years Day, and some weeks in August. Additionally, we may be teaching, or attending scientific conferences, or going to meetings.<br />
<br />
Getting to know a topic takes some time. Certain universities expect their students to take short internships, e.g. 6 weeks; this is insufficient for getting to know a new topic and doing something interesting about it. We thus tend to prefer longer internships (at least 3 months).<br />
<br />
===For non-European students===<br />
If you are neither from the European Union nor from associated countries (e.g. Switzerland), we will need to apply for a work permit at least 3 months in advance (and preferably longer). This requires non-negligible work for our academic and clerical staff, independent of the duration of the internship.<br />
<br />
We therefore strongly prefer longer internships in such cases.<br />
<br />
In addition, we advise you to inquire for information about visa requirements from the nearest French consulate or by browsing appropriate official sites.<br />
<br />
==Locale==<br />
The internship will take place at [[VERIMAG]], located near Grenoble, in southeastern France.<br />
<br />
Unless the internship is very short, or the intern is supported by other means (e.g. salary, grant, ''bourse'', etc.), he or she will receive a stipend from the university (at least 435€ per month).</div>David Monniaux