Applying Testability Transformations to Achieve Structural Coverage of Erlang Programs

Authors:
Qiang Guo;John Derrick;Neil Walkinshaw
Affiliations:
Department of Computer Science, The University of Sheffield, Portobello, UK S1 4DP;Department of Computer Science, The University of Sheffield, Portobello, UK S1 4DP;Department of Computer Science, The University of Sheffield, Portobello, UK S1 4DP
Venue:
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Year:
2009

Citing 13
Cited 0

Temporal logic of programs

Temporal logic of programs
Concurrent programming in ERLANG (2nd ed.)

Concurrent programming in ERLANG (2nd ed.)
Software unit test coverage and adequacy

ACM Computing Surveys (CSUR)
Symbolic execution and program testing

Communications of the ACM
Software Testability: The New Verification

IEEE Software
Testability Transformation

IEEE Transactions on Software Engineering
Search-based software test data generation: a survey: Research Articles

Software Testing, Verification & Reliability
Testing telecoms software with quviq QuickCheck

Proceedings of the 2006 ACM SIGPLAN workshop on Erlang
Using model transformation to support model-based test coverage measurement

Proceedings of the 3rd international workshop on Automation of software test
Verifying Erlang Telecommunication Systems with the Process Algebra μCRL

FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Model transformation testing: oracle issue

ICSTW '08 Proceedings of the 2008 IEEE International Conference on Software Testing Verification and Validation Workshop
A Transformation-Based Approach to Generating Scenario-Oriented Test Cases from UML Activity Diagrams for Concurrent Applications

COMPSAC '08 Proceedings of the 2008 32nd Annual IEEE International Computer Software and Applications Conference
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.