Liu, LikaiKfoury, Assaf J.Bestavros, AzerGabay, YaromBradley, Adam D.Matta, Ibrahim2011-10-202011-10-202005-12-28https://hdl.handle.net/2144/1859We present a type inference algorithm, in the style of compositional analysis, for the language TRAFFIC—a specification language for flow composition applications proposed in [2]—and prove that this algorithm is correct: the typings it infers are principal typings, and the typings agree with syntax-directed type checking on closed flow specifications. This algorithm is capable of verifying partial flow specifications, which is a significant improvement over syntax-directed type checking algorithm presented in [3]. We also show that this algorithm runs efficiently, i.e., in low-degree polynomial time.en-USTechnical Report