Abstract

Abstract: Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verification techniques have been applied to imperative and object-oriented languages, like Java and C#, but few have been applied to a higher-order lazy functional language, like Haskell. In this talk, I will describe a sound and automatic static verification framework for Haskell, that is based on contracts and symbolic execution. Our approach is modular and gives precise blame assignments at compile-time in the presence of higher-order functions and laziness.

Biography: Dana N. Xu is a research scientist at Paris-Rocquencourt research center of INRIA , a French national research institute in computer science and applied mathematics. She worked as a postdoctoral researcher at INRIA Grenoble for one year in 2009. She received her Ph.D. from University of Cambridge and her B.Comp.(Hons) and M.Sc.(by research) from National University of Singapore.

Her main research interest is in functional programming languages, their implementation and applications. She is interested in building reliable and efficient software through programming language design, static analysis, type theory, program verification, optimization and automatic parallelization.