Högskolan i Skövde

his.sePublikasjoner
Endre søk
Begrens søket
1 - 4 of 4
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Ferrari, Fabiano C.
    et al.
    Computing Department, Federal University of São Carlos, Brazil.
    Durelli, Vinicius H. S.
    Computer Science Department, Federal University of São João del-Rei, Brazil.
    Andler, Sten F.
    Högskolan i Skövde, Institutionen för informationsteknologi. Högskolan i Skövde, Forskningsmiljön Informationsteknologi.
    Offutt, Jeff
    Department of Computer Science, University at Albany, Albany, NY, United States.
    Saadatmand, Mehrdad
    RISE Research Institutes of Sweden, Västerås, Sweden.
    Müllner, Nils
    DLR (Deutsche Luft- und Raumfahrt, German Aerospace Center), Cologne, Germany.
    On transforming model-based tests into code: A systematic literature review2023Inngår i: Software testing, verification & reliability, ISSN 0960-0833, E-ISSN 1099-1689, Vol. 33, nr 8, artikkel-id e1860Artikkel, forskningsoversikt (Fagfellevurdert)
    Abstract [en]

    Model-based test design is increasingly being applied in practice and studied in research. Model-based testing (MBT) exploits abstract models of the software behaviour to generate abstract tests, which are then transformed into concrete tests ready to run on the code. Given that abstract tests are designed to cover models but are run on code (after transformation), the effectiveness of MBT is dependent on whether model coverage also ensures coverage of key functional code. In this article, we investigate how MBT approaches generate tests from model specifications and how the coverage of tests designed strictly based on the model translates to code coverage. We used snowballing to conduct a systematic literature review. We started with three primary studies, which we refer to as the initial seeds. At the end of our search iterations, we analysed 30 studies that helped answer our research questions. More specifically, this article characterizes how test sets generated at the model level are mapped and applied to the source code level, discusses how tests are generated from the model specifications, analyses how the test coverage of models relates to the test coverage of the code when the same test set is executed and identifies the technologies and software development tasks that are on focus in the selected studies. Finally, we identify common characteristics and limitations that impact the research and practice of MBT: (i) some studies did not fully describe how tools transform abstract tests into concrete tests, (ii) some studies overlooked the computational cost of model-based approaches and (iii) some studies found evidence that bears out a robust correlation between decision coverage at the model level and branch coverage at the code level. We also noted that most primary studies omitted essential details about the experiments. 

  • 2.
    Grindal, Mats
    et al.
    Högskolan i Skövde, Institutionen för kommunikation och information.
    Offutt, Jeff
    Högskolan i Skövde, Institutionen för kommunikation och information.
    Andler, Sten F.
    Högskolan i Skövde, Institutionen för kommunikation och information.
    Combination Testing Strategies: A Survey2005Inngår i: Software testing, verification & reliability, ISSN 0960-0833, E-ISSN 1099-1689, Vol. 15, nr 3, s. 167-199Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Combination strategies are test case selection methods that identify test cases by combining values of the different test object input parameters based on some combinatorial strategy. This survey presents 16 different combination strategies, covering more than 40 papers that focus on one or several combination strategies. This collection represents most of the existing work performed on combination strategies. This survey describes the basic algorithms used by the combination strategies. Some properties of combination strategies, including coverage criteria and theoretical bounds on the size of test suites, are also included in this description. This survey paper also includes a subsumption hierarchy that attempts to relate the various coverage criteria associated with the identified combination strategies

  • 3.
    Lindström, Birgitta
    et al.
    Högskolan i Skövde, Institutionen för informationsteknologi. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
    Márki, András
    Högskolan i Skövde, Institutionen för informationsteknologi. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
    On strong mutation and the theory of subsuming logic‐based mutants2019Inngår i: Software testing, verification & reliability, ISSN 0960-0833, E-ISSN 1099-1689, Vol. 29, nr 1-2 Special Issue: SI, s. 1-23, artikkel-id e1667Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Redundant mutants might cause problems when benchmarking since testing techniques can get high scores without detecting any nonredundant mutants. However, removing nonredundant mutants might cause similar problems. Subsumed mutants are per definition also redundant since no additional tests are required to detect them once all other mutants are detected. We focus on relational operator replacement (ROR) and conditional operator replacement mutants. Subsumption relations between ROR mutants are defined by fault hierarchies. The fault hierarchies are proven for weak mutation but have since they were published been used with strong mutation. We prove that ROR fault hierarchies do not hold for strong mutation and show why. We also show that the probability for a random test to experience the problem can be more than 30% and that 50% of the mutants might be affected in a real software system. Finally, we show that there is a similar problem with the theory on sufficient conditional operator replacement.

  • 4.
    Saadatmand, Mehrdad
    et al.
    RISE Research Institutes of Sweden, RISE SICS Västerås.
    Lindström, Birgitta
    Högskolan i Skövde, Institutionen för informationsteknologi. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
    Aichernig, Bernhard K.
    Graz University of Technology, Institute for Software Technology, Austria.
    Special issue on testing extra-functional properties2020Inngår i: Software testing, verification & reliability, ISSN 0960-0833, E-ISSN 1099-1689, Vol. 30, nr 1, artikkel-id e1726Artikkel i tidsskrift (Annet vitenskapelig)
1 - 4 of 4
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf