This work presents a formal description of a subset of a C-like language in the form of an operational semantics. We give semantics to the following statements (presented in alphabetical order) : assignation, break, composition, continue, goto, if, skip and while. The s is given by an abstract machine composed by an stack, two counters and three functions. We prove some expected properties of the semantics.