We consider the problem of specifying a model of a Zero Copy Secured Protocol for LTL verification purpose with the Model Checker SPIN. ZCSP is based on Direct Memory Access. Datas are directly read/written in user space memory, decreasing latency and saving processor computing time. We first introduce the ZCSP protocol before analysing different ways of modelling. Two main steps were performed : A finite and a none finite sequences model. The first model gave us an overview of the protocol robustness. The second allowed us to test realistics properties. We also describe LTL properties that were checked with the SPIN model checker. Unfortunately the size of the system is frequently prohibitive. Thus, we explain all minimization we had to perform.