Type inference and strong static type checking for Promela by Donaldson, A, Gay, S

“…To handle subtyping between base types, we present an extension to a standard unification algorithm to solve a system of equality and subtyping constraints, based on bounded substitutions.…”