We survey some results on security protocol analysis that have contributed to the development of verification systems capable of detecting real flaws. In particular we recall the principles of constrained-based analysis of security protocols and some decision procedures based on algebraic properties of cryptographic functions. We present some potential applications of the same security protocol analysis techniques to service oriented computing such as the synthesis of a secure composed service and its validation.