Welcome!

This is the website of Pierre Talbot.

Abstract domains for constraint programming (Postdoc 2018-2020)

I am a postdoc researcher at the University of Nantes in the team TASC of the LS2N laboratory. The long term goal of this project is to combine concepts from the fields of abstract interpretation and constraint programming. The problem is that constraint programming is mostly used on finite domains, although many problems are also defined on continuous domains. Abstract interpretation provides a nice way to combine continuous and finite domains through its notion of abstract domains. In this context, my project is to integrate integer abstract domains (such as octogons) in the constraint solver AbSolute, and to contribute to the underlying theory merging both fields.

Spacetime Programming: A Synchronous Language for Constraint Search (Ph.D. 2014-2018)
  • bonsai is a language implementing the spacetime paradigm for Java.
  • pcp is a library for constraint solving written in the language Rust.
  • oak is a PEG parser investigating the notion of AST inference.