Concurrent Erlang Flow Graphs
Manfred Widera · 2005
Flow graphs are an important, and useful tool for testing programs or program components during software development. For imperative languages it is state of the art to use flow graph based coverage tools during the unit testing stage. Based on flow graphs for functional programming languages, that have to cope with higher order functions, a flow graph concept for Erlang needs a special treatment for the concurrent language constructs that are typical of Erlang. This paper presents a definition of flow graphs for Erlang programs that especially handles process generation and message passing, and describes how these flow graphs can be computed. 1.