Owning to the damage of denial of service attacks in security protocols, resistance of denial of service attacks plays an important role in remote voting protocols. Recently Meng et al. proposed a secure remote internet voting protocol that claims to satisfy formal definitions of key properties without physical constrains. In this study firstly the review of the formal model of resistance of denial of service attacks in security protocols is introduced, then extended applied pi calculus and Huang et al. formal model are reviewed, after that Meng et al. protocol is modeled in extended applied pi calculus, finally resistance of denial of service attacks is proved with ProVerif.