This report is part of a projected series whose aim is to present in a synthetic way the major methods and models in the average-case analysis of algorithms. The present work (counting and generating functions) introduces a symbolic approach through formal specifications to the analysis of basic combinatorial structures. It consists of three chapters : symbolic enumeration and ordinary generating functions - labelled structures and exponential generating functions - parameters and multivariate generating functions.