Startsida
Hjälp
Sök i LIBRIS databas

     

 

Sökning: onr:v9x71fr5spvfz16h > Model-Based Test Ca...

Model-Based Test Case Generation for Real-Time Systems [Elektronisk resurs]

Hessel, Anders, 1968- (författare)
Pettersson, Paul (preses)
Jonsson, Bengt (preses)
Aichernig, Bernhard K. (opponent)
Uppsala universitet Teknisk-naturvetenskapliga vetenskapsområdet (utgivare)
Uppsala universitet Teknisk-naturvetenskapliga vetenskapsområdet (utgivare)
Publicerad: Uppsala : Acta Universitatis Upsaliensis, 2007
Engelska 59
Serie: Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, 1651-6214 1651-6214 ; 301
Läs hela texten
Läs hela texten
  • E-bokAvhandling(Diss. (sammanfattning) Uppsala : Uppsala universitet, 2007)
Sammanfattning Ämnesord
Stäng  
  • Testing is the dominant verification technique used in the software industry today. The use of automatic test case execution increases, but the creation of test cases remains manual and thus error prone and expensive. To automate generation and selection of test cases, model-based testing techniques have been suggested. In this thesis two central problems in model-based testing are addressed: the problem of how to formally specify coverage criteria, and the problem of how to generate a test suite from a formal timed system model, such that the test suite satisfies a given coverage criterion. We use model checking techniques to explore the state-space of a model until a set of traces is found that together satisfy the coverage criterion. A key observation is that a coverage criterion can be viewed as consisting of a set of items, which we call coverage items. Each coverage item can be treated as a separate reachability problem. Based on our view of coverage items we define a language, in the form of parameterized observer automata, to formally describe coverage criteria. We show that the language is expressive enough to describe a variety of common coverage criteria described in the literature. Two algorithms for test case generation with observer automata are presented. The first algorithm returns a trace that satisfies all coverage items with a minimum cost. We use this algorithm to generate a test suite with minimal execution time. The second algorithm explores only states that may increase the already found set of coverage items. This algorithm works well together with observer automata. The developed techniques have been implemented in the tool CoVer. The tool has been used in a case study together with Ericsson where a WAP gateway has been tested. The case study shows that the techniques have industrial strength. 

Genre

government publication  (marcgt)

Indexterm och SAB-rubrik

Model-Based Testing
Model Checking
Coverage Criteria
Real-Time Systems
Black-Box Testing
Timed Automata
Test Case Generation
Conformance Testing
Inställningar Hjälp

Uppgift om bibliotek saknas i LIBRIS

Kontakta ditt bibliotek, eller sök utanför LIBRIS. Se högermenyn.

Sök utanför LIBRIS

Hjälp
Om LIBRIS
Sekretess
Hjälp
Fel i posten?
Kontakt
Teknik och format
Sök utifrån
Sökrutor
Plug-ins
Bookmarklet
Anpassa
Textstorlek
Kontrast
Vyer
LIBRIS söktjänster
SwePub
Uppsök

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

Copyright © LIBRIS - Nationella bibliotekssystem

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy