Sciweavers

Share
ERLANG
2004
ACM

Flow graphs for testing sequential Erlang programs

12 years 5 months ago
Flow graphs for testing sequential Erlang programs
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. Categories and Subject Descriptors: D.2.5 [Software Engineer
Manfred Widera
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where ERLANG
Authors Manfred Widera
Comments (0)
books