Control flow graphs are a well-known graphical representation of programs that capture the control flow but abstract from program details. In this paper, we derive decision graphs that reduce control flow graphs but preserve the branching structure of programs. As an application to software engineering, we use decision graphs to compare and clarify different definitions of branch covering in software testing.
CITATION STYLE
Gold, R. (2013). Decision Graphs and Their Application to Software Testing. ISRN Software Engineering, 2013, 1–12. https://doi.org/10.1155/2013/432021
Mendeley helps you to discover research relevant for your work.