Orodje za določanje testnih poti z uporabo strukturnega grafa programa

KALEZIĆ, LUKA (author), Rožanc, Igor (mentor)

V diplomski nalogi predstavljamo razvoj in programiranje orodja, ki določa testne poti iz strukturnih grafov programske kode, da jih lahko uporabimo pri pisanju testov. Za programsko kodo določimo model, v našem primeru strukturni graf, in na podlagi tega izberemo testne zahteve. Testne zahteve določamo z uporabo izbranega kriterija pokritja grafa. Osnovna pokritja so pokritje vozlišč -- NC, pokritje povezav -- EC, pokritje parov povezav -- EPC in pokritje primitivnih poti -- PPC. V naše orodje na začetku vnesemo graf s povezovanjem že narisanih vozlišč. Če imamo testne poti že znane, lahko z našim orodjem preverimo, če ustrezajo izbranemu pokritju. V nasprotnem primeru orodje izpiše vse ugotovitve testne poti za kriterij pokritja. Testne poti izpiše na zaslon in shrani v datoteko. Orodje je intuitivno in preprosto za uporabo. Uspešno smo ga preverili na več algoritmih za urejanje. Analiza je pokazala, da orodje prihrani veliko časa v primerjavi z ročnim določanjem testov.

• Language: Slovenian
• Keywords: testiranje programa, strukturni graf programa, pokritje grafa, pokritje volišč -- NC, pokritje povezav -- EC, pokritje parov povezav -- EPC, pokritje primitivnih poti -- PPC
• Work type: Bachelor thesis/paper
• Typology: 2.11 - Undergraduate Thesis
• Organization: FRI - Faculty of Computer and Information Science
• Year: 2022
• PID: 20.500.12556/RUL-135045
• COBISS.SI-ID: 98327811
• Publication date in RUL: 18.02.2022

KALEZIĆ, LUKA, 2022, Orodje za določanje testnih poti z uporabo strukturnega grafa programa [online]. Bachelor’s thesis. [Accessed 17 May 2025]. Retrieved from: https://repozitorij.uni-lj.si/IzpisGradiva.php?lang=eng&id=135045

Secondary language

• Language: English
• Title: Tool for determining test paths using a control-flow graph of a program

Abstract

In the diploma thesis we present the development of java tool that determines the test paths from the control-flow graphs of the program code in order to use them for writing tests. We define a model for the program code, in our case a control-flow graph, and on this basis we select test requirements. Test requirements are determined using the selected graph coverage criteria. The basic graph coverage criterias are node coverage -- NC, edge coverage -- EC, edge pair coverage -- EPC and primitive path coverage -- PPC. At the beginning, the graph is inserted into our tool by connecting already drawn nodes. If we already have the test paths and want to check them, our tool checks them to see if they cover the selected coverage criteria. Otherwise, the tool can also provide correct test path for the coverage criteria. The correct test paths are printed and saved into a file. The tool is intuitive and easy to use. It has been successfully tested on several sorting algorithms. The analysis showed that the tool saves a lot of time compared to manual determination of test paths.

• Keywords: program testing, program structural graph, graph coverage, node coverage -- NC, edge coverage -- EC, edge pair coverage -- EPC, primitive path coverage -- PPC