Detecting and Visualising Process Relationships in Erlang
Melinda Tóth, István Bozó · Procedia Computer Science · 2014
Abstract Static software analyser tools can help in program comprehension by detecting relations among program parts. Detecting relations among the concurrent program parts, e.g. relations between processes, is not straightforward. In case of dynamic languages only a (good) approximation of the real dependencies can be calculated. In this paper we present algorithms to build a process relation graph for Erlang programs. The graph contains direct relation through message passing and hidden relations represented by the ETS (Erlang Term Storage) tables.