Mickaël Delahaye

Également disponible en français

Postdoctoral research fellow at Laboratoire Informatique de Grenoble (LIG), University Joseph Fourier

PhD in Computer Science of the University of Rennes 1

Contact information

Email
NOmickael Sdelahaye,PAimag Mfr (Hint: ignore caps, replace spaces by dots and comma by at sign)

Research

I am interested in various aspects of computer programming, notably language design and software verification (testing and proof).

Done under the advisement of Arnaud Gotlieb (INRIA Rennes, Celtique team), my thesis concerns automated test case generation using constraint program­ming for C programs. Indeed, spurred on by Nicky Williams, my previous host laboratory at the Commissariat à l'Énergie Atomique et aux Énergies Alternatives (CEA), called LSL, has developped a tool named PathCrawler (try it out online!) aimed to generate test data for C programs.

In a program, there may be paths allowed by the control flow primitives (calls, jumps, conditionals and loops) for which there is no inputs that activate them. Faced with such a path, a test generator, like PathCrawler, looks in vain for an input, effectively proving the path infeasible –a time-consuming and useless task with respect to our goal. During my thesis, I have developped the idea of using an infea­sible path detected by the test gene­ration, to infer a family of infeasible paths. Indeed, infeasible paths are often similar. More exactly, my method, called infeasible path genera­lization, consists first of explaining the path infea­sibility and of finding as much as possible paths that are infeasible for the very same reason. These ideas are experimented in the IPEG tool.

Teaching