Flow graphs for testing sequential erlang programs

  • Authors:
  • Manfred Widera

  • Affiliations:
  • FernUniversitt Hagen, Hagen, Germany

  • Venue:
  • ERLANG '04 Proceedings of the 2004 ACM SIGPLAN workshop on Erlang
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Testing of software components during development is a heavily used approach to detect programming errors and to evaluate the quality of software. Systematic approaches to software testing get a more and more increasing impact on software development processes. For imperative programs there are several approaches to measure the appropriateness of a set of test cases for a program part under testing. Some of them are source code directed and are given as coverage criteria on flow graphs.This paper gives a definition of flow graphs for Erlang programs and describes a tool for generating such flow graphs. It provides a first step towards the transfer of advanced source code directed testing methods to functional programming.