liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Techniques for Automatic Generation of Tests from Programs and Specifications
Linköping University, Department of Computer and Information Science, PELAB. Linköping University, The Institute of Technology.
2006 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

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.

Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2006. , 181 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1034
Keyword [en]
testing, automatic test data generation, partition testing, constraint solving, program coverage, specification coverage
National Category
Software Engineering
URN: urn:nbn:se:liu:diva-7829ISBN: 91–85523–31–3OAI: diva2:22757
Public defence
2006-10-20, Alan Turing, Hus E, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)
Available from: 2006-11-27 Created: 2006-11-27

Open Access in DiVA

fulltext(1137 kB)919 downloads
File information
File name FULLTEXT01.pdfFile size 1137 kBChecksum MD5
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Edvardsson, Jon
By organisation
PELABThe Institute of Technology
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 919 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1434 hits
ReferencesLink to record
Permanent link

Direct link