The relations between the pi-calculus and logic have been less extensively studied than for the lambda-calculus. We give an account on what can be found in the literature, in two distinct directions: model-checking, and typing. We propose a Curry-Howard correspondence taking into account the dynamic properties of the pi-calculus. This is a first presentation of a work in progress.