As you may be aware, by the Godel Incompleteness Theorem, it can not be proved in, for example, $\mathsf{ZFC}$ that there are models of $\mathsf{ZFC}$, one usually assumes $\mathsf{ZFC}$ is consistent and result are usually states as "If there exists a model of $\mathsf{ZFC}$, then ...". Another way to think of this is (again assuming the consistency of $\mathsf{ZFC}$, one assumes that we are working in a single fixed model $V$ and studying all the models that that $V$ has.
Another possible approach for studying models of $\mathsf{ZFC}$ is work in an axiom system that implies the existence of models of $\sf{ZFC}$. The common approach to this is augmenting $\sf{ZFC}$ with large cardinal axioms such as the inaccessible, measurable, etc. Then there actually exists a set model of $\sf{ZFC}$ and possible much more.
Finally, another common approach is rather than study model of the full $\sf{ZFC}$, one can instead study $\{\in\}$-structures satisfying certain axioms and having certain properties (like transitivity). By the usual compactness argument in logic, one can get nice models for finite amount of $\text{ZFC}$. For those who are doing independence results in set theory, models of finite amount of $\sf{ZFC}$ is often sufficent (essentially due to the fact that proofs of theorems are finite). This is a common approach to models used in forcing.
It should also be noted that sometimes in proving independence result, one works with "models" that are not even sets at all. These are really proper classes (or you could think of them as just formulas). The common examples are the well-founded $\text{WF}$ and Constructible $L$. Although these are not sets, they are used to prove independence results through relativization.
I suggest reading the appropriate sections of Kunen's Set Theory for the various mathematical formal approach to handling models of set theory.