Applying Testability Transformations to Achieve Structural Coverage of Erlang Programs [chapter]

Qiang Guo, John Derrick, Neil Walkinshaw
2009 Lecture Notes in Computer Science  
This paper studies the structural testing of Erlang applications. A program transformation is proposed that represents the program under test as a binary tree. The challenge of achieving structural coverage can thus be interpreted as a tree-search procedure. We have developed a testing-technique that takes advantage of this tree-structure, which we demonstrate with respect to a small case study of an Erlang telephony system.
doi:10.1007/978-3-642-05031-2_6 fatcat:6pudlgealzdpta5flyoebekzp4