Techniques for automatic generation of tests from programs and specifications / by Jon Edvardsson.

• Software testing is complex and time consuming. One way to reduce the effort associated with testing is to generate test data automatically. This thesis is divided into three parts. In the first part a mixed-integer constraint solver developed by Gupta et. al is studied. The solver, referred to as the Unified Numerical Approach (una), is an important part of their generator and it is responsible for solving equation systems that correspond to the program path currently under test. In this thesis it is shown that, in contrast to traditional optimization methods, the una is not bounded by the size of the solved equation system. Instead, it depends on how the system is composed. That is, even for very simple systems consisting of one variable we can easily get more than a thousand iterations. It is also shown that the una is not complete, that is, it does not always find a mixed-integer solution when there is one. It is found that a better approach is to use a traditional optimization method, like the simplex method in combination with branch-and-bound and/or a cutting-plane algorithm as a constraint solver. The second part explores a specification-based approach for generating tests developed by Meudec. Tests are generated by partitioning the specification input domain into a set of subdomains using a rule-based automatic partitioning strategy. An important step of Meudec’s method is to reduce the number of generated subdomains and find a minimal partition. This thesis shows that Meudec’s minimal partition algorithm is incorrect. Furthermore, two new efficient alternative algorithms are developed. In addition, an algorithm for finding the upper and lower bound on the number of subdomains in a partition is also presented. Finally, in the third part, two different designs of automatic testing tools are studied. The first tool uses a specification as an oracle. The second tool, on the other hand, uses a reference program. The fault-detection effectiveness of the tools is evaluated using both randomly and systematically generated inputs. 

Ämnesord

Programutveckling  (sao)

Natural Sciences  (ssif)

Computer and Information Sciences  (ssif)

Software Engineering  (ssif)

Naturvetenskap  (ssif)

Data- och informationsvetenskap (Datateknik)  (ssif)

Programvaruteknik  (ssif)

TECHNOLOGY  (svep)

Information technology  (svep)

Computer science  (svep)

Software engineering  (svep)

TEKNIKVETENSKAP  (svep)

Informationsteknik  (svep)

Datavetenskap  (svep)

Programvaruteknik  (svep)

Software engineering  (LCSH)

Genre

government publication  (marcgt)

Indexterm och SAB-rubrik

testing

automatic test data generation

partition testing

constraint solving

program coverage

specification coverage

Pubb Programmering

Klassifikation

005.1 (DDC)

Pubb (kssb/7)