Detecting and Visualising Process Relationships in Erlang | Zendy

Melinda Tóth | Zendy; István Bozó | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Detecting and Visualising Process Relationships in Erlang

Author(s) -

Melinda Tóth,

István Bozó

Publication year - 2014

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2014.05.138

Subject(s) - computer science , erlang (programming language) , process (computing) , data mining , data science , theoretical computer science , programming language , functional programming

tatic 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research